/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-de32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:35:44,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:35:44,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:35:44,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:35:44,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:35:44,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:35:44,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:35:44,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:35:44,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:35:44,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:35:44,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:35:44,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:35:44,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:35:44,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:35:44,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:35:44,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:35:44,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:35:44,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:35:44,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:35:44,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:35:44,207 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:35:44,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:35:44,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:35:44,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:35:44,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:35:44,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:35:44,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:35:44,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:35:44,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:35:44,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:35:44,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:35:44,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:35:44,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:35:44,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:35:44,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:35:44,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:35:44,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:35:44,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:35:44,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:35:44,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:35:44,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:35:44,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:35:44,225 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:35:44,236 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:35:44,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:35:44,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:35:44,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:35:44,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:35:44,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:35:44,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:35:44,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:35:44,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:35:44,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:35:44,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:35:44,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:35:44,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:35:44,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:35:44,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:35:44,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:35:44,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:35:44,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:35:44,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:35:44,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:35:44,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:35:44,240 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:35:44,240 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:35:44,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:35:44,240 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:35:44,240 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:35:44,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:35:44,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:35:44,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:35:44,478 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:35:44,479 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:35:44,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-28 03:35:44,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c0b4d5a/3eb0b5c5aa654511a05450a92d78f338/FLAG6a89334ab [2022-04-28 03:35:44,825 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:35:44,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-28 03:35:44,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c0b4d5a/3eb0b5c5aa654511a05450a92d78f338/FLAG6a89334ab [2022-04-28 03:35:45,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c0b4d5a/3eb0b5c5aa654511a05450a92d78f338 [2022-04-28 03:35:45,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:35:45,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:35:45,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:35:45,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:35:45,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:35:45,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:35:45" (1/1) ... [2022-04-28 03:35:45,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117c141c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45, skipping insertion in model container [2022-04-28 03:35:45,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:35:45" (1/1) ... [2022-04-28 03:35:45,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:35:45,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:35:45,402 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-de32.c[368,381] [2022-04-28 03:35:45,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:35:45,420 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:35:45,432 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-de32.c[368,381] [2022-04-28 03:35:45,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:35:45,446 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:35:45,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45 WrapperNode [2022-04-28 03:35:45,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:35:45,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:35:45,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:35:45,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:35:45,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45" (1/1) ... [2022-04-28 03:35:45,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45" (1/1) ... [2022-04-28 03:35:45,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45" (1/1) ... [2022-04-28 03:35:45,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45" (1/1) ... [2022-04-28 03:35:45,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45" (1/1) ... [2022-04-28 03:35:45,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45" (1/1) ... [2022-04-28 03:35:45,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45" (1/1) ... [2022-04-28 03:35:45,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:35:45,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:35:45,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:35:45,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:35:45,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45" (1/1) ... [2022-04-28 03:35:45,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:35:45,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:35:45,528 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:35:45,543 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:35:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:35:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:35:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:35:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:35:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:35:45,564 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:35:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:35:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:35:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:35:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:35:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:35:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:35:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:35:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:35:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:35:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:35:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:35:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:35:45,612 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:35:45,613 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:35:45,778 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:35:45,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:35:45,784 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 03:35:45,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:35:45 BoogieIcfgContainer [2022-04-28 03:35:45,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:35:45,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:35:45,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:35:45,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:35:45,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:35:45" (1/3) ... [2022-04-28 03:35:45,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d75d664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:35:45, skipping insertion in model container [2022-04-28 03:35:45,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:45" (2/3) ... [2022-04-28 03:35:45,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d75d664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:35:45, skipping insertion in model container [2022-04-28 03:35:45,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:35:45" (3/3) ... [2022-04-28 03:35:45,806 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de32.c [2022-04-28 03:35:45,815 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:35:45,815 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:35:45,846 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:35:45,852 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@6b39d929, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c6c0056 [2022-04-28 03:35:45,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:35:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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:35:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:35:45,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:45,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:45,865 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:45,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-28 03:35:45,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:45,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57142462] [2022-04-28 03:35:45,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:35:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 2 times [2022-04-28 03:35:45,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:45,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783495264] [2022-04-28 03:35:45,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:45,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:46,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:46,088 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); {25#true} is VALID [2022-04-28 03:35:46,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 03:35:46,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-28 03:35:46,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:46,092 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); {25#true} is VALID [2022-04-28 03:35:46,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 03:35:46,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-28 03:35:46,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-28 03:35:46,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25#true} is VALID [2022-04-28 03:35:46,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !(~x~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:35:46,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:35:46,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:35:46,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-28 03:35:46,103 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:35:46,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:35:46,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-28 03:35:46,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 03:35:46,105 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:35:46,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:46,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783495264] [2022-04-28 03:35:46,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783495264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:46,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:46,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:35:46,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:46,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57142462] [2022-04-28 03:35:46,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57142462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:46,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:46,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:35:46,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621053026] [2022-04-28 03:35:46,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:46,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:35:46,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:46,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:46,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:35:46,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:46,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:35:46,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:35:46,175 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:46,498 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-28 03:35:46,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:35:46,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:35:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-28 03:35:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-28 03:35:46,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-28 03:35:46,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:46,590 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:35:46,590 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:35:46,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:35:46,595 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:46,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:35:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:35:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:35:46,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:46,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,622 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,622 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:46,624 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 03:35:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 03:35:46,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:46,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:46,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:35:46,625 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:35:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:46,627 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 03:35:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 03:35:46,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:46,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:46,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:46,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-28 03:35:46,631 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2022-04-28 03:35:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:46,631 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-28 03:35:46,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-28 03:35:46,652 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:35:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 03:35:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:35:46,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:46,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:46,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:35:46,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:46,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:46,660 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 1 times [2022-04-28 03:35:46,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:46,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [80776246] [2022-04-28 03:35:46,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:35:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 2 times [2022-04-28 03:35:46,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:46,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587645882] [2022-04-28 03:35:46,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:46,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:46,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {206#true} is VALID [2022-04-28 03:35:46,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-28 03:35:46,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-28 03:35:46,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:46,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {206#true} is VALID [2022-04-28 03:35:46,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-28 03:35:46,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-28 03:35:46,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} call #t~ret11 := main(); {206#true} is VALID [2022-04-28 03:35:46,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {211#(= main_~y~0 0)} is VALID [2022-04-28 03:35:46,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {211#(= main_~y~0 0)} is VALID [2022-04-28 03:35:46,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(= main_~y~0 0)} ~z~0 := ~y~0; {211#(= main_~y~0 0)} is VALID [2022-04-28 03:35:46,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {211#(= main_~y~0 0)} is VALID [2022-04-28 03:35:46,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {207#false} is VALID [2022-04-28 03:35:46,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#false} assume !(~y~0 % 4294967296 > 0); {207#false} is VALID [2022-04-28 03:35:46,752 INFO L272 TraceCheckUtils]: 11: Hoare triple {207#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {207#false} is VALID [2022-04-28 03:35:46,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2022-04-28 03:35:46,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2022-04-28 03:35:46,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {207#false} assume !false; {207#false} is VALID [2022-04-28 03:35:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:35:46,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:46,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587645882] [2022-04-28 03:35:46,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587645882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:46,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:46,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:35:46,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:46,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [80776246] [2022-04-28 03:35:46,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [80776246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:46,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:46,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:35:46,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520216097] [2022-04-28 03:35:46,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:46,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:35:46,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:46,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:46,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:35:46,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:46,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:35:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:35:46,772 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:46,841 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-28 03:35:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:35:46,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:35:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 03:35:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-28 03:35:46,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-28 03:35:46,874 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:35:46,875 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:35:46,876 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:35:46,876 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:35:46,877 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:46,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:35:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:35:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-28 03:35:46,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:46,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,885 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,885 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:46,887 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-28 03:35:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 03:35:46,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:46,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:46,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:35:46,888 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:35:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:46,890 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-28 03:35:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 03:35:46,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:46,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:46,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:46,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-28 03:35:46,892 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-28 03:35:46,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:46,893 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-28 03:35:46,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:46,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-28 03:35:46,921 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:35:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 03:35:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:35:46,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:46,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:46,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:35:46,922 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:46,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1179931951, now seen corresponding path program 1 times [2022-04-28 03:35:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:46,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [896092677] [2022-04-28 03:35:47,232 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:35:47,237 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:35:47,242 INFO L85 PathProgramCache]: Analyzing trace with hash 115301550, now seen corresponding path program 1 times [2022-04-28 03:35:47,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:47,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040907471] [2022-04-28 03:35:47,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:47,271 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:35:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:47,305 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:35:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:47,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {367#true} is VALID [2022-04-28 03:35:47,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-28 03:35:47,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {367#true} {367#true} #61#return; {367#true} is VALID [2022-04-28 03:35:47,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:47,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {367#true} is VALID [2022-04-28 03:35:47,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-28 03:35:47,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #61#return; {367#true} is VALID [2022-04-28 03:35:47,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret11 := main(); {367#true} is VALID [2022-04-28 03:35:47,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {372#(= main_~y~0 0)} is VALID [2022-04-28 03:35:47,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {372#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {373#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:35:47,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {373#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {374#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:35:47,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [65] L23-2-->L29-1_primed: Formula: (let ((.cse0 (= v_main_~z~0_7 v_main_~z~0_6)) (.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_12 v_main_~x~0_11)) (.cse4 (mod v_main_~z~0_7 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ (* (- 1) v_main_~z~0_6) v_main_~x~0_12 v_main_~z~0_7) v_main_~x~0_11) (< v_main_~z~0_6 v_main_~z~0_7) (< 0 .cse4) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~z~0_6 v_it_1 1) v_main_~z~0_7)) (< 0 (mod (+ v_main_~z~0_7 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1))))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~x~0=v_main_~x~0_12, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_7, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_11, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_6, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {374#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:35:47,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {374#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [64] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {375#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:35:47,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {375#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {375#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:35:47,438 INFO L272 TraceCheckUtils]: 11: Hoare triple {375#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {376#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:35:47,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {377#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:35:47,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {368#false} is VALID [2022-04-28 03:35:47,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#false} assume !false; {368#false} is VALID [2022-04-28 03:35:47,439 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:35:47,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:47,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040907471] [2022-04-28 03:35:47,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040907471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:47,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:47,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:35:47,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:47,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [896092677] [2022-04-28 03:35:47,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [896092677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:47,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:47,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:35:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797673282] [2022-04-28 03:35:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:35:47,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:47,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:47,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:35:47,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:47,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:35:47,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:35:47,502 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:47,733 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 03:35:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:35:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:35:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 03:35:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 03:35:47,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-28 03:35:47,768 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:35:47,768 INFO L225 Difference]: With dead ends: 27 [2022-04-28 03:35:47,769 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:35:47,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:35:47,772 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:47,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 40 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:35:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:35:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:35:47,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:47,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,781 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,781 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:47,783 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-28 03:35:47,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 03:35:47,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:47,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:47,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states 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:35:47,784 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states 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:35:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:47,785 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-28 03:35:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 03:35:47,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:47,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:47,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:47,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-28 03:35:47,786 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-04-28 03:35:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:47,787 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-28 03:35:47,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-28 03:35:47,823 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:35:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 03:35:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:35:47,824 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:47,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:47,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:35:47,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:47,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 1 times [2022-04-28 03:35:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:47,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1495499352] [2022-04-28 03:35:48,079 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:35:48,081 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:35:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1046489728, now seen corresponding path program 1 times [2022-04-28 03:35:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:48,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477502424] [2022-04-28 03:35:48,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:48,097 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:35:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:48,124 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:35:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:48,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {515#true} is VALID [2022-04-28 03:35:48,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume true; {515#true} is VALID [2022-04-28 03:35:48,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {515#true} {515#true} #61#return; {515#true} is VALID [2022-04-28 03:35:48,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:48,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {515#true} is VALID [2022-04-28 03:35:48,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2022-04-28 03:35:48,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #61#return; {515#true} is VALID [2022-04-28 03:35:48,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret11 := main(); {515#true} is VALID [2022-04-28 03:35:48,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {520#(= main_~y~0 0)} is VALID [2022-04-28 03:35:48,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#(= main_~y~0 0)} [67] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_19 4294967296)) (.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= v_main_~y~0_9 v_main_~y~0_8)) (.cse3 (= v_main_~x~0_19 v_main_~x~0_18)) (.cse4 (= |v_main_#t~post5_4| |v_main_#t~post5_3|))) (or (and (< 0 .cse0) (= v_main_~y~0_8 (+ (* (- 1) v_main_~x~0_18) v_main_~x~0_19 v_main_~y~0_9)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_19 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_18 v_it_2 1) v_main_~x~0_19)))) (< v_main_~x~0_18 v_main_~x~0_19)) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_19, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_18, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {521#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 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:35:48,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [66] 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[] {522#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 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:35:48,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {522#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 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; {523#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)))} is VALID [2022-04-28 03:35:48,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {523#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)))} assume !(~z~0 % 4294967296 > 0); {520#(= main_~y~0 0)} is VALID [2022-04-28 03:35:48,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {516#false} is VALID [2022-04-28 03:35:48,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#false} assume !(~y~0 % 4294967296 > 0); {516#false} is VALID [2022-04-28 03:35:48,377 INFO L272 TraceCheckUtils]: 12: Hoare triple {516#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {516#false} is VALID [2022-04-28 03:35:48,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2022-04-28 03:35:48,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2022-04-28 03:35:48,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {516#false} assume !false; {516#false} is VALID [2022-04-28 03:35:48,378 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:35:48,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:48,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477502424] [2022-04-28 03:35:48,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477502424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:48,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:48,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:35:49,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1495499352] [2022-04-28 03:35:49,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1495499352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:49,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:49,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:35:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399934237] [2022-04-28 03:35:49,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:49,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:35:49,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:49,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:51,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:51,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:35:51,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:51,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:35:51,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:35:51,259 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:52,929 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 03:35:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:35:52,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:35:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-04-28 03:35:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-04-28 03:35:52,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2022-04-28 03:35:53,089 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:35:53,090 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:35:53,090 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:35:53,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:35:53,091 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:53,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2022-04-28 03:35:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:35:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:35:53,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:53,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:53,107 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:53,108 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:53,109 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:35:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:35:53,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:53,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:53,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:35:53,109 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:35:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:53,110 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:35:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:35:53,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:53,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:53,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:53,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 03:35:53,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-28 03:35:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:53,112 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 03:35:53,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:53,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 03:35:53,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:53,832 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:35:53,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:35:53,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:53,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:53,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:35:53,833 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1578117650, now seen corresponding path program 1 times [2022-04-28 03:35:53,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:53,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [773578564] [2022-04-28 03:35:56,109 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:35:56,111 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:35:56,114 INFO L85 PathProgramCache]: Analyzing trace with hash 643370031, now seen corresponding path program 1 times [2022-04-28 03:35:56,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:56,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296282737] [2022-04-28 03:35:56,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:56,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:56,129 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:35:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:56,165 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:35:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:56,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {651#true} is VALID [2022-04-28 03:35:56,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-28 03:35:56,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #61#return; {651#true} is VALID [2022-04-28 03:35:56,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:56,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {651#true} is VALID [2022-04-28 03:35:56,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-28 03:35:56,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #61#return; {651#true} is VALID [2022-04-28 03:35:56,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret11 := main(); {651#true} is VALID [2022-04-28 03:35:56,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {656#(= main_~y~0 0)} is VALID [2022-04-28 03:35:56,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(= main_~y~0 0)} [69] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_27 4294967296)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse4 (= v_main_~x~0_27 v_main_~x~0_26))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~x~0_27 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_17 v_it_3 1) v_main_~y~0_16)))) (< v_main_~y~0_17 v_main_~y~0_16) (= v_main_~x~0_26 (+ v_main_~x~0_27 v_main_~y~0_17 (* (- 1) v_main_~y~0_16)))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_17, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_27, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {657#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:35:56,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)))} [68] 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[] {658#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:35:56,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} ~z~0 := ~y~0; {659#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:35:56,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 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; {660#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:35:56,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {660#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {660#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:35:56,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {652#false} is VALID [2022-04-28 03:35:56,338 INFO L272 TraceCheckUtils]: 12: Hoare triple {652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {652#false} is VALID [2022-04-28 03:35:56,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2022-04-28 03:35:56,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2022-04-28 03:35:56,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-28 03:35:56,339 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:35:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:56,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296282737] [2022-04-28 03:35:56,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296282737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:56,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:56,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:35:56,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:56,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [773578564] [2022-04-28 03:35:56,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [773578564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:56,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:56,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:35:56,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142575747] [2022-04-28 03:35:56,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:56,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:35:56,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:56,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:56,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:56,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:35:56,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:56,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:35:56,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:35:56,784 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:56,931 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:35:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:35:56,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:35:56,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-04-28 03:35:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-04-28 03:35:56,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2022-04-28 03:35:58,236 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:35:58,237 INFO L225 Difference]: With dead ends: 23 [2022-04-28 03:35:58,237 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:35:58,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:35:58,239 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:58,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2022-04-28 03:35:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:35:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:35:58,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:58,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:58,271 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:58,272 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:58,273 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 03:35:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:35:58,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:58,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:58,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states 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:35:58,273 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states 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:35:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:58,274 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 03:35:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:35:58,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:58,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:58,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:58,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 03:35:58,276 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-04-28 03:35:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:58,276 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 03:35:58,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:58,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 03:36:00,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:36:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:36:00,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:00,386 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:36:00,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:36:00,387 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:00,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-04-28 03:36:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:00,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [607586987] [2022-04-28 03:36:00,627 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:36:00,629 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1187832866, now seen corresponding path program 1 times [2022-04-28 03:36:00,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:00,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609741441] [2022-04-28 03:36:00,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:00,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:00,642 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:36:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:00,656 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:36:00,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:00,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {790#true} is VALID [2022-04-28 03:36:00,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 03:36:00,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 03:36:00,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:00,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {790#true} is VALID [2022-04-28 03:36:00,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 03:36:00,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 03:36:00,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret11 := main(); {790#true} is VALID [2022-04-28 03:36:00,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {790#true} is VALID [2022-04-28 03:36:00,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#true} [71] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_34 v_main_~x~0_33)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse1 (mod v_main_~x~0_34 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_33 (+ v_main_~x~0_34 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_34) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_main_~y~0_24 v_it_4 1) v_main_~y~0_23)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {790#true} is VALID [2022-04-28 03:36:00,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} [70] 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[] {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:00,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:00,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {795#(<= 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; {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:00,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:00,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:00,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:00,728 INFO L272 TraceCheckUtils]: 13: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {797#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:36:00,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {797#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {798#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:36:00,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {798#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {791#false} is VALID [2022-04-28 03:36:00,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 03:36:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:00,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609741441] [2022-04-28 03:36:00,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609741441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:00,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172427293] [2022-04-28 03:36:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:00,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:00,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:00,732 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:36:00,732 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:36:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:00,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:36:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:00,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:01,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-28 03:36:01,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {790#true} is VALID [2022-04-28 03:36:01,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 03:36:01,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 03:36:01,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret11 := main(); {790#true} is VALID [2022-04-28 03:36:01,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {790#true} is VALID [2022-04-28 03:36:01,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#true} [71] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_34 v_main_~x~0_33)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse1 (mod v_main_~x~0_34 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_33 (+ v_main_~x~0_34 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_34) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_main_~y~0_24 v_it_4 1) v_main_~y~0_23)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {790#true} is VALID [2022-04-28 03:36:01,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} [70] 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[] {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:01,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:01,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {795#(<= 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; {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:01,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:01,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:01,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:01,065 INFO L272 TraceCheckUtils]: 13: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:01,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:01,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-28 03:36:01,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 03:36:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:01,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:01,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 03:36:01,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-28 03:36:01,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:01,330 INFO L272 TraceCheckUtils]: 13: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:01,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:01,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:01,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:01,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {795#(<= 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; {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:01,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:01,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} [70] 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[] {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:01,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#true} [71] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_34 v_main_~x~0_33)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse1 (mod v_main_~x~0_34 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_33 (+ v_main_~x~0_34 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_34) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_main_~y~0_24 v_it_4 1) v_main_~y~0_23)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {790#true} is VALID [2022-04-28 03:36:01,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {790#true} is VALID [2022-04-28 03:36:01,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret11 := main(); {790#true} is VALID [2022-04-28 03:36:01,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 03:36:01,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 03:36:01,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {790#true} is VALID [2022-04-28 03:36:01,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-28 03:36:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:01,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172427293] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:01,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:01,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 03:36:01,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:01,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [607586987] [2022-04-28 03:36:01,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [607586987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:01,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:01,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:36:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208210926] [2022-04-28 03:36:01,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:01,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:36:01,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:01,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:01,380 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:36:01,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:36:01,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:01,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:36:01,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:36:01,381 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:01,615 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 03:36:01,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:36:01,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:36:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 03:36:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 03:36:01,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-28 03:36:01,651 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:36:01,652 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:36:01,652 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:36:01,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 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:36:01,653 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:01,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:36:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:36:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-28 03:36:01,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:01,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:36:01,683 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:36:01,683 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:36:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:01,684 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 03:36:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 03:36:01,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:01,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:01,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 23 states. [2022-04-28 03:36:01,685 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 23 states. [2022-04-28 03:36:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:01,686 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 03:36:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 03:36:01,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:01,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:01,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:01,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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:36:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 03:36:01,688 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2022-04-28 03:36:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:01,688 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 03:36:01,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:01,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 03:36:02,568 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:36:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:36:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:36:02,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:02,569 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:02,594 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:36:02,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 03:36:02,770 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:02,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 2 times [2022-04-28 03:36:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:02,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1009750752] [2022-04-28 03:36:04,985 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:36:04,988 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1469355377, now seen corresponding path program 1 times [2022-04-28 03:36:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:04,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953110033] [2022-04-28 03:36:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:05,001 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:36:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:05,030 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:36:05,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:05,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {1065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1056#true} is VALID [2022-04-28 03:36:05,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} assume true; {1056#true} is VALID [2022-04-28 03:36:05,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1056#true} {1056#true} #61#return; {1056#true} is VALID [2022-04-28 03:36:05,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:05,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {1065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1056#true} is VALID [2022-04-28 03:36:05,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} assume true; {1056#true} is VALID [2022-04-28 03:36:05,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} #61#return; {1056#true} is VALID [2022-04-28 03:36:05,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {1056#true} call #t~ret11 := main(); {1056#true} is VALID [2022-04-28 03:36:05,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1056#true} is VALID [2022-04-28 03:36:05,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {1056#true} [73] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_45 4294967296)) (.cse0 (= v_main_~x~0_45 v_main_~x~0_44)) (.cse1 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse2 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_44 (+ v_main_~x~0_45 v_main_~y~0_32 (* (- 1) v_main_~y~0_31))) (< v_main_~y~0_32 v_main_~y~0_31) (< 0 .cse4) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (< 0 (mod (+ v_main_~x~0_45 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_32 v_it_5 1) v_main_~y~0_31))))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_45, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1056#true} is VALID [2022-04-28 03:36:05,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#true} [72] 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[] {1056#true} is VALID [2022-04-28 03:36:05,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {1056#true} ~z~0 := ~y~0; {1061#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:36:05,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(= 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; {1062#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:36:05,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:36:05,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:05,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1057#false} is VALID [2022-04-28 03:36:05,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {1057#false} assume !(~y~0 % 4294967296 > 0); {1057#false} is VALID [2022-04-28 03:36:05,086 INFO L272 TraceCheckUtils]: 14: Hoare triple {1057#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1057#false} is VALID [2022-04-28 03:36:05,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-28 03:36:05,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-28 03:36:05,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-28 03:36:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:05,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:05,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953110033] [2022-04-28 03:36:05,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953110033] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:05,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271275004] [2022-04-28 03:36:05,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:05,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:05,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:05,088 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:36:05,105 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:36:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:05,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:36:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:05,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:05,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2022-04-28 03:36:05,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1056#true} is VALID [2022-04-28 03:36:05,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} assume true; {1056#true} is VALID [2022-04-28 03:36:05,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} #61#return; {1056#true} is VALID [2022-04-28 03:36:05,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {1056#true} call #t~ret11 := main(); {1056#true} is VALID [2022-04-28 03:36:05,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1056#true} is VALID [2022-04-28 03:36:05,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {1056#true} [73] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_45 4294967296)) (.cse0 (= v_main_~x~0_45 v_main_~x~0_44)) (.cse1 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse2 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_44 (+ v_main_~x~0_45 v_main_~y~0_32 (* (- 1) v_main_~y~0_31))) (< v_main_~y~0_32 v_main_~y~0_31) (< 0 .cse4) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (< 0 (mod (+ v_main_~x~0_45 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_32 v_it_5 1) v_main_~y~0_31))))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_45, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1056#true} is VALID [2022-04-28 03:36:05,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#true} [72] 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[] {1056#true} is VALID [2022-04-28 03:36:05,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {1056#true} ~z~0 := ~y~0; {1061#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:36:05,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(= 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; {1062#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:36:05,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:36:05,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:05,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1057#false} is VALID [2022-04-28 03:36:05,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {1057#false} assume !(~y~0 % 4294967296 > 0); {1057#false} is VALID [2022-04-28 03:36:05,402 INFO L272 TraceCheckUtils]: 14: Hoare triple {1057#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1057#false} is VALID [2022-04-28 03:36:05,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-28 03:36:05,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-28 03:36:05,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-28 03:36:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:05,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:05,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-28 03:36:05,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-28 03:36:05,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-28 03:36:05,674 INFO L272 TraceCheckUtils]: 14: Hoare triple {1057#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1057#false} is VALID [2022-04-28 03:36:05,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {1057#false} assume !(~y~0 % 4294967296 > 0); {1057#false} is VALID [2022-04-28 03:36:05,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1057#false} is VALID [2022-04-28 03:36:05,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:05,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:36:05,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 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; {1141#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:36:05,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {1056#true} ~z~0 := ~y~0; {1145#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:36:05,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#true} [72] 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[] {1056#true} is VALID [2022-04-28 03:36:05,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {1056#true} [73] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_45 4294967296)) (.cse0 (= v_main_~x~0_45 v_main_~x~0_44)) (.cse1 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse2 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_44 (+ v_main_~x~0_45 v_main_~y~0_32 (* (- 1) v_main_~y~0_31))) (< v_main_~y~0_32 v_main_~y~0_31) (< 0 .cse4) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (< 0 (mod (+ v_main_~x~0_45 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_32 v_it_5 1) v_main_~y~0_31))))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_45, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1056#true} is VALID [2022-04-28 03:36:05,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1056#true} is VALID [2022-04-28 03:36:05,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {1056#true} call #t~ret11 := main(); {1056#true} is VALID [2022-04-28 03:36:05,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} #61#return; {1056#true} is VALID [2022-04-28 03:36:05,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} assume true; {1056#true} is VALID [2022-04-28 03:36:05,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1056#true} is VALID [2022-04-28 03:36:05,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2022-04-28 03:36:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:05,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271275004] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:05,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:05,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 03:36:05,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:05,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1009750752] [2022-04-28 03:36:05,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1009750752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:05,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:05,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:36:05,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052682266] [2022-04-28 03:36:05,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:05,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:36:05,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:05,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:05,773 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:36:05,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:36:05,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:05,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:36:05,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:36:05,774 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:06,104 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-28 03:36:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:36:06,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:36:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-28 03:36:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-28 03:36:06,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2022-04-28 03:36:06,145 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:36:06,146 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:36:06,146 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:36:06,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:36:06,147 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:06,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 38 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:36:06,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:36:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 03:36:06,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:06,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:06,180 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:06,180 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:06,181 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 03:36:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 03:36:06,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:06,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:06,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:36:06,182 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:36:06,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:06,182 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 03:36:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 03:36:06,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:06,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:06,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:06,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-28 03:36:06,184 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-04-28 03:36:06,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:06,184 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-28 03:36:06,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:06,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-28 03:36:08,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 03:36:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:36:08,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:08,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:08,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 03:36:08,478 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,SelfDestructingSolverStorable6 [2022-04-28 03:36:08,479 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1137046944, now seen corresponding path program 3 times [2022-04-28 03:36:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:08,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558921634] [2022-04-28 03:36:08,672 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:36:08,674 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:08,676 INFO L85 PathProgramCache]: Analyzing trace with hash 27882048, now seen corresponding path program 1 times [2022-04-28 03:36:08,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:08,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167281170] [2022-04-28 03:36:08,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:08,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:08,684 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:36:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:08,699 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:36:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:08,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {1350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1341#true} is VALID [2022-04-28 03:36:08,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {1341#true} assume true; {1341#true} is VALID [2022-04-28 03:36:08,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1341#true} {1341#true} #61#return; {1341#true} is VALID [2022-04-28 03:36:08,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {1341#true} call ULTIMATE.init(); {1350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:08,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {1350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1341#true} is VALID [2022-04-28 03:36:08,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {1341#true} assume true; {1341#true} is VALID [2022-04-28 03:36:08,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1341#true} {1341#true} #61#return; {1341#true} is VALID [2022-04-28 03:36:08,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {1341#true} call #t~ret11 := main(); {1341#true} is VALID [2022-04-28 03:36:08,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {1341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1341#true} is VALID [2022-04-28 03:36:08,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {1341#true} [75] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_56 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42)) (.cse2 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse3 (= v_main_~x~0_56 v_main_~x~0_55)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (= v_main_~x~0_55 (+ v_main_~x~0_56 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_43 v_it_6 1) v_main_~y~0_42)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_56 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_56, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_55, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1341#true} is VALID [2022-04-28 03:36:08,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {1341#true} [74] 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[] {1341#true} is VALID [2022-04-28 03:36:08,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {1341#true} ~z~0 := ~y~0; {1346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:36:08,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1346#(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; {1347#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:36:08,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {1347#(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; {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:08,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:08,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:08,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1342#false} is VALID [2022-04-28 03:36:08,767 INFO L272 TraceCheckUtils]: 14: Hoare triple {1342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1342#false} is VALID [2022-04-28 03:36:08,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {1342#false} ~cond := #in~cond; {1342#false} is VALID [2022-04-28 03:36:08,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {1342#false} assume 0 == ~cond; {1342#false} is VALID [2022-04-28 03:36:08,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {1342#false} assume !false; {1342#false} is VALID [2022-04-28 03:36:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:08,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:08,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167281170] [2022-04-28 03:36:08,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167281170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:08,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396827222] [2022-04-28 03:36:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:08,772 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:36:08,796 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:36:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:08,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:36:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:08,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:09,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {1341#true} call ULTIMATE.init(); {1341#true} is VALID [2022-04-28 03:36:09,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {1341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1341#true} is VALID [2022-04-28 03:36:09,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1341#true} assume true; {1341#true} is VALID [2022-04-28 03:36:09,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1341#true} {1341#true} #61#return; {1341#true} is VALID [2022-04-28 03:36:09,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {1341#true} call #t~ret11 := main(); {1341#true} is VALID [2022-04-28 03:36:09,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {1341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1341#true} is VALID [2022-04-28 03:36:09,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {1341#true} [75] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_56 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42)) (.cse2 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse3 (= v_main_~x~0_56 v_main_~x~0_55)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (= v_main_~x~0_55 (+ v_main_~x~0_56 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_43 v_it_6 1) v_main_~y~0_42)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_56 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_56, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_55, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1341#true} is VALID [2022-04-28 03:36:09,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {1341#true} [74] 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[] {1341#true} is VALID [2022-04-28 03:36:09,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {1341#true} ~z~0 := ~y~0; {1346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:36:09,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {1346#(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; {1347#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:36:09,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {1347#(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; {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:09,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:09,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:09,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1342#false} is VALID [2022-04-28 03:36:09,213 INFO L272 TraceCheckUtils]: 14: Hoare triple {1342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1342#false} is VALID [2022-04-28 03:36:09,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {1342#false} ~cond := #in~cond; {1342#false} is VALID [2022-04-28 03:36:09,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {1342#false} assume 0 == ~cond; {1342#false} is VALID [2022-04-28 03:36:09,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {1342#false} assume !false; {1342#false} is VALID [2022-04-28 03:36:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:09,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:09,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {1342#false} assume !false; {1342#false} is VALID [2022-04-28 03:36:09,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {1342#false} assume 0 == ~cond; {1342#false} is VALID [2022-04-28 03:36:09,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {1342#false} ~cond := #in~cond; {1342#false} is VALID [2022-04-28 03:36:09,448 INFO L272 TraceCheckUtils]: 14: Hoare triple {1342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1342#false} is VALID [2022-04-28 03:36:09,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1342#false} is VALID [2022-04-28 03:36:09,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:09,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:09,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1426#(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; {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:09,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {1430#(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; {1426#(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:36:09,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {1341#true} ~z~0 := ~y~0; {1430#(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:36:09,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {1341#true} [74] 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[] {1341#true} is VALID [2022-04-28 03:36:09,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {1341#true} [75] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_56 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42)) (.cse2 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse3 (= v_main_~x~0_56 v_main_~x~0_55)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (= v_main_~x~0_55 (+ v_main_~x~0_56 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_43 v_it_6 1) v_main_~y~0_42)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_56 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_56, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_55, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1341#true} is VALID [2022-04-28 03:36:09,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {1341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1341#true} is VALID [2022-04-28 03:36:09,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {1341#true} call #t~ret11 := main(); {1341#true} is VALID [2022-04-28 03:36:09,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1341#true} {1341#true} #61#return; {1341#true} is VALID [2022-04-28 03:36:09,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {1341#true} assume true; {1341#true} is VALID [2022-04-28 03:36:09,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {1341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1341#true} is VALID [2022-04-28 03:36:09,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {1341#true} call ULTIMATE.init(); {1341#true} is VALID [2022-04-28 03:36:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:09,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396827222] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:09,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:09,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 03:36:09,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:09,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558921634] [2022-04-28 03:36:09,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558921634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:09,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:09,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:36:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152959161] [2022-04-28 03:36:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:09,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:36:09,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:09,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:09,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:09,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:36:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:09,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:36:09,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:36:09,549 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:09,905 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 03:36:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:36:09,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:36:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2022-04-28 03:36:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2022-04-28 03:36:09,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 28 transitions. [2022-04-28 03:36:09,940 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:36:09,940 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:36:09,940 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:36:09,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:36:09,941 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:09,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 46 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:36:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:36:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 03:36:09,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:09,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:36:09,989 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:36:09,989 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:36:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:09,990 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 03:36:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:36:09,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:09,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:09,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 21 states. [2022-04-28 03:36:09,991 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 21 states. [2022-04-28 03:36:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:09,991 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 03:36:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:36:09,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:09,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:09,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:09,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 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:36:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-28 03:36:09,993 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-04-28 03:36:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:09,993 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-28 03:36:09,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:09,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-28 03:36:12,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:36:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:36:12,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:12,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:12,161 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:36:12,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:12,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:12,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:12,346 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 4 times [2022-04-28 03:36:12,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:12,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2126551133] [2022-04-28 03:36:16,462 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:36:16,541 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:36:16,543 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash 570197997, now seen corresponding path program 1 times [2022-04-28 03:36:16,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:16,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387010992] [2022-04-28 03:36:16,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:16,554 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:36:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:16,569 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:36:16,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:16,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {1624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1614#true} is VALID [2022-04-28 03:36:16,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {1614#true} assume true; {1614#true} is VALID [2022-04-28 03:36:16,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1614#true} {1614#true} #61#return; {1614#true} is VALID [2022-04-28 03:36:16,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {1614#true} call ULTIMATE.init(); {1624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:16,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1614#true} is VALID [2022-04-28 03:36:16,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {1614#true} assume true; {1614#true} is VALID [2022-04-28 03:36:16,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1614#true} {1614#true} #61#return; {1614#true} is VALID [2022-04-28 03:36:16,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {1614#true} call #t~ret11 := main(); {1614#true} is VALID [2022-04-28 03:36:16,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {1614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1614#true} is VALID [2022-04-28 03:36:16,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {1614#true} [77] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_67 4294967296)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse2 (= v_main_~x~0_67 v_main_~x~0_66)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse1 0) .cse2 .cse3) (and (< 0 .cse1) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_67 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_7 1) v_main_~x~0_67)) (not (<= 1 v_it_7)))) (< v_main_~x~0_66 v_main_~x~0_67) (= (+ v_main_~x~0_67 v_main_~y~0_53 (* (- 1) v_main_~x~0_66)) v_main_~y~0_52)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse0 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1614#true} is VALID [2022-04-28 03:36:16,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {1614#true} [76] 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[] {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:16,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:16,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {1619#(<= 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; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:16,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#(<= 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; {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:16,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:16,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:16,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:16,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:16,661 INFO L272 TraceCheckUtils]: 15: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1622#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:36:16,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {1622#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1623#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:36:16,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {1623#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1615#false} is VALID [2022-04-28 03:36:16,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {1615#false} assume !false; {1615#false} is VALID [2022-04-28 03:36:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:16,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:16,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387010992] [2022-04-28 03:36:16,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387010992] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:16,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128121930] [2022-04-28 03:36:16,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:16,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:16,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:16,664 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:36:16,668 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:36:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:16,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:36:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:16,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:16,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {1614#true} call ULTIMATE.init(); {1614#true} is VALID [2022-04-28 03:36:16,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1614#true} is VALID [2022-04-28 03:36:16,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {1614#true} assume true; {1614#true} is VALID [2022-04-28 03:36:16,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1614#true} {1614#true} #61#return; {1614#true} is VALID [2022-04-28 03:36:16,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {1614#true} call #t~ret11 := main(); {1614#true} is VALID [2022-04-28 03:36:16,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {1614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1614#true} is VALID [2022-04-28 03:36:16,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {1614#true} [77] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_67 4294967296)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse2 (= v_main_~x~0_67 v_main_~x~0_66)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse1 0) .cse2 .cse3) (and (< 0 .cse1) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_67 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_7 1) v_main_~x~0_67)) (not (<= 1 v_it_7)))) (< v_main_~x~0_66 v_main_~x~0_67) (= (+ v_main_~x~0_67 v_main_~y~0_53 (* (- 1) v_main_~x~0_66)) v_main_~y~0_52)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse0 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1614#true} is VALID [2022-04-28 03:36:16,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {1614#true} [76] 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[] {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:16,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:16,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {1619#(<= 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; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:16,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#(<= 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; {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:16,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:16,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:16,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:16,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:16,956 INFO L272 TraceCheckUtils]: 15: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:16,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {1673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:16,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {1677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1615#false} is VALID [2022-04-28 03:36:16,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {1615#false} assume !false; {1615#false} is VALID [2022-04-28 03:36:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:16,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:17,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {1615#false} assume !false; {1615#false} is VALID [2022-04-28 03:36:17,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {1677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1615#false} is VALID [2022-04-28 03:36:17,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {1673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:17,196 INFO L272 TraceCheckUtils]: 15: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:17,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:17,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:17,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:17,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:17,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#(<= 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; {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:17,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {1619#(<= 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; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:17,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:17,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {1614#true} [76] 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[] {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:17,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {1614#true} [77] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_67 4294967296)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse2 (= v_main_~x~0_67 v_main_~x~0_66)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse1 0) .cse2 .cse3) (and (< 0 .cse1) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_67 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_7 1) v_main_~x~0_67)) (not (<= 1 v_it_7)))) (< v_main_~x~0_66 v_main_~x~0_67) (= (+ v_main_~x~0_67 v_main_~y~0_53 (* (- 1) v_main_~x~0_66)) v_main_~y~0_52)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse0 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1614#true} is VALID [2022-04-28 03:36:17,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {1614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1614#true} is VALID [2022-04-28 03:36:17,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {1614#true} call #t~ret11 := main(); {1614#true} is VALID [2022-04-28 03:36:17,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1614#true} {1614#true} #61#return; {1614#true} is VALID [2022-04-28 03:36:17,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {1614#true} assume true; {1614#true} is VALID [2022-04-28 03:36:17,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {1614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1614#true} is VALID [2022-04-28 03:36:17,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {1614#true} call ULTIMATE.init(); {1614#true} is VALID [2022-04-28 03:36:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:17,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128121930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:17,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:17,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-28 03:36:17,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:17,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2126551133] [2022-04-28 03:36:17,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2126551133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:17,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:17,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:36:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460010953] [2022-04-28 03:36:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:17,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 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:36:17,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:17,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 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:36:17,314 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:36:17,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:36:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:17,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:36:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:36:17,315 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 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:36:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:17,662 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 03:36:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:36:17,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 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:36:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 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:36:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-28 03:36:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 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:36:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-28 03:36:17,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-28 03:36:17,704 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:36:17,704 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:36:17,704 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:36:17,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 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:36:17,705 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:17,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 30 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:36:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:36:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2022-04-28 03:36:17,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:17,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:17,763 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:17,763 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:17,765 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-28 03:36:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 03:36:17,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:17,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:17,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 03:36:17,765 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 03:36:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:17,766 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-28 03:36:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 03:36:17,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:17,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:17,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:17,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-28 03:36:17,767 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2022-04-28 03:36:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:17,768 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-28 03:36:17,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 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:36:17,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-28 03:36:19,436 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:36:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:36:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:36:19,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:19,437 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:19,463 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:36:19,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:19,638 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:19,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash -676577280, now seen corresponding path program 5 times [2022-04-28 03:36:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:19,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [260028396] [2022-04-28 03:36:19,834 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:36:19,835 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1067159456, now seen corresponding path program 1 times [2022-04-28 03:36:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:19,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64134760] [2022-04-28 03:36:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:19,856 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:36:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:19,877 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:36:19,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:19,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {1939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1928#true} is VALID [2022-04-28 03:36:19,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {1928#true} assume true; {1928#true} is VALID [2022-04-28 03:36:19,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1928#true} {1928#true} #61#return; {1928#true} is VALID [2022-04-28 03:36:19,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {1928#true} call ULTIMATE.init(); {1939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:19,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1928#true} is VALID [2022-04-28 03:36:19,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {1928#true} assume true; {1928#true} is VALID [2022-04-28 03:36:19,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1928#true} {1928#true} #61#return; {1928#true} is VALID [2022-04-28 03:36:19,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {1928#true} call #t~ret11 := main(); {1928#true} is VALID [2022-04-28 03:36:19,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {1928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1928#true} is VALID [2022-04-28 03:36:19,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {1928#true} [79] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_83 4294967296)) (.cse1 (= v_main_~y~0_63 v_main_~y~0_62)) (.cse2 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse3 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse4 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_82 v_it_8 1) v_main_~x~0_83)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_83) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_82 v_main_~x~0_83) (= v_main_~y~0_62 (+ (* (- 1) v_main_~x~0_82) v_main_~x~0_83 v_main_~y~0_63)) (< 0 .cse0)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1928#true} is VALID [2022-04-28 03:36:19,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {1928#true} [78] 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[] {1928#true} is VALID [2022-04-28 03:36:19,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {1928#true} ~z~0 := ~y~0; {1933#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:36:19,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(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; {1934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:36:19,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {1934#(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; {1935#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:36:19,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {1935#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:19,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:36:19,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:19,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1929#false} is VALID [2022-04-28 03:36:19,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {1929#false} assume !(~y~0 % 4294967296 > 0); {1929#false} is VALID [2022-04-28 03:36:19,991 INFO L272 TraceCheckUtils]: 16: Hoare triple {1929#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1929#false} is VALID [2022-04-28 03:36:19,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#false} ~cond := #in~cond; {1929#false} is VALID [2022-04-28 03:36:19,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#false} assume 0 == ~cond; {1929#false} is VALID [2022-04-28 03:36:19,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#false} assume !false; {1929#false} is VALID [2022-04-28 03:36:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:19,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:19,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64134760] [2022-04-28 03:36:19,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64134760] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:19,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199322073] [2022-04-28 03:36:19,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:19,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:19,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:19,996 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:36:20,000 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:36:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:20,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:36:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:20,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:20,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {1928#true} call ULTIMATE.init(); {1928#true} is VALID [2022-04-28 03:36:20,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {1928#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1928#true} is VALID [2022-04-28 03:36:20,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {1928#true} assume true; {1928#true} is VALID [2022-04-28 03:36:20,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1928#true} {1928#true} #61#return; {1928#true} is VALID [2022-04-28 03:36:20,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {1928#true} call #t~ret11 := main(); {1928#true} is VALID [2022-04-28 03:36:20,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {1928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1928#true} is VALID [2022-04-28 03:36:20,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {1928#true} [79] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_83 4294967296)) (.cse1 (= v_main_~y~0_63 v_main_~y~0_62)) (.cse2 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse3 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse4 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_82 v_it_8 1) v_main_~x~0_83)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_83) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_82 v_main_~x~0_83) (= v_main_~y~0_62 (+ (* (- 1) v_main_~x~0_82) v_main_~x~0_83 v_main_~y~0_63)) (< 0 .cse0)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1928#true} is VALID [2022-04-28 03:36:20,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {1928#true} [78] 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[] {1928#true} is VALID [2022-04-28 03:36:20,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {1928#true} ~z~0 := ~y~0; {1933#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:36:20,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(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; {1934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:36:20,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {1934#(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; {1935#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:36:20,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {1935#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:20,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:36:20,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:20,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1929#false} is VALID [2022-04-28 03:36:20,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {1929#false} assume !(~y~0 % 4294967296 > 0); {1929#false} is VALID [2022-04-28 03:36:20,388 INFO L272 TraceCheckUtils]: 16: Hoare triple {1929#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1929#false} is VALID [2022-04-28 03:36:20,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#false} ~cond := #in~cond; {1929#false} is VALID [2022-04-28 03:36:20,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#false} assume 0 == ~cond; {1929#false} is VALID [2022-04-28 03:36:20,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#false} assume !false; {1929#false} is VALID [2022-04-28 03:36:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:20,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:20,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#false} assume !false; {1929#false} is VALID [2022-04-28 03:36:20,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#false} assume 0 == ~cond; {1929#false} is VALID [2022-04-28 03:36:20,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#false} ~cond := #in~cond; {1929#false} is VALID [2022-04-28 03:36:20,673 INFO L272 TraceCheckUtils]: 16: Hoare triple {1929#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1929#false} is VALID [2022-04-28 03:36:20,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {1929#false} assume !(~y~0 % 4294967296 > 0); {1929#false} is VALID [2022-04-28 03:36:20,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1929#false} is VALID [2022-04-28 03:36:20,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:20,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:36:20,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {2024#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:20,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {2028#(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; {2024#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:36:20,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {2032#(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; {2028#(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:36:20,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {1928#true} ~z~0 := ~y~0; {2032#(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:36:20,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {1928#true} [78] 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[] {1928#true} is VALID [2022-04-28 03:36:20,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {1928#true} [79] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_83 4294967296)) (.cse1 (= v_main_~y~0_63 v_main_~y~0_62)) (.cse2 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse3 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse4 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_82 v_it_8 1) v_main_~x~0_83)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_83) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_82 v_main_~x~0_83) (= v_main_~y~0_62 (+ (* (- 1) v_main_~x~0_82) v_main_~x~0_83 v_main_~y~0_63)) (< 0 .cse0)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1928#true} is VALID [2022-04-28 03:36:20,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {1928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1928#true} is VALID [2022-04-28 03:36:20,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {1928#true} call #t~ret11 := main(); {1928#true} is VALID [2022-04-28 03:36:20,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1928#true} {1928#true} #61#return; {1928#true} is VALID [2022-04-28 03:36:20,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {1928#true} assume true; {1928#true} is VALID [2022-04-28 03:36:20,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1928#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1928#true} is VALID [2022-04-28 03:36:20,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {1928#true} call ULTIMATE.init(); {1928#true} is VALID [2022-04-28 03:36:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:20,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199322073] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:20,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:20,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-28 03:36:20,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:20,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [260028396] [2022-04-28 03:36:20,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [260028396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:20,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:20,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:36:20,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850037634] [2022-04-28 03:36:20,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:20,757 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:36:20,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:20,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:20,777 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:36:20,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:36:20,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:20,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:36:20,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:36:20,778 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:21,384 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 03:36:21,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:36:21,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:36:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2022-04-28 03:36:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2022-04-28 03:36:21,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 41 transitions. [2022-04-28 03:36:21,429 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:36:21,430 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:36:21,430 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:36:21,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:36:21,431 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:21,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 53 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:36:21,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:36:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:36:21,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:21,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:21,475 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:21,475 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:21,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:21,476 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:36:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:36:21,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:21,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:21,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states 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:36:21,476 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states 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:36:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:21,477 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:36:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:36:21,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:21,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:21,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:21,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 03:36:21,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2022-04-28 03:36:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:21,479 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 03:36:21,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:21,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 03:36:25,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:36:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:36:25,936 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:25,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:25,952 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:36:26,136 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,SelfDestructingSolverStorable9 [2022-04-28 03:36:26,137 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:26,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:26,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1250397230, now seen corresponding path program 6 times [2022-04-28 03:36:26,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:26,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [167954469] [2022-04-28 03:36:26,322 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:36:26,324 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:26,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1128245071, now seen corresponding path program 1 times [2022-04-28 03:36:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:26,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748106179] [2022-04-28 03:36:26,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:26,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:26,335 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:36:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:26,350 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:36:26,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:26,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {2272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2261#true} is VALID [2022-04-28 03:36:26,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {2261#true} assume true; {2261#true} is VALID [2022-04-28 03:36:26,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2261#true} {2261#true} #61#return; {2261#true} is VALID [2022-04-28 03:36:26,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {2261#true} call ULTIMATE.init(); {2272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:26,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {2272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2261#true} is VALID [2022-04-28 03:36:26,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {2261#true} assume true; {2261#true} is VALID [2022-04-28 03:36:26,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2261#true} {2261#true} #61#return; {2261#true} is VALID [2022-04-28 03:36:26,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {2261#true} call #t~ret11 := main(); {2261#true} is VALID [2022-04-28 03:36:26,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {2261#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2261#true} is VALID [2022-04-28 03:36:26,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {2261#true} [81] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_97 v_main_~x~0_96)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_77 v_main_~y~0_76)) (.cse3 (mod v_main_~x~0_97 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|)) (and (< 0 .cse3) (< v_main_~y~0_77 v_main_~y~0_76) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_97 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_77 v_it_9 1) v_main_~y~0_76)))) (= v_main_~x~0_96 (+ v_main_~x~0_97 v_main_~y~0_77 (* (- 1) v_main_~y~0_76)))))) InVars {main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_97, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_76, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_96, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2261#true} is VALID [2022-04-28 03:36:26,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {2261#true} [80] 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[] {2261#true} is VALID [2022-04-28 03:36:26,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {2261#true} ~z~0 := ~y~0; {2266#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:36:26,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {2266#(= 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; {2267#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:36:26,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {2267#(= (+ (- 1) 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; {2268#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:36:26,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {2268#(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; {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:36:26,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:36:26,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:26,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:26,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2262#false} is VALID [2022-04-28 03:36:26,436 INFO L272 TraceCheckUtils]: 16: Hoare triple {2262#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2262#false} is VALID [2022-04-28 03:36:26,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {2262#false} ~cond := #in~cond; {2262#false} is VALID [2022-04-28 03:36:26,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {2262#false} assume 0 == ~cond; {2262#false} is VALID [2022-04-28 03:36:26,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {2262#false} assume !false; {2262#false} is VALID [2022-04-28 03:36:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:26,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:26,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748106179] [2022-04-28 03:36:26,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748106179] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:26,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631089396] [2022-04-28 03:36:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:26,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:26,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:26,440 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:36:26,466 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:36:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:26,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:36:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:26,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:26,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {2261#true} call ULTIMATE.init(); {2261#true} is VALID [2022-04-28 03:36:26,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {2261#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2261#true} is VALID [2022-04-28 03:36:26,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {2261#true} assume true; {2261#true} is VALID [2022-04-28 03:36:26,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2261#true} {2261#true} #61#return; {2261#true} is VALID [2022-04-28 03:36:26,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {2261#true} call #t~ret11 := main(); {2261#true} is VALID [2022-04-28 03:36:26,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {2261#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2261#true} is VALID [2022-04-28 03:36:26,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {2261#true} [81] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_97 v_main_~x~0_96)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_77 v_main_~y~0_76)) (.cse3 (mod v_main_~x~0_97 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|)) (and (< 0 .cse3) (< v_main_~y~0_77 v_main_~y~0_76) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_97 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_77 v_it_9 1) v_main_~y~0_76)))) (= v_main_~x~0_96 (+ v_main_~x~0_97 v_main_~y~0_77 (* (- 1) v_main_~y~0_76)))))) InVars {main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_97, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_76, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_96, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2261#true} is VALID [2022-04-28 03:36:26,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {2261#true} [80] 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[] {2261#true} is VALID [2022-04-28 03:36:26,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {2261#true} ~z~0 := ~y~0; {2266#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:36:26,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {2266#(= 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; {2267#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:36:26,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {2267#(= (+ (- 1) 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; {2268#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:36:26,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {2268#(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; {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:36:26,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:36:26,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:26,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:26,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2262#false} is VALID [2022-04-28 03:36:26,868 INFO L272 TraceCheckUtils]: 16: Hoare triple {2262#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2262#false} is VALID [2022-04-28 03:36:26,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {2262#false} ~cond := #in~cond; {2262#false} is VALID [2022-04-28 03:36:26,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {2262#false} assume 0 == ~cond; {2262#false} is VALID [2022-04-28 03:36:26,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {2262#false} assume !false; {2262#false} is VALID [2022-04-28 03:36:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:26,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:27,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {2262#false} assume !false; {2262#false} is VALID [2022-04-28 03:36:27,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {2262#false} assume 0 == ~cond; {2262#false} is VALID [2022-04-28 03:36:27,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {2262#false} ~cond := #in~cond; {2262#false} is VALID [2022-04-28 03:36:27,132 INFO L272 TraceCheckUtils]: 16: Hoare triple {2262#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2262#false} is VALID [2022-04-28 03:36:27,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2262#false} is VALID [2022-04-28 03:36:27,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:27,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:27,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:36:27,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {2357#(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; {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:36:27,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {2361#(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; {2357#(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:36:27,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#(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; {2361#(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:36:27,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {2261#true} ~z~0 := ~y~0; {2365#(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:36:27,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {2261#true} [80] 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[] {2261#true} is VALID [2022-04-28 03:36:27,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {2261#true} [81] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_97 v_main_~x~0_96)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_77 v_main_~y~0_76)) (.cse3 (mod v_main_~x~0_97 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|)) (and (< 0 .cse3) (< v_main_~y~0_77 v_main_~y~0_76) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_97 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_77 v_it_9 1) v_main_~y~0_76)))) (= v_main_~x~0_96 (+ v_main_~x~0_97 v_main_~y~0_77 (* (- 1) v_main_~y~0_76)))))) InVars {main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_97, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_76, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_96, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2261#true} is VALID [2022-04-28 03:36:27,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {2261#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2261#true} is VALID [2022-04-28 03:36:27,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {2261#true} call #t~ret11 := main(); {2261#true} is VALID [2022-04-28 03:36:27,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2261#true} {2261#true} #61#return; {2261#true} is VALID [2022-04-28 03:36:27,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {2261#true} assume true; {2261#true} is VALID [2022-04-28 03:36:27,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {2261#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2261#true} is VALID [2022-04-28 03:36:27,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {2261#true} call ULTIMATE.init(); {2261#true} is VALID [2022-04-28 03:36:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:27,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631089396] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:27,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:27,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-28 03:36:27,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:27,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [167954469] [2022-04-28 03:36:27,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [167954469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:27,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:27,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:36:27,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101519796] [2022-04-28 03:36:27,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:27,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:36:27,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:27,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:27,265 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:36:27,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:36:27,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:27,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:36:27,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:36:27,266 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:27,920 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 03:36:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:36:27,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:36:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2022-04-28 03:36:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2022-04-28 03:36:27,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 31 transitions. [2022-04-28 03:36:27,973 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:36:27,974 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:36:27,974 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 03:36:27,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:36:27,975 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:27,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 51 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:36:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 03:36:28,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 03:36:28,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:28,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:28,034 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:28,035 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:28,035 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 03:36:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 03:36:28,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:28,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:28,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 03:36:28,036 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 03:36:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:28,036 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 03:36:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 03:36:28,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:28,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:28,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:28,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-28 03:36:28,037 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2022-04-28 03:36:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:28,038 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-28 03:36:28,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:28,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-28 03:36:31,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 03:36:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:36:31,950 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:31,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:31,966 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:36:32,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:32,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:32,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 7 times [2022-04-28 03:36:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:32,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [73176857] [2022-04-28 03:36:32,336 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:36:32,338 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:32,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1640627010, now seen corresponding path program 1 times [2022-04-28 03:36:32,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:32,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067866039] [2022-04-28 03:36:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:32,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:32,357 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:36:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:32,379 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:36:32,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:32,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {2585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-28 03:36:32,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-28 03:36:32,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2574#true} {2574#true} #61#return; {2574#true} is VALID [2022-04-28 03:36:32,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {2574#true} call ULTIMATE.init(); {2585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:32,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {2585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-28 03:36:32,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-28 03:36:32,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#true} {2574#true} #61#return; {2574#true} is VALID [2022-04-28 03:36:32,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#true} call #t~ret11 := main(); {2574#true} is VALID [2022-04-28 03:36:32,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2574#true} is VALID [2022-04-28 03:36:32,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#true} [83] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse0 (mod v_main_~x~0_111 4294967296)) (.cse2 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse3 (= v_main_~x~0_111 v_main_~x~0_110)) (.cse4 (= v_main_~y~0_90 v_main_~y~0_89))) (or (and (= v_main_~y~0_89 (+ v_main_~x~0_111 v_main_~y~0_90 (* v_main_~x~0_110 (- 1)))) (< 0 .cse0) (< v_main_~x~0_110 v_main_~x~0_111) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_110 v_it_10 1) v_main_~x~0_111)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_111 (* 4294967295 v_it_10)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_111, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2574#true} is VALID [2022-04-28 03:36:32,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {2574#true} [82] 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[] {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:32,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:32,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {2579#(<= 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; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:32,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {2580#(<= 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; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {2581#(<= 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; {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:32,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:32,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:32,484 INFO L272 TraceCheckUtils]: 17: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:36:32,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {2583#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2584#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:36:32,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {2584#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2575#false} is VALID [2022-04-28 03:36:32,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {2575#false} assume !false; {2575#false} is VALID [2022-04-28 03:36:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:32,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:32,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067866039] [2022-04-28 03:36:32,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067866039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:32,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894657114] [2022-04-28 03:36:32,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:32,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:32,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:32,486 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:36:32,487 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:36:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:32,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:36:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:32,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:32,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {2574#true} call ULTIMATE.init(); {2574#true} is VALID [2022-04-28 03:36:32,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {2574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-28 03:36:32,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-28 03:36:32,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#true} {2574#true} #61#return; {2574#true} is VALID [2022-04-28 03:36:32,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#true} call #t~ret11 := main(); {2574#true} is VALID [2022-04-28 03:36:32,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2574#true} is VALID [2022-04-28 03:36:32,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#true} [83] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse0 (mod v_main_~x~0_111 4294967296)) (.cse2 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse3 (= v_main_~x~0_111 v_main_~x~0_110)) (.cse4 (= v_main_~y~0_90 v_main_~y~0_89))) (or (and (= v_main_~y~0_89 (+ v_main_~x~0_111 v_main_~y~0_90 (* v_main_~x~0_110 (- 1)))) (< 0 .cse0) (< v_main_~x~0_110 v_main_~x~0_111) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_110 v_it_10 1) v_main_~x~0_111)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_111 (* 4294967295 v_it_10)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_111, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2574#true} is VALID [2022-04-28 03:36:32,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {2574#true} [82] 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[] {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:32,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:32,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {2579#(<= 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; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:32,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {2580#(<= 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; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {2581#(<= 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; {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:32,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:32,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:32,742 INFO L272 TraceCheckUtils]: 17: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:32,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {2640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:32,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {2644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2575#false} is VALID [2022-04-28 03:36:32,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {2575#false} assume !false; {2575#false} is VALID [2022-04-28 03:36:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:32,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:32,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {2575#false} assume !false; {2575#false} is VALID [2022-04-28 03:36:32,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {2644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2575#false} is VALID [2022-04-28 03:36:32,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {2640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:32,986 INFO L272 TraceCheckUtils]: 17: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:32,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:32,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:32,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:32,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {2581#(<= 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; {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {2580#(<= 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; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:32,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {2579#(<= 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; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:33,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:33,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {2574#true} [82] 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[] {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:33,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#true} [83] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse0 (mod v_main_~x~0_111 4294967296)) (.cse2 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse3 (= v_main_~x~0_111 v_main_~x~0_110)) (.cse4 (= v_main_~y~0_90 v_main_~y~0_89))) (or (and (= v_main_~y~0_89 (+ v_main_~x~0_111 v_main_~y~0_90 (* v_main_~x~0_110 (- 1)))) (< 0 .cse0) (< v_main_~x~0_110 v_main_~x~0_111) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_110 v_it_10 1) v_main_~x~0_111)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_111 (* 4294967295 v_it_10)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_111, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2574#true} is VALID [2022-04-28 03:36:33,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2574#true} is VALID [2022-04-28 03:36:33,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#true} call #t~ret11 := main(); {2574#true} is VALID [2022-04-28 03:36:33,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#true} {2574#true} #61#return; {2574#true} is VALID [2022-04-28 03:36:33,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-28 03:36:33,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {2574#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-28 03:36:33,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {2574#true} call ULTIMATE.init(); {2574#true} is VALID [2022-04-28 03:36:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:33,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894657114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:33,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:33,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-28 03:36:33,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:33,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [73176857] [2022-04-28 03:36:33,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [73176857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:33,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:33,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:36:33,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455679143] [2022-04-28 03:36:33,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:36:33,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:33,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:33,161 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:36:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:36:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:36:33,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:36:33,162 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:33,700 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-28 03:36:33,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:36:33,701 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:36:33,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 03:36:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 03:36:33,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-28 03:36:33,749 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:36:33,750 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:36:33,750 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:36:33,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 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:36:33,751 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:33,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 40 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:36:33,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:36:33,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2022-04-28 03:36:33,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:33,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:33,808 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:33,808 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:33,809 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 03:36:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 03:36:33,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:33,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:33,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:36:33,809 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:36:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:33,810 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 03:36:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 03:36:33,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:33,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:33,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:33,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 03:36:33,811 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2022-04-28 03:36:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:33,811 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 03:36:33,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:33,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 03:36:39,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 27 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 03:36:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:36:39,400 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:39,400 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:39,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 03:36:39,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:39,601 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash 144737870, now seen corresponding path program 8 times [2022-04-28 03:36:39,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:39,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057640424] [2022-04-28 03:36:39,845 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:36:39,847 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1586266705, now seen corresponding path program 1 times [2022-04-28 03:36:39,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:39,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339743364] [2022-04-28 03:36:39,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:39,857 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:36:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:39,874 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:36:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:39,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {2949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2936#true} is VALID [2022-04-28 03:36:39,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {2936#true} assume true; {2936#true} is VALID [2022-04-28 03:36:39,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2936#true} {2936#true} #61#return; {2936#true} is VALID [2022-04-28 03:36:39,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {2936#true} call ULTIMATE.init(); {2949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:39,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {2949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2936#true} is VALID [2022-04-28 03:36:39,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {2936#true} assume true; {2936#true} is VALID [2022-04-28 03:36:39,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2936#true} {2936#true} #61#return; {2936#true} is VALID [2022-04-28 03:36:39,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {2936#true} call #t~ret11 := main(); {2936#true} is VALID [2022-04-28 03:36:39,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {2936#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2936#true} is VALID [2022-04-28 03:36:39,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#true} [85] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_132 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= v_main_~x~0_132 v_main_~x~0_131)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_132 (* 4294967295 v_it_11)) 4294967296)) (not (<= (+ v_main_~y~0_102 v_it_11 1) v_main_~y~0_101)))) (< v_main_~y~0_102 v_main_~y~0_101) (= v_main_~x~0_131 (+ v_main_~x~0_132 (* (- 1) v_main_~y~0_101) v_main_~y~0_102))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_131, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2936#true} is VALID [2022-04-28 03:36:39,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#true} [84] 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[] {2936#true} is VALID [2022-04-28 03:36:39,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {2936#true} ~z~0 := ~y~0; {2941#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:36:39,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {2941#(= 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; {2942#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:36:39,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {2942#(= (+ (- 1) 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; {2943#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:36:39,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {2943#(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; {2944#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:36:39,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {2944#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:39,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:39,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:36:39,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:39,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2937#false} is VALID [2022-04-28 03:36:39,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {2937#false} assume !(~y~0 % 4294967296 > 0); {2937#false} is VALID [2022-04-28 03:36:39,996 INFO L272 TraceCheckUtils]: 18: Hoare triple {2937#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2937#false} is VALID [2022-04-28 03:36:39,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {2937#false} ~cond := #in~cond; {2937#false} is VALID [2022-04-28 03:36:39,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {2937#false} assume 0 == ~cond; {2937#false} is VALID [2022-04-28 03:36:39,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {2937#false} assume !false; {2937#false} is VALID [2022-04-28 03:36:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339743364] [2022-04-28 03:36:39,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339743364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95755070] [2022-04-28 03:36:40,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:40,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:40,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:40,012 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:36:40,038 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:36:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:40,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 03:36:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:40,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:40,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {2936#true} call ULTIMATE.init(); {2936#true} is VALID [2022-04-28 03:36:40,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {2936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2936#true} is VALID [2022-04-28 03:36:40,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {2936#true} assume true; {2936#true} is VALID [2022-04-28 03:36:40,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2936#true} {2936#true} #61#return; {2936#true} is VALID [2022-04-28 03:36:40,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {2936#true} call #t~ret11 := main(); {2936#true} is VALID [2022-04-28 03:36:40,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {2936#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2936#true} is VALID [2022-04-28 03:36:40,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#true} [85] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_132 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= v_main_~x~0_132 v_main_~x~0_131)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_132 (* 4294967295 v_it_11)) 4294967296)) (not (<= (+ v_main_~y~0_102 v_it_11 1) v_main_~y~0_101)))) (< v_main_~y~0_102 v_main_~y~0_101) (= v_main_~x~0_131 (+ v_main_~x~0_132 (* (- 1) v_main_~y~0_101) v_main_~y~0_102))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_131, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2936#true} is VALID [2022-04-28 03:36:40,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#true} [84] 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[] {2936#true} is VALID [2022-04-28 03:36:40,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {2936#true} ~z~0 := ~y~0; {2941#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:36:40,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {2941#(= 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; {2942#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:36:40,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {2942#(= (+ (- 1) 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; {2943#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:36:40,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {2943#(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; {2944#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:36:40,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {2944#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:40,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:40,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:36:40,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:40,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2937#false} is VALID [2022-04-28 03:36:40,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {2937#false} assume !(~y~0 % 4294967296 > 0); {2937#false} is VALID [2022-04-28 03:36:40,365 INFO L272 TraceCheckUtils]: 18: Hoare triple {2937#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2937#false} is VALID [2022-04-28 03:36:40,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {2937#false} ~cond := #in~cond; {2937#false} is VALID [2022-04-28 03:36:40,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {2937#false} assume 0 == ~cond; {2937#false} is VALID [2022-04-28 03:36:40,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {2937#false} assume !false; {2937#false} is VALID [2022-04-28 03:36:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:40,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:40,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {2937#false} assume !false; {2937#false} is VALID [2022-04-28 03:36:40,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {2937#false} assume 0 == ~cond; {2937#false} is VALID [2022-04-28 03:36:40,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {2937#false} ~cond := #in~cond; {2937#false} is VALID [2022-04-28 03:36:40,711 INFO L272 TraceCheckUtils]: 18: Hoare triple {2937#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2937#false} is VALID [2022-04-28 03:36:40,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {2937#false} assume !(~y~0 % 4294967296 > 0); {2937#false} is VALID [2022-04-28 03:36:40,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2937#false} is VALID [2022-04-28 03:36:40,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:40,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:36:40,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:40,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {3043#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:40,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {3047#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3043#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:36:40,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {3051#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3047#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:36:40,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {3055#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3051#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:36:40,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {2936#true} ~z~0 := ~y~0; {3055#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:36:40,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#true} [84] 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[] {2936#true} is VALID [2022-04-28 03:36:40,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#true} [85] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_132 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= v_main_~x~0_132 v_main_~x~0_131)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_132 (* 4294967295 v_it_11)) 4294967296)) (not (<= (+ v_main_~y~0_102 v_it_11 1) v_main_~y~0_101)))) (< v_main_~y~0_102 v_main_~y~0_101) (= v_main_~x~0_131 (+ v_main_~x~0_132 (* (- 1) v_main_~y~0_101) v_main_~y~0_102))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_131, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2936#true} is VALID [2022-04-28 03:36:40,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {2936#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2936#true} is VALID [2022-04-28 03:36:40,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {2936#true} call #t~ret11 := main(); {2936#true} is VALID [2022-04-28 03:36:40,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2936#true} {2936#true} #61#return; {2936#true} is VALID [2022-04-28 03:36:40,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {2936#true} assume true; {2936#true} is VALID [2022-04-28 03:36:40,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {2936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2936#true} is VALID [2022-04-28 03:36:40,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {2936#true} call ULTIMATE.init(); {2936#true} is VALID [2022-04-28 03:36:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:40,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95755070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:40,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:40,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-28 03:36:40,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:40,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1057640424] [2022-04-28 03:36:40,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1057640424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:40,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:40,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:36:40,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732205512] [2022-04-28 03:36:40,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:40,809 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:36:40,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:40,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:40,838 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:36:40,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:36:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:36:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:36:40,839 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:41,707 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 03:36:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:36:41,707 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:36:41,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:41,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2022-04-28 03:36:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2022-04-28 03:36:41,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 45 transitions. [2022-04-28 03:36:41,765 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:36:41,766 INFO L225 Difference]: With dead ends: 45 [2022-04-28 03:36:41,766 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 03:36:41,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:36:41,767 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:41,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:36:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 03:36:41,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 03:36:41,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:41,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:41,840 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:41,840 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:41,840 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 03:36:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 03:36:41,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:41,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:41,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 03:36:41,841 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 03:36:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:41,842 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 03:36:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 03:36:41,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:41,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:41,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:41,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-28 03:36:41,843 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2022-04-28 03:36:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:41,843 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-28 03:36:41,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:41,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-28 03:36:48,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 26 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 03:36:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:36:48,117 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:48,117 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:48,133 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:36:48,327 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,SelfDestructingSolverStorable12 [2022-04-28 03:36:48,327 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash -405165152, now seen corresponding path program 9 times [2022-04-28 03:36:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:48,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [112976499] [2022-04-28 03:36:48,512 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:36:48,514 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2036813088, now seen corresponding path program 1 times [2022-04-28 03:36:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:48,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883686583] [2022-04-28 03:36:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:48,526 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:36:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:48,542 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:36:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:48,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {3330#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3317#true} is VALID [2022-04-28 03:36:48,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-28 03:36:48,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3317#true} {3317#true} #61#return; {3317#true} is VALID [2022-04-28 03:36:48,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3330#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:48,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {3330#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3317#true} is VALID [2022-04-28 03:36:48,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-28 03:36:48,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #61#return; {3317#true} is VALID [2022-04-28 03:36:48,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret11 := main(); {3317#true} is VALID [2022-04-28 03:36:48,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {3317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3317#true} is VALID [2022-04-28 03:36:48,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#true} [87] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse1 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse2 (mod v_main_~x~0_149 4294967296))) (or (and (= v_main_~x~0_149 v_main_~x~0_148) .cse0 .cse1 (= v_main_~y~0_120 v_main_~y~0_119)) (and (<= .cse2 0) (= v_main_~y~0_119 v_main_~y~0_120) (= v_main_~x~0_148 v_main_~x~0_149) .cse0 .cse1) (and (< 0 .cse2) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~y~0_120 v_it_12 1) v_main_~y~0_119)) (< 0 (mod (+ v_main_~x~0_149 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (= v_main_~x~0_148 (+ (* (- 1) v_main_~y~0_119) v_main_~x~0_149 v_main_~y~0_120)) (< v_main_~y~0_120 v_main_~y~0_119)))) InVars {main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_149, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_148, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3317#true} is VALID [2022-04-28 03:36:48,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#true} [86] 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[] {3317#true} is VALID [2022-04-28 03:36:48,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {3317#true} ~z~0 := ~y~0; {3322#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:36:48,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {3322#(= 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; {3323#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:36:48,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {3323#(= (+ (- 1) 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; {3324#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:36:48,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {3324#(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; {3325#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:36:48,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {3325#(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; {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:36:48,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:36:48,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:36:48,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:48,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:48,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3318#false} is VALID [2022-04-28 03:36:48,663 INFO L272 TraceCheckUtils]: 18: Hoare triple {3318#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3318#false} is VALID [2022-04-28 03:36:48,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {3318#false} ~cond := #in~cond; {3318#false} is VALID [2022-04-28 03:36:48,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {3318#false} assume 0 == ~cond; {3318#false} is VALID [2022-04-28 03:36:48,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2022-04-28 03:36:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:48,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:48,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883686583] [2022-04-28 03:36:48,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883686583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:48,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692561301] [2022-04-28 03:36:48,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:48,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:48,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:48,668 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:36:48,678 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:36:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:48,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:36:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:48,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:49,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2022-04-28 03:36:49,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {3317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3317#true} is VALID [2022-04-28 03:36:49,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-28 03:36:49,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #61#return; {3317#true} is VALID [2022-04-28 03:36:49,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret11 := main(); {3317#true} is VALID [2022-04-28 03:36:49,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {3317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3317#true} is VALID [2022-04-28 03:36:49,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#true} [87] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse1 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse2 (mod v_main_~x~0_149 4294967296))) (or (and (= v_main_~x~0_149 v_main_~x~0_148) .cse0 .cse1 (= v_main_~y~0_120 v_main_~y~0_119)) (and (<= .cse2 0) (= v_main_~y~0_119 v_main_~y~0_120) (= v_main_~x~0_148 v_main_~x~0_149) .cse0 .cse1) (and (< 0 .cse2) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~y~0_120 v_it_12 1) v_main_~y~0_119)) (< 0 (mod (+ v_main_~x~0_149 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (= v_main_~x~0_148 (+ (* (- 1) v_main_~y~0_119) v_main_~x~0_149 v_main_~y~0_120)) (< v_main_~y~0_120 v_main_~y~0_119)))) InVars {main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_149, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_148, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3317#true} is VALID [2022-04-28 03:36:49,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#true} [86] 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[] {3317#true} is VALID [2022-04-28 03:36:49,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {3317#true} ~z~0 := ~y~0; {3322#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:36:49,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {3322#(= 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; {3323#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:36:49,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {3323#(= (+ (- 1) 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; {3324#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:36:49,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {3324#(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; {3325#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:36:49,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {3325#(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; {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:36:49,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:36:49,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:36:49,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:49,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:49,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3318#false} is VALID [2022-04-28 03:36:49,093 INFO L272 TraceCheckUtils]: 18: Hoare triple {3318#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3318#false} is VALID [2022-04-28 03:36:49,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {3318#false} ~cond := #in~cond; {3318#false} is VALID [2022-04-28 03:36:49,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {3318#false} assume 0 == ~cond; {3318#false} is VALID [2022-04-28 03:36:49,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2022-04-28 03:36:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:49,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:49,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2022-04-28 03:36:49,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {3318#false} assume 0 == ~cond; {3318#false} is VALID [2022-04-28 03:36:49,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {3318#false} ~cond := #in~cond; {3318#false} is VALID [2022-04-28 03:36:49,451 INFO L272 TraceCheckUtils]: 18: Hoare triple {3318#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3318#false} is VALID [2022-04-28 03:36:49,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3318#false} is VALID [2022-04-28 03:36:49,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:49,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:36:49,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:36:49,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:36:49,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {3424#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:36:49,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {3428#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3424#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:36:49,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {3432#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3428#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:36:49,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {3436#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3432#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:36:49,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {3317#true} ~z~0 := ~y~0; {3436#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:36:49,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#true} [86] 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[] {3317#true} is VALID [2022-04-28 03:36:49,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#true} [87] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse1 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse2 (mod v_main_~x~0_149 4294967296))) (or (and (= v_main_~x~0_149 v_main_~x~0_148) .cse0 .cse1 (= v_main_~y~0_120 v_main_~y~0_119)) (and (<= .cse2 0) (= v_main_~y~0_119 v_main_~y~0_120) (= v_main_~x~0_148 v_main_~x~0_149) .cse0 .cse1) (and (< 0 .cse2) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~y~0_120 v_it_12 1) v_main_~y~0_119)) (< 0 (mod (+ v_main_~x~0_149 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (= v_main_~x~0_148 (+ (* (- 1) v_main_~y~0_119) v_main_~x~0_149 v_main_~y~0_120)) (< v_main_~y~0_120 v_main_~y~0_119)))) InVars {main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_149, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_148, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3317#true} is VALID [2022-04-28 03:36:49,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {3317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3317#true} is VALID [2022-04-28 03:36:49,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret11 := main(); {3317#true} is VALID [2022-04-28 03:36:49,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #61#return; {3317#true} is VALID [2022-04-28 03:36:49,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-28 03:36:49,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {3317#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3317#true} is VALID [2022-04-28 03:36:49,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2022-04-28 03:36:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:49,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692561301] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:49,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:49,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-28 03:36:49,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:49,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [112976499] [2022-04-28 03:36:49,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [112976499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:49,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:49,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:36:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485163014] [2022-04-28 03:36:49,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:49,695 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:36:49,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:49,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:49,722 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:36:49,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:36:49,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:49,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:36:49,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:36:49,723 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:50,878 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-28 03:36:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:36:50,878 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:36:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. [2022-04-28 03:36:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. [2022-04-28 03:36:50,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 34 transitions. [2022-04-28 03:36:50,946 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:36:50,946 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:36:50,946 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:36:50,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:36:50,948 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:50,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 61 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:36:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:36:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:36:51,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:51,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:51,027 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:51,027 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:51,027 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 03:36:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:36:51,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:51,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:51,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states 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:36:51,028 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states 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:36:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:51,029 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 03:36:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:36:51,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:51,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:51,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:51,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 03:36:51,030 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-04-28 03:36:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:51,031 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 03:36:51,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:51,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 03:36:57,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 26 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 03:36:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:36:57,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:57,433 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:57,449 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:36:57,633 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,SelfDestructingSolverStorable13 [2022-04-28 03:36:57,634 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:57,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:57,634 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 10 times [2022-04-28 03:36:57,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:57,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1271666584] [2022-04-28 03:36:57,872 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:36:57,874 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:57,876 INFO L85 PathProgramCache]: Analyzing trace with hash 436742413, now seen corresponding path program 1 times [2022-04-28 03:36:57,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:57,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814078116] [2022-04-28 03:36:57,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:57,884 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:36:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:57,900 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:36:57,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:57,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {3682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3670#true} is VALID [2022-04-28 03:36:57,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {3670#true} assume true; {3670#true} is VALID [2022-04-28 03:36:57,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3670#true} {3670#true} #61#return; {3670#true} is VALID [2022-04-28 03:36:57,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {3670#true} call ULTIMATE.init(); {3682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:57,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {3682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3670#true} is VALID [2022-04-28 03:36:57,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {3670#true} assume true; {3670#true} is VALID [2022-04-28 03:36:57,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3670#true} {3670#true} #61#return; {3670#true} is VALID [2022-04-28 03:36:57,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {3670#true} call #t~ret11 := main(); {3670#true} is VALID [2022-04-28 03:36:57,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {3670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3670#true} is VALID [2022-04-28 03:36:57,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {3670#true} [89] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_166 4294967296)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= v_main_~x~0_166 v_main_~x~0_165)) (.cse4 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_136 v_it_13 1) v_main_~y~0_135)) (< 0 (mod (+ v_main_~x~0_166 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~y~0_136 v_main_~y~0_135) (< 0 .cse0) (= v_main_~x~0_165 (+ v_main_~x~0_166 v_main_~y~0_136 (* (- 1) v_main_~y~0_135)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_166, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3670#true} is VALID [2022-04-28 03:36:57,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {3670#true} [88] 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[] {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:57,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:57,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {3675#(<= 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; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:57,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {3676#(<= 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; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:57,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {3677#(<= 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; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:57,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(<= 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; {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:57,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:57,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:57,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:57,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:58,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:58,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:58,001 INFO L272 TraceCheckUtils]: 19: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:36:58,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {3680#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3681#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:36:58,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {3681#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3671#false} is VALID [2022-04-28 03:36:58,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {3671#false} assume !false; {3671#false} is VALID [2022-04-28 03:36:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:58,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:58,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814078116] [2022-04-28 03:36:58,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814078116] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:58,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231723315] [2022-04-28 03:36:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:58,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:58,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:58,004 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:36:58,009 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:36:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:58,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:36:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:58,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:58,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {3670#true} call ULTIMATE.init(); {3670#true} is VALID [2022-04-28 03:36:58,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {3670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3670#true} is VALID [2022-04-28 03:36:58,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {3670#true} assume true; {3670#true} is VALID [2022-04-28 03:36:58,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3670#true} {3670#true} #61#return; {3670#true} is VALID [2022-04-28 03:36:58,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {3670#true} call #t~ret11 := main(); {3670#true} is VALID [2022-04-28 03:36:58,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {3670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3670#true} is VALID [2022-04-28 03:36:58,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {3670#true} [89] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_166 4294967296)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= v_main_~x~0_166 v_main_~x~0_165)) (.cse4 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_136 v_it_13 1) v_main_~y~0_135)) (< 0 (mod (+ v_main_~x~0_166 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~y~0_136 v_main_~y~0_135) (< 0 .cse0) (= v_main_~x~0_165 (+ v_main_~x~0_166 v_main_~y~0_136 (* (- 1) v_main_~y~0_135)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_166, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3670#true} is VALID [2022-04-28 03:36:58,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {3670#true} [88] 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[] {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:58,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:58,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {3675#(<= 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; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:58,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {3676#(<= 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; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {3677#(<= 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; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(<= 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; {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:58,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:58,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:58,289 INFO L272 TraceCheckUtils]: 19: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3743#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:58,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {3743#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3747#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:58,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {3747#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3671#false} is VALID [2022-04-28 03:36:58,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {3671#false} assume !false; {3671#false} is VALID [2022-04-28 03:36:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:58,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:58,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {3671#false} assume !false; {3671#false} is VALID [2022-04-28 03:36:58,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {3747#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3671#false} is VALID [2022-04-28 03:36:58,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {3743#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3747#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:58,554 INFO L272 TraceCheckUtils]: 19: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3743#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:58,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:58,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:58,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:58,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(<= 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; {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {3677#(<= 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; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {3676#(<= 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; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:58,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {3675#(<= 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; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:58,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:58,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {3670#true} [88] 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[] {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:58,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {3670#true} [89] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_166 4294967296)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= v_main_~x~0_166 v_main_~x~0_165)) (.cse4 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_136 v_it_13 1) v_main_~y~0_135)) (< 0 (mod (+ v_main_~x~0_166 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~y~0_136 v_main_~y~0_135) (< 0 .cse0) (= v_main_~x~0_165 (+ v_main_~x~0_166 v_main_~y~0_136 (* (- 1) v_main_~y~0_135)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_166, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3670#true} is VALID [2022-04-28 03:36:58,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {3670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3670#true} is VALID [2022-04-28 03:36:58,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {3670#true} call #t~ret11 := main(); {3670#true} is VALID [2022-04-28 03:36:58,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3670#true} {3670#true} #61#return; {3670#true} is VALID [2022-04-28 03:36:58,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {3670#true} assume true; {3670#true} is VALID [2022-04-28 03:36:58,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {3670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3670#true} is VALID [2022-04-28 03:36:58,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {3670#true} call ULTIMATE.init(); {3670#true} is VALID [2022-04-28 03:36:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:58,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231723315] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:58,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:58,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-28 03:36:58,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:58,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1271666584] [2022-04-28 03:36:58,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1271666584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:58,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:58,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:36:58,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928075692] [2022-04-28 03:36:58,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 03:36:58,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:58,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:58,761 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:36:58,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:36:58,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:36:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:36:58,762 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:59,658 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-28 03:36:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:36:59,659 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 03:36:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-28 03:36:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-28 03:36:59,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 49 transitions. [2022-04-28 03:36:59,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:59,718 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:36:59,718 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:36:59,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:36:59,719 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:59,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 40 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:36:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:36:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-04-28 03:36:59,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:59,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:59,806 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:59,806 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:59,807 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 03:36:59,807 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-28 03:36:59,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:59,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:59,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 03:36:59,808 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 03:36:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:59,809 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 03:36:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-28 03:36:59,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:59,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:59,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:59,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:59,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-28 03:36:59,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2022-04-28 03:36:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:59,810 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-28 03:36:59,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:59,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-28 03:37:05,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 30 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-28 03:37:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:37:05,412 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:05,412 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:05,428 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:37:05,615 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,SelfDestructingSolverStorable14 [2022-04-28 03:37:05,615 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:05,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1712811712, now seen corresponding path program 11 times [2022-04-28 03:37:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:05,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1009359554] [2022-04-28 03:37:05,859 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:37:05,860 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:05,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1401082688, now seen corresponding path program 1 times [2022-04-28 03:37:05,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:05,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58210426] [2022-04-28 03:37:05,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:05,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:05,870 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:37:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:05,914 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:37:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:06,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {4095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4080#true} is VALID [2022-04-28 03:37:06,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-28 03:37:06,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4080#true} {4080#true} #61#return; {4080#true} is VALID [2022-04-28 03:37:06,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:06,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {4095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4080#true} is VALID [2022-04-28 03:37:06,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-28 03:37:06,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #61#return; {4080#true} is VALID [2022-04-28 03:37:06,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret11 := main(); {4080#true} is VALID [2022-04-28 03:37:06,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4080#true} is VALID [2022-04-28 03:37:06,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_192 4294967296)) (.cse1 (= v_main_~x~0_192 v_main_~x~0_191)) (.cse2 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< 0 .cse0) (= v_main_~y~0_149 (+ v_main_~x~0_192 v_main_~y~0_150 (* v_main_~x~0_191 (- 1)))) (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_191 v_it_14 1) v_main_~x~0_192)) (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_192 (* 4294967295 v_it_14)) 4294967296)))) (< v_main_~x~0_191 v_main_~x~0_192)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_149 v_main_~y~0_150) (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_150 v_main_~y~0_149) .cse3))) InVars {main_~y~0=v_main_~y~0_150, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_192, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4080#true} is VALID [2022-04-28 03:37:06,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#true} [90] 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[] {4080#true} is VALID [2022-04-28 03:37:06,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {4080#true} ~z~0 := ~y~0; {4085#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:37:06,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {4085#(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; {4086#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:06,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {4086#(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; {4087#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:37:06,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {4087#(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; {4088#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:37:06,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {4088#(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; {4089#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:37:06,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {4089#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:06,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:06,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:06,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:37:06,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:37:06,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4081#false} is VALID [2022-04-28 03:37:06,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {4081#false} assume !(~y~0 % 4294967296 > 0); {4081#false} is VALID [2022-04-28 03:37:06,119 INFO L272 TraceCheckUtils]: 20: Hoare triple {4081#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4081#false} is VALID [2022-04-28 03:37:06,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {4081#false} ~cond := #in~cond; {4081#false} is VALID [2022-04-28 03:37:06,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {4081#false} assume 0 == ~cond; {4081#false} is VALID [2022-04-28 03:37:06,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-28 03:37:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:06,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:06,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58210426] [2022-04-28 03:37:06,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58210426] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:06,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285251353] [2022-04-28 03:37:06,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:06,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:06,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:06,124 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:37:06,159 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:37:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:06,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:37:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:06,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:37:06,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4080#true} is VALID [2022-04-28 03:37:06,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4080#true} is VALID [2022-04-28 03:37:06,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-28 03:37:06,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #61#return; {4080#true} is VALID [2022-04-28 03:37:06,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret11 := main(); {4080#true} is VALID [2022-04-28 03:37:06,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4080#true} is VALID [2022-04-28 03:37:06,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_192 4294967296)) (.cse1 (= v_main_~x~0_192 v_main_~x~0_191)) (.cse2 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< 0 .cse0) (= v_main_~y~0_149 (+ v_main_~x~0_192 v_main_~y~0_150 (* v_main_~x~0_191 (- 1)))) (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_191 v_it_14 1) v_main_~x~0_192)) (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_192 (* 4294967295 v_it_14)) 4294967296)))) (< v_main_~x~0_191 v_main_~x~0_192)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_149 v_main_~y~0_150) (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_150 v_main_~y~0_149) .cse3))) InVars {main_~y~0=v_main_~y~0_150, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_192, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4080#true} is VALID [2022-04-28 03:37:06,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#true} [90] 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[] {4080#true} is VALID [2022-04-28 03:37:06,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {4080#true} ~z~0 := ~y~0; {4085#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:37:06,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {4085#(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; {4086#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:06,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {4086#(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; {4087#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:37:06,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {4087#(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; {4088#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:37:06,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {4088#(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; {4089#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:37:06,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {4089#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:06,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:06,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:06,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:37:06,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:37:06,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4081#false} is VALID [2022-04-28 03:37:06,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {4081#false} assume !(~y~0 % 4294967296 > 0); {4081#false} is VALID [2022-04-28 03:37:06,588 INFO L272 TraceCheckUtils]: 20: Hoare triple {4081#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4081#false} is VALID [2022-04-28 03:37:06,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {4081#false} ~cond := #in~cond; {4081#false} is VALID [2022-04-28 03:37:06,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {4081#false} assume 0 == ~cond; {4081#false} is VALID [2022-04-28 03:37:06,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-28 03:37:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:06,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:06,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-28 03:37:06,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {4081#false} assume 0 == ~cond; {4081#false} is VALID [2022-04-28 03:37:06,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {4081#false} ~cond := #in~cond; {4081#false} is VALID [2022-04-28 03:37:06,965 INFO L272 TraceCheckUtils]: 20: Hoare triple {4081#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4081#false} is VALID [2022-04-28 03:37:06,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {4081#false} assume !(~y~0 % 4294967296 > 0); {4081#false} is VALID [2022-04-28 03:37:06,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4081#false} is VALID [2022-04-28 03:37:06,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:37:06,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:37:06,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:06,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:06,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {4198#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:06,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {4202#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4198#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:06,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {4206#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4202#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:37:06,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {4210#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4206#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:06,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {4214#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4210#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:37:06,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {4080#true} ~z~0 := ~y~0; {4214#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:06,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#true} [90] 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[] {4080#true} is VALID [2022-04-28 03:37:06,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_192 4294967296)) (.cse1 (= v_main_~x~0_192 v_main_~x~0_191)) (.cse2 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< 0 .cse0) (= v_main_~y~0_149 (+ v_main_~x~0_192 v_main_~y~0_150 (* v_main_~x~0_191 (- 1)))) (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_191 v_it_14 1) v_main_~x~0_192)) (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_192 (* 4294967295 v_it_14)) 4294967296)))) (< v_main_~x~0_191 v_main_~x~0_192)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_149 v_main_~y~0_150) (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_150 v_main_~y~0_149) .cse3))) InVars {main_~y~0=v_main_~y~0_150, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_192, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4080#true} is VALID [2022-04-28 03:37:06,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4080#true} is VALID [2022-04-28 03:37:06,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret11 := main(); {4080#true} is VALID [2022-04-28 03:37:06,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #61#return; {4080#true} is VALID [2022-04-28 03:37:06,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-28 03:37:06,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4080#true} is VALID [2022-04-28 03:37:06,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4080#true} is VALID [2022-04-28 03:37:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:06,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285251353] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:06,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:06,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-28 03:37:07,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:07,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1009359554] [2022-04-28 03:37:07,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1009359554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:07,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:07,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:37:07,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596760572] [2022-04-28 03:37:07,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:07,157 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:37:07,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:07,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:07,181 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:37:07,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:37:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:37:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:37:07,182 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:08,649 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-04-28 03:37:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:37:08,649 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:37:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2022-04-28 03:37:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2022-04-28 03:37:08,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 49 transitions. [2022-04-28 03:37:08,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:08,752 INFO L225 Difference]: With dead ends: 51 [2022-04-28 03:37:08,752 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:37:08,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1482, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:37:08,753 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:08,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 68 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:37:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:37:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:37:08,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:08,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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:37:08,838 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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:37:08,838 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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:37:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:08,839 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 03:37:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:37:08,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:08,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:08,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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 29 states. [2022-04-28 03:37:08,840 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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 29 states. [2022-04-28 03:37:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:08,841 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 03:37:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:37:08,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:08,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:08,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:08,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 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:37:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 03:37:08,842 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2022-04-28 03:37:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:08,842 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 03:37:08,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:08,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 03:37:15,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 28 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:37:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:37:15,847 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:15,847 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:15,863 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:37:16,051 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,SelfDestructingSolverStorable15 [2022-04-28 03:37:16,051 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:16,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1642818962, now seen corresponding path program 12 times [2022-04-28 03:37:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:16,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [821569811] [2022-04-28 03:37:16,307 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:37:16,308 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1074330223, now seen corresponding path program 1 times [2022-04-28 03:37:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:16,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8588573] [2022-04-28 03:37:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:16,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:16,328 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:37:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:16,347 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:37:16,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:16,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {4524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4509#true} is VALID [2022-04-28 03:37:16,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {4509#true} assume true; {4509#true} is VALID [2022-04-28 03:37:16,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4509#true} {4509#true} #61#return; {4509#true} is VALID [2022-04-28 03:37:16,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {4509#true} call ULTIMATE.init(); {4524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:16,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {4524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4509#true} is VALID [2022-04-28 03:37:16,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {4509#true} assume true; {4509#true} is VALID [2022-04-28 03:37:16,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4509#true} {4509#true} #61#return; {4509#true} is VALID [2022-04-28 03:37:16,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {4509#true} call #t~ret11 := main(); {4509#true} is VALID [2022-04-28 03:37:16,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {4509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4509#true} is VALID [2022-04-28 03:37:16,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {4509#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_171 v_main_~y~0_170)) (.cse0 (mod v_main_~x~0_212 4294967296)) (.cse2 (= v_main_~x~0_212 v_main_~x~0_211)) (.cse3 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_212 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_171 v_it_15 1) v_main_~y~0_170)) (not (<= 1 v_it_15)))) (= v_main_~x~0_211 (+ v_main_~x~0_212 v_main_~y~0_171 (* (- 1) v_main_~y~0_170))) (< 0 .cse0) (< v_main_~y~0_171 v_main_~y~0_170)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_171, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_170, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_211, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4509#true} is VALID [2022-04-28 03:37:16,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {4509#true} [92] 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[] {4509#true} is VALID [2022-04-28 03:37:16,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {4509#true} ~z~0 := ~y~0; {4514#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:37:16,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#(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; {4515#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:16,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {4515#(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; {4516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:37:16,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {4516#(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; {4517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:37:16,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {4517#(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; {4518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:37:16,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {4518#(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; {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:37:16,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:37:16,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:37:16,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:37:16,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:16,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:16,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4510#false} is VALID [2022-04-28 03:37:16,524 INFO L272 TraceCheckUtils]: 20: Hoare triple {4510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4510#false} is VALID [2022-04-28 03:37:16,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {4510#false} ~cond := #in~cond; {4510#false} is VALID [2022-04-28 03:37:16,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {4510#false} assume 0 == ~cond; {4510#false} is VALID [2022-04-28 03:37:16,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {4510#false} assume !false; {4510#false} is VALID [2022-04-28 03:37:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:16,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:16,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8588573] [2022-04-28 03:37:16,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8588573] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:16,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467010557] [2022-04-28 03:37:16,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:16,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:16,526 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:37:16,527 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:37:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:16,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:37:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:16,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:37:16,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {4509#true} call ULTIMATE.init(); {4509#true} is VALID [2022-04-28 03:37:16,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {4509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4509#true} is VALID [2022-04-28 03:37:16,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {4509#true} assume true; {4509#true} is VALID [2022-04-28 03:37:16,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4509#true} {4509#true} #61#return; {4509#true} is VALID [2022-04-28 03:37:16,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {4509#true} call #t~ret11 := main(); {4509#true} is VALID [2022-04-28 03:37:16,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {4509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4509#true} is VALID [2022-04-28 03:37:16,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {4509#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_171 v_main_~y~0_170)) (.cse0 (mod v_main_~x~0_212 4294967296)) (.cse2 (= v_main_~x~0_212 v_main_~x~0_211)) (.cse3 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_212 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_171 v_it_15 1) v_main_~y~0_170)) (not (<= 1 v_it_15)))) (= v_main_~x~0_211 (+ v_main_~x~0_212 v_main_~y~0_171 (* (- 1) v_main_~y~0_170))) (< 0 .cse0) (< v_main_~y~0_171 v_main_~y~0_170)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_171, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_170, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_211, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4509#true} is VALID [2022-04-28 03:37:16,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {4509#true} [92] 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[] {4509#true} is VALID [2022-04-28 03:37:16,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {4509#true} ~z~0 := ~y~0; {4514#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:37:16,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#(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; {4515#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:16,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {4515#(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; {4516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:37:16,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {4516#(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; {4517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:37:16,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {4517#(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; {4518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:37:16,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {4518#(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; {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:37:16,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:37:16,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:37:16,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:37:16,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:16,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:16,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4510#false} is VALID [2022-04-28 03:37:16,987 INFO L272 TraceCheckUtils]: 20: Hoare triple {4510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4510#false} is VALID [2022-04-28 03:37:16,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {4510#false} ~cond := #in~cond; {4510#false} is VALID [2022-04-28 03:37:16,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {4510#false} assume 0 == ~cond; {4510#false} is VALID [2022-04-28 03:37:16,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {4510#false} assume !false; {4510#false} is VALID [2022-04-28 03:37:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:16,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:17,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {4510#false} assume !false; {4510#false} is VALID [2022-04-28 03:37:17,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {4510#false} assume 0 == ~cond; {4510#false} is VALID [2022-04-28 03:37:17,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {4510#false} ~cond := #in~cond; {4510#false} is VALID [2022-04-28 03:37:17,347 INFO L272 TraceCheckUtils]: 20: Hoare triple {4510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4510#false} is VALID [2022-04-28 03:37:17,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4510#false} is VALID [2022-04-28 03:37:17,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:17,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:17,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:37:17,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:37:17,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:37:17,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {4627#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:37:17,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {4631#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4627#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:37:17,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {4635#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4631#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-28 03:37:17,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {4639#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4635#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:37:17,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {4643#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4639#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:37:17,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {4509#true} ~z~0 := ~y~0; {4643#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:37:17,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {4509#true} [92] 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[] {4509#true} is VALID [2022-04-28 03:37:17,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {4509#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_171 v_main_~y~0_170)) (.cse0 (mod v_main_~x~0_212 4294967296)) (.cse2 (= v_main_~x~0_212 v_main_~x~0_211)) (.cse3 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_212 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_171 v_it_15 1) v_main_~y~0_170)) (not (<= 1 v_it_15)))) (= v_main_~x~0_211 (+ v_main_~x~0_212 v_main_~y~0_171 (* (- 1) v_main_~y~0_170))) (< 0 .cse0) (< v_main_~y~0_171 v_main_~y~0_170)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_171, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_170, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_211, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4509#true} is VALID [2022-04-28 03:37:17,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {4509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4509#true} is VALID [2022-04-28 03:37:17,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {4509#true} call #t~ret11 := main(); {4509#true} is VALID [2022-04-28 03:37:17,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4509#true} {4509#true} #61#return; {4509#true} is VALID [2022-04-28 03:37:17,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {4509#true} assume true; {4509#true} is VALID [2022-04-28 03:37:17,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {4509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4509#true} is VALID [2022-04-28 03:37:17,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {4509#true} call ULTIMATE.init(); {4509#true} is VALID [2022-04-28 03:37:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:17,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467010557] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:17,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:17,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-28 03:37:17,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:17,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [821569811] [2022-04-28 03:37:17,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [821569811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:17,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:17,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:37:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338004152] [2022-04-28 03:37:17,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:17,613 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:37:17,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:17,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:17,639 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:37:17,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:37:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:17,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:37:17,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:37:17,640 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:19,847 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 03:37:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:37:19,847 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:37:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 37 transitions. [2022-04-28 03:37:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 37 transitions. [2022-04-28 03:37:19,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 37 transitions. [2022-04-28 03:37:20,021 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:37:20,022 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:37:20,022 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:37:20,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:37:20,023 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:20,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 71 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:37:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:37:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 03:37:20,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:20,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:20,113 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:20,113 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:20,114 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 03:37:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 03:37:20,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:20,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:20,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:37:20,114 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:37:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:20,115 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 03:37:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 03:37:20,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:20,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:20,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:20,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 03:37:20,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-04-28 03:37:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:20,116 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 03:37:20,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:20,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 03:37:28,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 29 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 03:37:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:37:28,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:28,047 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:28,063 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:37:28,247 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,SelfDestructingSolverStorable16 [2022-04-28 03:37:28,248 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:28,248 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 13 times [2022-04-28 03:37:28,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:28,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [422275083] [2022-04-28 03:37:28,419 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:37:28,421 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -409127522, now seen corresponding path program 1 times [2022-04-28 03:37:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:28,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920591739] [2022-04-28 03:37:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:28,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:28,435 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:37:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:28,452 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:37:28,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:28,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {4915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4902#true} is VALID [2022-04-28 03:37:28,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {4902#true} assume true; {4902#true} is VALID [2022-04-28 03:37:28,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4902#true} {4902#true} #61#return; {4902#true} is VALID [2022-04-28 03:37:28,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {4902#true} call ULTIMATE.init(); {4915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:28,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {4915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4902#true} is VALID [2022-04-28 03:37:28,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {4902#true} assume true; {4902#true} is VALID [2022-04-28 03:37:28,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4902#true} {4902#true} #61#return; {4902#true} is VALID [2022-04-28 03:37:28,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {4902#true} call #t~ret11 := main(); {4902#true} is VALID [2022-04-28 03:37:28,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {4902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4902#true} is VALID [2022-04-28 03:37:28,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {4902#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse1 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse2 (= v_main_~x~0_232 v_main_~x~0_231)) (.cse3 (mod v_main_~x~0_232 4294967296))) (or (and (= v_main_~y~0_190 v_main_~y~0_189) .cse0 .cse1 .cse2) (and .cse0 (= v_main_~y~0_189 v_main_~y~0_190) (<= .cse3 0) .cse1 .cse2) (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_232 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_231 v_it_16 1) v_main_~x~0_232)))) (< v_main_~x~0_231 v_main_~x~0_232) (< 0 .cse3) (= v_main_~y~0_189 (+ v_main_~x~0_232 v_main_~y~0_190 (* v_main_~x~0_231 (- 1))))))) InVars {main_~y~0=v_main_~y~0_190, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_189, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_231, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4902#true} is VALID [2022-04-28 03:37:28,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {4902#true} [94] 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[] {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:28,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:28,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {4907#(<= 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; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:28,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {4908#(<= 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; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {4909#(<= 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; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {4910#(<= 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; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {4911#(<= 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; {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:37:28,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:37:28,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:28,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:28,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:28,588 INFO L272 TraceCheckUtils]: 21: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4913#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:37:28,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {4913#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4914#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:37:28,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {4914#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4903#false} is VALID [2022-04-28 03:37:28,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {4903#false} assume !false; {4903#false} is VALID [2022-04-28 03:37:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:28,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:28,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920591739] [2022-04-28 03:37:28,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920591739] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:28,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393203542] [2022-04-28 03:37:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:28,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:28,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:28,592 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:37:28,616 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:37:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:28,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:37:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:28,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:37:28,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {4902#true} call ULTIMATE.init(); {4902#true} is VALID [2022-04-28 03:37:28,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {4902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4902#true} is VALID [2022-04-28 03:37:28,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {4902#true} assume true; {4902#true} is VALID [2022-04-28 03:37:28,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4902#true} {4902#true} #61#return; {4902#true} is VALID [2022-04-28 03:37:28,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {4902#true} call #t~ret11 := main(); {4902#true} is VALID [2022-04-28 03:37:28,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {4902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4902#true} is VALID [2022-04-28 03:37:28,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {4902#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse1 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse2 (= v_main_~x~0_232 v_main_~x~0_231)) (.cse3 (mod v_main_~x~0_232 4294967296))) (or (and (= v_main_~y~0_190 v_main_~y~0_189) .cse0 .cse1 .cse2) (and .cse0 (= v_main_~y~0_189 v_main_~y~0_190) (<= .cse3 0) .cse1 .cse2) (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_232 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_231 v_it_16 1) v_main_~x~0_232)))) (< v_main_~x~0_231 v_main_~x~0_232) (< 0 .cse3) (= v_main_~y~0_189 (+ v_main_~x~0_232 v_main_~y~0_190 (* v_main_~x~0_231 (- 1))))))) InVars {main_~y~0=v_main_~y~0_190, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_189, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_231, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4902#true} is VALID [2022-04-28 03:37:28,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {4902#true} [94] 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[] {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:28,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:28,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {4907#(<= 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; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:28,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {4908#(<= 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; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {4909#(<= 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; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {4910#(<= 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; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {4911#(<= 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; {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:37:28,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:37:28,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:28,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:28,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:28,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:28,945 INFO L272 TraceCheckUtils]: 21: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:37:28,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {4982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:37:28,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {4986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4903#false} is VALID [2022-04-28 03:37:28,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {4903#false} assume !false; {4903#false} is VALID [2022-04-28 03:37:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:28,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:29,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {4903#false} assume !false; {4903#false} is VALID [2022-04-28 03:37:29,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {4986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4903#false} is VALID [2022-04-28 03:37:29,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {4982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:37:29,202 INFO L272 TraceCheckUtils]: 21: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:37:29,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:29,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:29,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:29,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:29,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:29,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:29,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:37:29,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {4911#(<= 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; {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:37:29,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {4910#(<= 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; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:29,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {4909#(<= 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; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:29,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {4908#(<= 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; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:29,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {4907#(<= 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; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:29,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:29,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {4902#true} [94] 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[] {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:29,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {4902#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse1 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse2 (= v_main_~x~0_232 v_main_~x~0_231)) (.cse3 (mod v_main_~x~0_232 4294967296))) (or (and (= v_main_~y~0_190 v_main_~y~0_189) .cse0 .cse1 .cse2) (and .cse0 (= v_main_~y~0_189 v_main_~y~0_190) (<= .cse3 0) .cse1 .cse2) (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_232 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_231 v_it_16 1) v_main_~x~0_232)))) (< v_main_~x~0_231 v_main_~x~0_232) (< 0 .cse3) (= v_main_~y~0_189 (+ v_main_~x~0_232 v_main_~y~0_190 (* v_main_~x~0_231 (- 1))))))) InVars {main_~y~0=v_main_~y~0_190, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_189, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_231, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4902#true} is VALID [2022-04-28 03:37:29,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {4902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4902#true} is VALID [2022-04-28 03:37:29,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {4902#true} call #t~ret11 := main(); {4902#true} is VALID [2022-04-28 03:37:29,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4902#true} {4902#true} #61#return; {4902#true} is VALID [2022-04-28 03:37:29,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {4902#true} assume true; {4902#true} is VALID [2022-04-28 03:37:29,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {4902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4902#true} is VALID [2022-04-28 03:37:29,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {4902#true} call ULTIMATE.init(); {4902#true} is VALID [2022-04-28 03:37:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:29,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393203542] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:29,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:29,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2022-04-28 03:37:29,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:29,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [422275083] [2022-04-28 03:37:29,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [422275083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:29,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:29,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:37:29,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655698810] [2022-04-28 03:37:29,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:29,487 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:37:29,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:29,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 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:37:29,554 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:37:29,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:37:29,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:29,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:37:29,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:37:29,555 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 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:37:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:30,834 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-28 03:37:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:37:30,834 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:37:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 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:37:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-28 03:37:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 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:37:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-28 03:37:30,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 55 transitions. [2022-04-28 03:37:30,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:30,912 INFO L225 Difference]: With dead ends: 52 [2022-04-28 03:37:30,912 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 03:37:30,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:37:30,912 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:30,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 30 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:37:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 03:37:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-04-28 03:37:31,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:31,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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:37:31,012 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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:37:31,012 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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:37:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:31,013 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-28 03:37:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-28 03:37:31,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:31,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:31,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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 47 states. [2022-04-28 03:37:31,013 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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 47 states. [2022-04-28 03:37:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:31,014 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-28 03:37:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-28 03:37:31,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:31,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:31,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:31,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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:37:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 03:37:31,015 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2022-04-28 03:37:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:31,015 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 03:37:31,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 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:37:31,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 03:37:40,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 31 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 03:37:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:37:40,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:40,446 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:40,462 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:37:40,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 03:37:40,647 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:40,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1392182130, now seen corresponding path program 14 times [2022-04-28 03:37:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:40,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1019598860] [2022-04-28 03:37:43,131 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:37:43,214 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:37:43,216 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:43,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2024818895, now seen corresponding path program 1 times [2022-04-28 03:37:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:43,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387172864] [2022-04-28 03:37:43,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:43,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:43,226 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:37:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:43,246 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:37:43,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:43,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {5377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5360#true} is VALID [2022-04-28 03:37:43,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {5360#true} assume true; {5360#true} is VALID [2022-04-28 03:37:43,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5360#true} {5360#true} #61#return; {5360#true} is VALID [2022-04-28 03:37:43,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {5360#true} call ULTIMATE.init(); {5377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:43,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {5377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5360#true} is VALID [2022-04-28 03:37:43,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {5360#true} assume true; {5360#true} is VALID [2022-04-28 03:37:43,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5360#true} {5360#true} #61#return; {5360#true} is VALID [2022-04-28 03:37:43,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {5360#true} call #t~ret11 := main(); {5360#true} is VALID [2022-04-28 03:37:43,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {5360#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5360#true} is VALID [2022-04-28 03:37:43,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {5360#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_263 4294967296)) (.cse0 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_206 v_main_~y~0_205)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (= v_main_~x~0_263 v_main_~x~0_262))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (forall ((v_it_17 Int)) (or (not (<= (+ v_main_~y~0_206 v_it_17 1) v_main_~y~0_205)) (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_263 (* 4294967295 v_it_17)) 4294967296)))) (= v_main_~x~0_262 (+ v_main_~x~0_263 (* (- 1) v_main_~y~0_205) v_main_~y~0_206)) (< v_main_~y~0_206 v_main_~y~0_205) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_206, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_263, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_205, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5360#true} is VALID [2022-04-28 03:37:43,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {5360#true} [96] 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[] {5360#true} is VALID [2022-04-28 03:37:43,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {5360#true} ~z~0 := ~y~0; {5365#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:37:43,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {5365#(= 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; {5366#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:37:43,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {5366#(= (+ (- 1) 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; {5367#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:37:43,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {5367#(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; {5368#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:37:43,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {5368#(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; {5369#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:37:43,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {5369#(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; {5370#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:37:43,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {5370#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:43,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:43,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:43,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:43,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:37:43,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:37:43,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5361#false} is VALID [2022-04-28 03:37:43,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {5361#false} assume !(~y~0 % 4294967296 > 0); {5361#false} is VALID [2022-04-28 03:37:43,458 INFO L272 TraceCheckUtils]: 22: Hoare triple {5361#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5361#false} is VALID [2022-04-28 03:37:43,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {5361#false} ~cond := #in~cond; {5361#false} is VALID [2022-04-28 03:37:43,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {5361#false} assume 0 == ~cond; {5361#false} is VALID [2022-04-28 03:37:43,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {5361#false} assume !false; {5361#false} is VALID [2022-04-28 03:37:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:43,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:43,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387172864] [2022-04-28 03:37:43,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387172864] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:43,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868366035] [2022-04-28 03:37:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:43,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:43,464 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:37:43,483 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:37:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:43,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:37:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:43,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:37:43,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {5360#true} call ULTIMATE.init(); {5360#true} is VALID [2022-04-28 03:37:43,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {5360#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5360#true} is VALID [2022-04-28 03:37:43,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {5360#true} assume true; {5360#true} is VALID [2022-04-28 03:37:43,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5360#true} {5360#true} #61#return; {5360#true} is VALID [2022-04-28 03:37:43,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {5360#true} call #t~ret11 := main(); {5360#true} is VALID [2022-04-28 03:37:43,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {5360#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5360#true} is VALID [2022-04-28 03:37:43,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {5360#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_263 4294967296)) (.cse0 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_206 v_main_~y~0_205)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (= v_main_~x~0_263 v_main_~x~0_262))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (forall ((v_it_17 Int)) (or (not (<= (+ v_main_~y~0_206 v_it_17 1) v_main_~y~0_205)) (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_263 (* 4294967295 v_it_17)) 4294967296)))) (= v_main_~x~0_262 (+ v_main_~x~0_263 (* (- 1) v_main_~y~0_205) v_main_~y~0_206)) (< v_main_~y~0_206 v_main_~y~0_205) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_206, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_263, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_205, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5360#true} is VALID [2022-04-28 03:37:43,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {5360#true} [96] 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[] {5360#true} is VALID [2022-04-28 03:37:43,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {5360#true} ~z~0 := ~y~0; {5365#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:37:43,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {5365#(= 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; {5366#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:37:43,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {5366#(= (+ (- 1) 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; {5367#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:37:43,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {5367#(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; {5368#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:37:43,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {5368#(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; {5369#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:37:43,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {5369#(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; {5370#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:37:43,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {5370#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:43,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:43,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:43,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:43,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:37:43,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:37:43,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5361#false} is VALID [2022-04-28 03:37:43,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {5361#false} assume !(~y~0 % 4294967296 > 0); {5361#false} is VALID [2022-04-28 03:37:43,808 INFO L272 TraceCheckUtils]: 22: Hoare triple {5361#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5361#false} is VALID [2022-04-28 03:37:43,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {5361#false} ~cond := #in~cond; {5361#false} is VALID [2022-04-28 03:37:43,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {5361#false} assume 0 == ~cond; {5361#false} is VALID [2022-04-28 03:37:43,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {5361#false} assume !false; {5361#false} is VALID [2022-04-28 03:37:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:43,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:44,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {5361#false} assume !false; {5361#false} is VALID [2022-04-28 03:37:44,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {5361#false} assume 0 == ~cond; {5361#false} is VALID [2022-04-28 03:37:44,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {5361#false} ~cond := #in~cond; {5361#false} is VALID [2022-04-28 03:37:44,210 INFO L272 TraceCheckUtils]: 22: Hoare triple {5361#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5361#false} is VALID [2022-04-28 03:37:44,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {5361#false} assume !(~y~0 % 4294967296 > 0); {5361#false} is VALID [2022-04-28 03:37:44,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5361#false} is VALID [2022-04-28 03:37:44,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:37:44,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:37:44,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:44,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:44,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:44,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {5489#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:44,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {5493#(or (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {5489#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:44,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {5497#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {5493#(or (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:37:44,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {5501#(or (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5497#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:44,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {5505#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {5501#(or (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:37:44,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {5509#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {5505#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:44,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {5360#true} ~z~0 := ~y~0; {5509#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:44,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {5360#true} [96] 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[] {5360#true} is VALID [2022-04-28 03:37:44,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {5360#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_263 4294967296)) (.cse0 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_206 v_main_~y~0_205)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (= v_main_~x~0_263 v_main_~x~0_262))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (forall ((v_it_17 Int)) (or (not (<= (+ v_main_~y~0_206 v_it_17 1) v_main_~y~0_205)) (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_263 (* 4294967295 v_it_17)) 4294967296)))) (= v_main_~x~0_262 (+ v_main_~x~0_263 (* (- 1) v_main_~y~0_205) v_main_~y~0_206)) (< v_main_~y~0_206 v_main_~y~0_205) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_206, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_263, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_205, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5360#true} is VALID [2022-04-28 03:37:44,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {5360#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5360#true} is VALID [2022-04-28 03:37:44,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {5360#true} call #t~ret11 := main(); {5360#true} is VALID [2022-04-28 03:37:44,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5360#true} {5360#true} #61#return; {5360#true} is VALID [2022-04-28 03:37:44,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {5360#true} assume true; {5360#true} is VALID [2022-04-28 03:37:44,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {5360#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5360#true} is VALID [2022-04-28 03:37:44,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {5360#true} call ULTIMATE.init(); {5360#true} is VALID [2022-04-28 03:37:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:44,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868366035] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:44,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:44,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 21 [2022-04-28 03:37:44,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:44,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1019598860] [2022-04-28 03:37:44,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1019598860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:44,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:44,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:37:44,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511917150] [2022-04-28 03:37:44,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:44,525 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 03:37:44,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:44,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:44,571 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:37:44,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:37:44,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:44,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:37:44,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:37:44,572 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:47,140 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-28 03:37:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:37:47,141 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 03:37:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 53 transitions. [2022-04-28 03:37:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 53 transitions. [2022-04-28 03:37:47,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 53 transitions. [2022-04-28 03:37:47,268 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:37:47,268 INFO L225 Difference]: With dead ends: 57 [2022-04-28 03:37:47,268 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 03:37:47,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=2139, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 03:37:47,270 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:47,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 78 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:37:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 03:37:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 03:37:47,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:47,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:47,373 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:47,373 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:47,373 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-28 03:37:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-28 03:37:47,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:47,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:47,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 03:37:47,374 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 03:37:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:47,374 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-28 03:37:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-28 03:37:47,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:47,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:47,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:47,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-28 03:37:47,375 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2022-04-28 03:37:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:47,375 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-28 03:37:47,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:47,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-28 03:38:00,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 28 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-28 03:38:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:38:00,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:38:00,060 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:38:00,076 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:38:00,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:00,261 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:38:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:38:00,261 INFO L85 PathProgramCache]: Analyzing trace with hash 43269344, now seen corresponding path program 15 times [2022-04-28 03:38:00,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:00,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1242320750] [2022-04-28 03:38:00,436 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:38:00,438 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:38:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1661923328, now seen corresponding path program 1 times [2022-04-28 03:38:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:38:00,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037324415] [2022-04-28 03:38:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:38:00,450 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:38:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:00,472 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:38:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:38:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:00,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {5854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5837#true} is VALID [2022-04-28 03:38:00,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {5837#true} assume true; {5837#true} is VALID [2022-04-28 03:38:00,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5837#true} {5837#true} #61#return; {5837#true} is VALID [2022-04-28 03:38:00,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {5837#true} call ULTIMATE.init(); {5854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:38:00,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {5854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5837#true} is VALID [2022-04-28 03:38:00,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {5837#true} assume true; {5837#true} is VALID [2022-04-28 03:38:00,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5837#true} {5837#true} #61#return; {5837#true} is VALID [2022-04-28 03:38:00,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {5837#true} call #t~ret11 := main(); {5837#true} is VALID [2022-04-28 03:38:00,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {5837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5837#true} is VALID [2022-04-28 03:38:00,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {5837#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_286 v_main_~x~0_285)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse2 (= v_main_~y~0_229 v_main_~y~0_228)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|)) (.cse3 (mod v_main_~x~0_286 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_228 (+ v_main_~x~0_286 (* v_main_~x~0_285 (- 1)) v_main_~y~0_229)) (< 0 .cse3) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_285 v_it_18 1) v_main_~x~0_286)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_286 (* 4294967295 v_it_18)) 4294967296)))) (< v_main_~x~0_285 v_main_~x~0_286)))) InVars {main_~y~0=v_main_~y~0_229, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_286, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5837#true} is VALID [2022-04-28 03:38:00,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {5837#true} [98] 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[] {5837#true} is VALID [2022-04-28 03:38:00,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {5837#true} ~z~0 := ~y~0; {5842#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:38:00,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {5842#(= (+ 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; {5843#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:38:00,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {5843#(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; {5844#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:38:00,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {5844#(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; {5845#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:38:00,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {5845#(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; {5846#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:38:00,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {5846#(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; {5847#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:38:00,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {5847#(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; {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:00,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:00,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:38:00,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:38:00,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:38:00,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:38:00,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:38:00,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5838#false} is VALID [2022-04-28 03:38:00,673 INFO L272 TraceCheckUtils]: 22: Hoare triple {5838#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5838#false} is VALID [2022-04-28 03:38:00,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {5838#false} ~cond := #in~cond; {5838#false} is VALID [2022-04-28 03:38:00,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {5838#false} assume 0 == ~cond; {5838#false} is VALID [2022-04-28 03:38:00,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {5838#false} assume !false; {5838#false} is VALID [2022-04-28 03:38:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:00,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:38:00,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037324415] [2022-04-28 03:38:00,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037324415] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:38:00,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193603796] [2022-04-28 03:38:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:00,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:00,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:38:00,675 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:38:00,676 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:38:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:00,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:38:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:00,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:38:01,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {5837#true} call ULTIMATE.init(); {5837#true} is VALID [2022-04-28 03:38:01,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {5837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5837#true} is VALID [2022-04-28 03:38:01,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {5837#true} assume true; {5837#true} is VALID [2022-04-28 03:38:01,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5837#true} {5837#true} #61#return; {5837#true} is VALID [2022-04-28 03:38:01,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {5837#true} call #t~ret11 := main(); {5837#true} is VALID [2022-04-28 03:38:01,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {5837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5837#true} is VALID [2022-04-28 03:38:01,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {5837#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_286 v_main_~x~0_285)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse2 (= v_main_~y~0_229 v_main_~y~0_228)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|)) (.cse3 (mod v_main_~x~0_286 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_228 (+ v_main_~x~0_286 (* v_main_~x~0_285 (- 1)) v_main_~y~0_229)) (< 0 .cse3) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_285 v_it_18 1) v_main_~x~0_286)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_286 (* 4294967295 v_it_18)) 4294967296)))) (< v_main_~x~0_285 v_main_~x~0_286)))) InVars {main_~y~0=v_main_~y~0_229, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_286, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5837#true} is VALID [2022-04-28 03:38:01,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {5837#true} [98] 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[] {5837#true} is VALID [2022-04-28 03:38:01,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {5837#true} ~z~0 := ~y~0; {5842#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:38:01,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {5842#(= (+ 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; {5843#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:38:01,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {5843#(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; {5844#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:38:01,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {5844#(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; {5845#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:38:01,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {5845#(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; {5846#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:38:01,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {5846#(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; {5847#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:38:01,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {5847#(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; {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:01,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:01,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:38:01,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:38:01,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:38:01,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:38:01,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:38:01,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5838#false} is VALID [2022-04-28 03:38:01,112 INFO L272 TraceCheckUtils]: 22: Hoare triple {5838#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5838#false} is VALID [2022-04-28 03:38:01,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {5838#false} ~cond := #in~cond; {5838#false} is VALID [2022-04-28 03:38:01,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {5838#false} assume 0 == ~cond; {5838#false} is VALID [2022-04-28 03:38:01,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {5838#false} assume !false; {5838#false} is VALID [2022-04-28 03:38:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:01,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:38:01,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {5838#false} assume !false; {5838#false} is VALID [2022-04-28 03:38:01,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {5838#false} assume 0 == ~cond; {5838#false} is VALID [2022-04-28 03:38:01,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {5838#false} ~cond := #in~cond; {5838#false} is VALID [2022-04-28 03:38:01,534 INFO L272 TraceCheckUtils]: 22: Hoare triple {5838#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5838#false} is VALID [2022-04-28 03:38:01,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5838#false} is VALID [2022-04-28 03:38:01,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:38:01,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:38:01,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:38:01,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:38:01,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:38:01,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:01,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {5966#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:01,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {5970#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5966#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:01,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {5974#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5970#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:01,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {5978#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5974#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:01,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {5982#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5978#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:01,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {5986#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 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; {5982#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:01,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {5837#true} ~z~0 := ~y~0; {5986#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:38:01,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {5837#true} [98] 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[] {5837#true} is VALID [2022-04-28 03:38:01,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {5837#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_286 v_main_~x~0_285)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse2 (= v_main_~y~0_229 v_main_~y~0_228)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|)) (.cse3 (mod v_main_~x~0_286 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_228 (+ v_main_~x~0_286 (* v_main_~x~0_285 (- 1)) v_main_~y~0_229)) (< 0 .cse3) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_285 v_it_18 1) v_main_~x~0_286)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_286 (* 4294967295 v_it_18)) 4294967296)))) (< v_main_~x~0_285 v_main_~x~0_286)))) InVars {main_~y~0=v_main_~y~0_229, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_286, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5837#true} is VALID [2022-04-28 03:38:01,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {5837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5837#true} is VALID [2022-04-28 03:38:01,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {5837#true} call #t~ret11 := main(); {5837#true} is VALID [2022-04-28 03:38:01,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5837#true} {5837#true} #61#return; {5837#true} is VALID [2022-04-28 03:38:01,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {5837#true} assume true; {5837#true} is VALID [2022-04-28 03:38:01,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {5837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5837#true} is VALID [2022-04-28 03:38:01,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {5837#true} call ULTIMATE.init(); {5837#true} is VALID [2022-04-28 03:38:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:01,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193603796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:38:01,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:38:01,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 21 [2022-04-28 03:38:02,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:38:02,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1242320750] [2022-04-28 03:38:02,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1242320750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:38:02,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:38:02,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:38:02,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179608347] [2022-04-28 03:38:02,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:38:02,011 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:38:02,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:38:02,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:02,113 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:38:02,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:38:02,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:38:02,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:38:02,114 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:06,602 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-28 03:38:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:38:06,602 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:38:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:38:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-28 03:38:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-28 03:38:06,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 40 transitions. [2022-04-28 03:38:07,098 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:38:07,099 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:38:07,099 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:38:07,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=311, Invalid=1759, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:38:07,100 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:38:07,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 86 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:38:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:38:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 03:38:07,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:38:07,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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:38:07,210 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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:38:07,211 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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:38:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:07,211 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 03:38:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 03:38:07,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:07,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:07,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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 33 states. [2022-04-28 03:38:07,212 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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 33 states. [2022-04-28 03:38:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:07,213 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 03:38:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 03:38:07,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:07,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:07,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:38:07,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:38:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 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:38:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 03:38:07,214 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2022-04-28 03:38:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:38:07,214 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 03:38:07,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:07,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 03:38:17,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 30 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 03:38:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:38:17,583 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:38:17,583 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:38:17,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 03:38:17,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:17,784 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:38:17,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:38:17,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 16 times [2022-04-28 03:38:17,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:17,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1905487637] [2022-04-28 03:38:17,975 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:38:17,976 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:38:17,979 INFO L85 PathProgramCache]: Analyzing trace with hash -380435923, now seen corresponding path program 1 times [2022-04-28 03:38:17,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:38:17,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399861986] [2022-04-28 03:38:17,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:17,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:38:17,989 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:38:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:18,007 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:38:18,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:38:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:18,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {6284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6270#true} is VALID [2022-04-28 03:38:18,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-28 03:38:18,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6270#true} {6270#true} #61#return; {6270#true} is VALID [2022-04-28 03:38:18,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {6270#true} call ULTIMATE.init(); {6284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:38:18,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {6284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6270#true} is VALID [2022-04-28 03:38:18,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-28 03:38:18,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6270#true} {6270#true} #61#return; {6270#true} is VALID [2022-04-28 03:38:18,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {6270#true} call #t~ret11 := main(); {6270#true} is VALID [2022-04-28 03:38:18,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {6270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6270#true} is VALID [2022-04-28 03:38:18,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {6270#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_309 4294967296)) (.cse1 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= v_main_~y~0_251 v_main_~y~0_250)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (= v_main_~x~0_309 v_main_~x~0_308))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_308 v_main_~x~0_309) (forall ((v_it_19 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_19)) 4294967296)) (not (<= (+ v_main_~x~0_308 v_it_19 1) v_main_~x~0_309)) (not (<= 1 v_it_19)))) (= v_main_~y~0_250 (+ v_main_~x~0_309 v_main_~y~0_251 (* v_main_~x~0_308 (- 1))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_251, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6270#true} is VALID [2022-04-28 03:38:18,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {6270#true} [100] 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[] {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#(<= 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; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:38:18,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {6276#(<= 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; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {6277#(<= 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; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {6278#(<= 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; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {6279#(<= 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; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:38:18,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {6280#(<= 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; {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:38:18,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:38:18,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,170 INFO L272 TraceCheckUtils]: 23: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:38:18,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {6282#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6283#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:38:18,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {6283#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6271#false} is VALID [2022-04-28 03:38:18,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-28 03:38:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:18,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:38:18,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399861986] [2022-04-28 03:38:18,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399861986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:38:18,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943547994] [2022-04-28 03:38:18,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:18,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:18,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:38:18,176 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:38:18,180 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:38:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:18,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:38:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:18,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:38:18,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {6270#true} call ULTIMATE.init(); {6270#true} is VALID [2022-04-28 03:38:18,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {6270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6270#true} is VALID [2022-04-28 03:38:18,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-28 03:38:18,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6270#true} {6270#true} #61#return; {6270#true} is VALID [2022-04-28 03:38:18,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {6270#true} call #t~ret11 := main(); {6270#true} is VALID [2022-04-28 03:38:18,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {6270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6270#true} is VALID [2022-04-28 03:38:18,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {6270#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_309 4294967296)) (.cse1 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= v_main_~y~0_251 v_main_~y~0_250)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (= v_main_~x~0_309 v_main_~x~0_308))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_308 v_main_~x~0_309) (forall ((v_it_19 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_19)) 4294967296)) (not (<= (+ v_main_~x~0_308 v_it_19 1) v_main_~x~0_309)) (not (<= 1 v_it_19)))) (= v_main_~y~0_250 (+ v_main_~x~0_309 v_main_~y~0_251 (* v_main_~x~0_308 (- 1))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_251, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6270#true} is VALID [2022-04-28 03:38:18,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {6270#true} [100] 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[] {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#(<= 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; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:38:18,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {6276#(<= 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; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {6277#(<= 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; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {6278#(<= 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; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {6279#(<= 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; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:38:18,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {6280#(<= 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; {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:38:18,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:38:18,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,475 INFO L272 TraceCheckUtils]: 23: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6357#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:38:18,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {6357#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6361#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:38:18,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {6361#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6271#false} is VALID [2022-04-28 03:38:18,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-28 03:38:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:18,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:38:18,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-28 03:38:18,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {6361#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6271#false} is VALID [2022-04-28 03:38:18,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {6357#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6361#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:38:18,744 INFO L272 TraceCheckUtils]: 23: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6357#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:38:18,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:38:18,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:38:18,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {6280#(<= 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; {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {6279#(<= 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; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:38:18,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {6278#(<= 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; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {6277#(<= 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; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {6276#(<= 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; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:18,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#(<= 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; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:38:18,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {6270#true} [100] 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[] {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:38:18,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {6270#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_309 4294967296)) (.cse1 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= v_main_~y~0_251 v_main_~y~0_250)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (= v_main_~x~0_309 v_main_~x~0_308))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_308 v_main_~x~0_309) (forall ((v_it_19 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_19)) 4294967296)) (not (<= (+ v_main_~x~0_308 v_it_19 1) v_main_~x~0_309)) (not (<= 1 v_it_19)))) (= v_main_~y~0_250 (+ v_main_~x~0_309 v_main_~y~0_251 (* v_main_~x~0_308 (- 1))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_251, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6270#true} is VALID [2022-04-28 03:38:18,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {6270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6270#true} is VALID [2022-04-28 03:38:18,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {6270#true} call #t~ret11 := main(); {6270#true} is VALID [2022-04-28 03:38:18,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6270#true} {6270#true} #61#return; {6270#true} is VALID [2022-04-28 03:38:18,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-28 03:38:18,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {6270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6270#true} is VALID [2022-04-28 03:38:18,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {6270#true} call ULTIMATE.init(); {6270#true} is VALID [2022-04-28 03:38:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:18,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943547994] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:38:18,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:38:18,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2022-04-28 03:38:19,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:38:19,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1905487637] [2022-04-28 03:38:19,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1905487637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:38:19,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:38:19,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:38:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489136890] [2022-04-28 03:38:19,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:38:19,158 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) 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 32 [2022-04-28 03:38:19,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:38:19,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) 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:38:19,194 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:38:19,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:38:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:19,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:38:19,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:38:19,194 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) 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:38:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:21,229 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-28 03:38:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:38:21,229 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) 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 32 [2022-04-28 03:38:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:38:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) 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:38:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2022-04-28 03:38:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) 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:38:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2022-04-28 03:38:21,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 61 transitions. [2022-04-28 03:38:21,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:21,359 INFO L225 Difference]: With dead ends: 58 [2022-04-28 03:38:21,359 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:38:21,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:38:21,361 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:38:21,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 55 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:38:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:38:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2022-04-28 03:38:21,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:38:21,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:21,501 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:21,501 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:21,502 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-28 03:38:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-28 03:38:21,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:21,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:21,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:38:21,503 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:38:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:21,503 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-28 03:38:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-28 03:38:21,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:21,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:21,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:38:21,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:38:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-28 03:38:21,504 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-04-28 03:38:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:38:21,504 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-28 03:38:21,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) 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:38:21,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-28 03:38:32,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 33 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-28 03:38:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:38:32,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:38:32,894 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:38:32,932 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:38:33,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:33,094 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:38:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:38:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash -263990656, now seen corresponding path program 17 times [2022-04-28 03:38:33,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:33,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [753602028] [2022-04-28 03:38:33,261 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:38:33,263 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:38:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1767439904, now seen corresponding path program 1 times [2022-04-28 03:38:33,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:38:33,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12719014] [2022-04-28 03:38:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:33,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:38:33,276 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:38:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:33,300 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:38:33,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:38:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:33,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {6795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6776#true} is VALID [2022-04-28 03:38:33,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {6776#true} assume true; {6776#true} is VALID [2022-04-28 03:38:33,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6776#true} {6776#true} #61#return; {6776#true} is VALID [2022-04-28 03:38:33,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {6776#true} call ULTIMATE.init(); {6795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:38:33,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {6795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6776#true} is VALID [2022-04-28 03:38:33,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {6776#true} assume true; {6776#true} is VALID [2022-04-28 03:38:33,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6776#true} {6776#true} #61#return; {6776#true} is VALID [2022-04-28 03:38:33,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {6776#true} call #t~ret11 := main(); {6776#true} is VALID [2022-04-28 03:38:33,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {6776#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6776#true} is VALID [2022-04-28 03:38:33,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {6776#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_345 v_main_~x~0_344)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse3 (mod v_main_~x~0_345 4294967296))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2) (and (< 0 .cse3) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_344 (+ v_main_~x~0_345 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_345 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268))))))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_345, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_344, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6776#true} is VALID [2022-04-28 03:38:33,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {6776#true} [102] 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[] {6776#true} is VALID [2022-04-28 03:38:33,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {6776#true} ~z~0 := ~y~0; {6781#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:38:33,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {6781#(= 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; {6782#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:38:33,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {6782#(= (+ (- 1) 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; {6783#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:38:33,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#(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; {6784#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:38:33,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {6784#(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; {6785#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:38:33,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {6785#(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; {6786#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:38:33,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {6786#(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; {6787#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:38:33,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {6787#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:33,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:33,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:33,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:33,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:33,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:38:33,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:38:33,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6777#false} is VALID [2022-04-28 03:38:33,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {6777#false} assume !(~y~0 % 4294967296 > 0); {6777#false} is VALID [2022-04-28 03:38:33,521 INFO L272 TraceCheckUtils]: 24: Hoare triple {6777#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6777#false} is VALID [2022-04-28 03:38:33,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {6777#false} ~cond := #in~cond; {6777#false} is VALID [2022-04-28 03:38:33,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {6777#false} assume 0 == ~cond; {6777#false} is VALID [2022-04-28 03:38:33,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {6777#false} assume !false; {6777#false} is VALID [2022-04-28 03:38:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:33,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:38:33,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12719014] [2022-04-28 03:38:33,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12719014] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:38:33,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521557064] [2022-04-28 03:38:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:33,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:33,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:38:33,523 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:38:33,524 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:38:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:33,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:38:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:33,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:38:33,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {6776#true} call ULTIMATE.init(); {6776#true} is VALID [2022-04-28 03:38:33,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {6776#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6776#true} is VALID [2022-04-28 03:38:33,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {6776#true} assume true; {6776#true} is VALID [2022-04-28 03:38:33,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6776#true} {6776#true} #61#return; {6776#true} is VALID [2022-04-28 03:38:33,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {6776#true} call #t~ret11 := main(); {6776#true} is VALID [2022-04-28 03:38:33,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {6776#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6776#true} is VALID [2022-04-28 03:38:33,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {6776#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_345 v_main_~x~0_344)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse3 (mod v_main_~x~0_345 4294967296))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2) (and (< 0 .cse3) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_344 (+ v_main_~x~0_345 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_345 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268))))))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_345, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_344, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6776#true} is VALID [2022-04-28 03:38:33,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {6776#true} [102] 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[] {6776#true} is VALID [2022-04-28 03:38:33,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {6776#true} ~z~0 := ~y~0; {6781#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:38:33,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {6781#(= 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; {6782#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:38:33,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {6782#(= (+ (- 1) 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; {6783#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:38:33,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#(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; {6784#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:38:33,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {6784#(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; {6785#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:38:33,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {6785#(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; {6786#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:38:33,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {6786#(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; {6787#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:38:33,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {6787#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:33,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:33,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:33,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:33,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:33,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:38:33,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:38:33,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6777#false} is VALID [2022-04-28 03:38:33,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {6777#false} assume !(~y~0 % 4294967296 > 0); {6777#false} is VALID [2022-04-28 03:38:33,896 INFO L272 TraceCheckUtils]: 24: Hoare triple {6777#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6777#false} is VALID [2022-04-28 03:38:33,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {6777#false} ~cond := #in~cond; {6777#false} is VALID [2022-04-28 03:38:33,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {6777#false} assume 0 == ~cond; {6777#false} is VALID [2022-04-28 03:38:33,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {6777#false} assume !false; {6777#false} is VALID [2022-04-28 03:38:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:33,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:38:34,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {6777#false} assume !false; {6777#false} is VALID [2022-04-28 03:38:34,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {6777#false} assume 0 == ~cond; {6777#false} is VALID [2022-04-28 03:38:34,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {6777#false} ~cond := #in~cond; {6777#false} is VALID [2022-04-28 03:38:34,441 INFO L272 TraceCheckUtils]: 24: Hoare triple {6777#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6777#false} is VALID [2022-04-28 03:38:34,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {6777#false} assume !(~y~0 % 4294967296 > 0); {6777#false} is VALID [2022-04-28 03:38:34,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6777#false} is VALID [2022-04-28 03:38:34,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:38:34,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:38:34,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:34,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:34,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:34,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:34,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {6916#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:34,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {6920#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6916#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:34,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {6924#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6920#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:34,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {6928#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6924#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:34,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {6932#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6928#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:34,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {6936#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6932#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:34,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {6940#(or (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6936#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:38:34,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {6776#true} ~z~0 := ~y~0; {6940#(or (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:38:34,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {6776#true} [102] 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[] {6776#true} is VALID [2022-04-28 03:38:34,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {6776#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_345 v_main_~x~0_344)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse3 (mod v_main_~x~0_345 4294967296))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2) (and (< 0 .cse3) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_344 (+ v_main_~x~0_345 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_345 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268))))))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_345, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_344, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6776#true} is VALID [2022-04-28 03:38:34,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {6776#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6776#true} is VALID [2022-04-28 03:38:34,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {6776#true} call #t~ret11 := main(); {6776#true} is VALID [2022-04-28 03:38:34,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6776#true} {6776#true} #61#return; {6776#true} is VALID [2022-04-28 03:38:34,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {6776#true} assume true; {6776#true} is VALID [2022-04-28 03:38:34,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {6776#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6776#true} is VALID [2022-04-28 03:38:34,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {6776#true} call ULTIMATE.init(); {6776#true} is VALID [2022-04-28 03:38:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:34,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521557064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:38:34,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:38:34,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-04-28 03:38:34,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:38:34,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [753602028] [2022-04-28 03:38:34,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [753602028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:38:34,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:38:34,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:38:34,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278312260] [2022-04-28 03:38:34,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:38:34,984 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:38:34,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:38:34,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:35,087 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:38:35,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:38:35,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:35,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:38:35,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:38:35,089 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:39,205 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-04-28 03:38:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:38:39,206 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:38:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:38:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 57 transitions. [2022-04-28 03:38:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 57 transitions. [2022-04-28 03:38:39,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 57 transitions. [2022-04-28 03:38:39,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:39,436 INFO L225 Difference]: With dead ends: 63 [2022-04-28 03:38:39,436 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:38:39,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=390, Invalid=2916, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:38:39,438 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:38:39,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 88 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:38:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:38:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 03:38:39,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:38:39,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:39,564 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:39,564 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:39,565 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 03:38:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 03:38:39,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:39,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:39,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:38:39,565 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:38:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:39,566 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 03:38:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 03:38:39,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:39,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:39,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:38:39,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:38:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-28 03:38:39,567 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2022-04-28 03:38:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:38:39,567 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-28 03:38:39,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:39,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-28 03:38:52,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 32 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 03:38:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:38:52,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:38:52,007 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:38:52,023 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:38:52,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:52,208 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:38:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:38:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash -685840210, now seen corresponding path program 18 times [2022-04-28 03:38:52,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:52,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1112319693] [2022-04-28 03:38:55,458 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:38:55,460 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:38:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash 144115087, now seen corresponding path program 1 times [2022-04-28 03:38:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:38:55,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585765274] [2022-04-28 03:38:55,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:38:55,472 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:38:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:55,496 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:38:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:38:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:55,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {7320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7301#true} is VALID [2022-04-28 03:38:55,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-28 03:38:55,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7301#true} {7301#true} #61#return; {7301#true} is VALID [2022-04-28 03:38:55,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {7301#true} call ULTIMATE.init(); {7320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:38:55,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {7320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7301#true} is VALID [2022-04-28 03:38:55,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-28 03:38:55,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7301#true} {7301#true} #61#return; {7301#true} is VALID [2022-04-28 03:38:55,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {7301#true} call #t~ret11 := main(); {7301#true} is VALID [2022-04-28 03:38:55,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {7301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7301#true} is VALID [2022-04-28 03:38:55,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {7301#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_371 4294967296)) (.cse1 (= v_main_~y~0_295 v_main_~y~0_294)) (.cse2 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse3 (= v_main_~x~0_371 v_main_~x~0_370)) (.cse4 (= |v_main_#t~post6_99| |v_main_#t~post6_98|))) (or (and (< 0 .cse0) (= v_main_~y~0_294 (+ v_main_~x~0_371 v_main_~y~0_295 (* v_main_~x~0_370 (- 1)))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~x~0_370 v_it_21 1) v_main_~x~0_371)) (< 0 (mod (+ v_main_~x~0_371 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~x~0_370 v_main_~x~0_371)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_295, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_371, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_294, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_370, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7301#true} is VALID [2022-04-28 03:38:55,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#true} [104] 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[] {7301#true} is VALID [2022-04-28 03:38:55,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {7301#true} ~z~0 := ~y~0; {7306#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:38:55,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {7306#(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; {7307#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:38:55,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {7307#(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; {7308#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:38:55,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {7308#(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; {7309#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:38:55,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {7309#(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; {7310#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:38:55,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {7310#(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; {7311#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:38:55,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {7311#(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; {7312#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:38:55,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {7312#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:38:55,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:38:55,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:55,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:38:55,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:38:55,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:38:55,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:38:55,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:38:55,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7302#false} is VALID [2022-04-28 03:38:55,759 INFO L272 TraceCheckUtils]: 24: Hoare triple {7302#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7302#false} is VALID [2022-04-28 03:38:55,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {7302#false} ~cond := #in~cond; {7302#false} is VALID [2022-04-28 03:38:55,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {7302#false} assume 0 == ~cond; {7302#false} is VALID [2022-04-28 03:38:55,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {7302#false} assume !false; {7302#false} is VALID [2022-04-28 03:38:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:55,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:38:55,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585765274] [2022-04-28 03:38:55,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585765274] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:38:55,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408748221] [2022-04-28 03:38:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:55,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:55,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:38:55,764 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:38:55,792 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:38:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:55,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:38:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:55,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:38:56,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {7301#true} call ULTIMATE.init(); {7301#true} is VALID [2022-04-28 03:38:56,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {7301#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7301#true} is VALID [2022-04-28 03:38:56,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-28 03:38:56,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7301#true} {7301#true} #61#return; {7301#true} is VALID [2022-04-28 03:38:56,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {7301#true} call #t~ret11 := main(); {7301#true} is VALID [2022-04-28 03:38:56,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {7301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7301#true} is VALID [2022-04-28 03:38:56,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {7301#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_371 4294967296)) (.cse1 (= v_main_~y~0_295 v_main_~y~0_294)) (.cse2 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse3 (= v_main_~x~0_371 v_main_~x~0_370)) (.cse4 (= |v_main_#t~post6_99| |v_main_#t~post6_98|))) (or (and (< 0 .cse0) (= v_main_~y~0_294 (+ v_main_~x~0_371 v_main_~y~0_295 (* v_main_~x~0_370 (- 1)))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~x~0_370 v_it_21 1) v_main_~x~0_371)) (< 0 (mod (+ v_main_~x~0_371 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~x~0_370 v_main_~x~0_371)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_295, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_371, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_294, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_370, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7301#true} is VALID [2022-04-28 03:38:56,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#true} [104] 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[] {7301#true} is VALID [2022-04-28 03:38:56,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {7301#true} ~z~0 := ~y~0; {7306#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:38:56,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {7306#(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; {7307#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:38:56,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {7307#(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; {7308#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:38:56,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {7308#(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; {7309#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:38:56,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {7309#(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; {7310#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:38:56,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {7310#(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; {7311#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:38:56,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {7311#(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; {7312#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:38:56,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {7312#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:38:56,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:38:56,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:56,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:38:56,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:38:56,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:38:56,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:38:56,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:38:56,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7302#false} is VALID [2022-04-28 03:38:56,292 INFO L272 TraceCheckUtils]: 24: Hoare triple {7302#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7302#false} is VALID [2022-04-28 03:38:56,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {7302#false} ~cond := #in~cond; {7302#false} is VALID [2022-04-28 03:38:56,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {7302#false} assume 0 == ~cond; {7302#false} is VALID [2022-04-28 03:38:56,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {7302#false} assume !false; {7302#false} is VALID [2022-04-28 03:38:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:56,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:38:56,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {7302#false} assume !false; {7302#false} is VALID [2022-04-28 03:38:56,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {7302#false} assume 0 == ~cond; {7302#false} is VALID [2022-04-28 03:38:56,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {7302#false} ~cond := #in~cond; {7302#false} is VALID [2022-04-28 03:38:56,745 INFO L272 TraceCheckUtils]: 24: Hoare triple {7302#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7302#false} is VALID [2022-04-28 03:38:56,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7302#false} is VALID [2022-04-28 03:38:56,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:38:56,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:38:56,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:38:56,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:38:56,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:38:56,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:38:56,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:38:56,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {7441#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:38:56,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {7445#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7441#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-28 03:38:56,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {7449#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7445#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-28 03:38:56,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {7453#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7449#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:38:56,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {7457#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7453#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-28 03:38:56,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {7461#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7457#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-28 03:38:56,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {7465#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7461#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:38:56,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {7301#true} ~z~0 := ~y~0; {7465#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:38:56,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#true} [104] 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[] {7301#true} is VALID [2022-04-28 03:38:56,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {7301#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_371 4294967296)) (.cse1 (= v_main_~y~0_295 v_main_~y~0_294)) (.cse2 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse3 (= v_main_~x~0_371 v_main_~x~0_370)) (.cse4 (= |v_main_#t~post6_99| |v_main_#t~post6_98|))) (or (and (< 0 .cse0) (= v_main_~y~0_294 (+ v_main_~x~0_371 v_main_~y~0_295 (* v_main_~x~0_370 (- 1)))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~x~0_370 v_it_21 1) v_main_~x~0_371)) (< 0 (mod (+ v_main_~x~0_371 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~x~0_370 v_main_~x~0_371)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_295, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_371, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_294, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_370, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7301#true} is VALID [2022-04-28 03:38:56,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {7301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7301#true} is VALID [2022-04-28 03:38:56,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {7301#true} call #t~ret11 := main(); {7301#true} is VALID [2022-04-28 03:38:56,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7301#true} {7301#true} #61#return; {7301#true} is VALID [2022-04-28 03:38:56,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-28 03:38:56,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {7301#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7301#true} is VALID [2022-04-28 03:38:56,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {7301#true} call ULTIMATE.init(); {7301#true} is VALID [2022-04-28 03:38:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:56,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408748221] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:38:56,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:38:56,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-04-28 03:38:57,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:38:57,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1112319693] [2022-04-28 03:38:57,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1112319693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:38:57,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:38:57,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:38:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983210431] [2022-04-28 03:38:57,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:38:57,748 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:38:57,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:38:57,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:57,797 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:38:57,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:38:57,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:57,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:38:57,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:38:57,798 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:05,984 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-28 03:39:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:39:05,984 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:39:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2022-04-28 03:39:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2022-04-28 03:39:05,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 43 transitions. [2022-04-28 03:39:06,544 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:39:06,545 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:39:06,545 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 03:39:06,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=396, Invalid=2360, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:39:06,546 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:06,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 101 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:39:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 03:39:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 03:39:06,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:06,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:06,681 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:06,681 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:06,681 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 03:39:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 03:39:06,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:06,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:06,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 03:39:06,682 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 03:39:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:06,682 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 03:39:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 03:39:06,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:06,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:06,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:06,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 03:39:06,684 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2022-04-28 03:39:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:06,684 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 03:39:06,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:06,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 03:39:18,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 33 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 03:39:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:39:18,468 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:18,468 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:18,484 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:39:18,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:18,669 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 19 times [2022-04-28 03:39:18,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:18,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1951394323] [2022-04-28 03:39:18,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:39:18,825 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1379488130, now seen corresponding path program 1 times [2022-04-28 03:39:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:18,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685471245] [2022-04-28 03:39:18,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:18,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:18,836 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:39:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:18,854 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:39:19,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:19,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {7789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7774#true} is VALID [2022-04-28 03:39:19,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {7774#true} assume true; {7774#true} is VALID [2022-04-28 03:39:19,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7774#true} {7774#true} #61#return; {7774#true} is VALID [2022-04-28 03:39:19,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {7774#true} call ULTIMATE.init(); {7789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:19,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {7789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7774#true} is VALID [2022-04-28 03:39:19,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {7774#true} assume true; {7774#true} is VALID [2022-04-28 03:39:19,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7774#true} {7774#true} #61#return; {7774#true} is VALID [2022-04-28 03:39:19,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {7774#true} call #t~ret11 := main(); {7774#true} is VALID [2022-04-28 03:39:19,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {7774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7774#true} is VALID [2022-04-28 03:39:19,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {7774#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_397 v_main_~x~0_396)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (mod v_main_~x~0_397 4294967296)) (.cse2 (= |v_main_#t~post6_104| |v_main_#t~post6_103|))) (or (and (= v_main_~y~0_320 v_main_~y~0_319) .cse0 .cse1 .cse2) (and (= v_main_~x~0_396 (+ v_main_~x~0_397 v_main_~y~0_320 (* (- 1) v_main_~y~0_319))) (< v_main_~y~0_320 v_main_~y~0_319) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_320 v_it_22 1) v_main_~y~0_319)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_397 (* 4294967295 v_it_22)) 4294967296)))) (< 0 .cse3)) (and .cse0 (= v_main_~y~0_319 v_main_~y~0_320) .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_320, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_319, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7774#true} is VALID [2022-04-28 03:39:19,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {7774#true} [106] 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[] {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {7779#(<= 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; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:19,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {7780#(<= 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; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {7781#(<= 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; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {7782#(<= 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; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {7783#(<= 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; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:39:19,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {7784#(<= 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; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {7785#(<= 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; {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:39:19,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:19,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,029 INFO L272 TraceCheckUtils]: 25: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:39:19,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {7787#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7788#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:39:19,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {7788#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7775#false} is VALID [2022-04-28 03:39:19,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {7775#false} assume !false; {7775#false} is VALID [2022-04-28 03:39:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:19,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:19,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685471245] [2022-04-28 03:39:19,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685471245] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:39:19,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593731174] [2022-04-28 03:39:19,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:19,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:19,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:39:19,032 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:39:19,034 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:39:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:19,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:39:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:19,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:39:19,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {7774#true} call ULTIMATE.init(); {7774#true} is VALID [2022-04-28 03:39:19,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {7774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7774#true} is VALID [2022-04-28 03:39:19,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {7774#true} assume true; {7774#true} is VALID [2022-04-28 03:39:19,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7774#true} {7774#true} #61#return; {7774#true} is VALID [2022-04-28 03:39:19,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {7774#true} call #t~ret11 := main(); {7774#true} is VALID [2022-04-28 03:39:19,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {7774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7774#true} is VALID [2022-04-28 03:39:19,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {7774#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_397 v_main_~x~0_396)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (mod v_main_~x~0_397 4294967296)) (.cse2 (= |v_main_#t~post6_104| |v_main_#t~post6_103|))) (or (and (= v_main_~y~0_320 v_main_~y~0_319) .cse0 .cse1 .cse2) (and (= v_main_~x~0_396 (+ v_main_~x~0_397 v_main_~y~0_320 (* (- 1) v_main_~y~0_319))) (< v_main_~y~0_320 v_main_~y~0_319) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_320 v_it_22 1) v_main_~y~0_319)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_397 (* 4294967295 v_it_22)) 4294967296)))) (< 0 .cse3)) (and .cse0 (= v_main_~y~0_319 v_main_~y~0_320) .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_320, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_319, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7774#true} is VALID [2022-04-28 03:39:19,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {7774#true} [106] 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[] {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {7779#(<= 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; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:19,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {7780#(<= 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; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {7781#(<= 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; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {7782#(<= 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; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {7783#(<= 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; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:39:19,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {7784#(<= 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; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {7785#(<= 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; {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:39:19,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:19,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,347 INFO L272 TraceCheckUtils]: 25: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7868#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:39:19,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {7868#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7872#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:39:19,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {7872#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7775#false} is VALID [2022-04-28 03:39:19,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {7775#false} assume !false; {7775#false} is VALID [2022-04-28 03:39:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:19,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:39:19,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {7775#false} assume !false; {7775#false} is VALID [2022-04-28 03:39:19,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {7872#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7775#false} is VALID [2022-04-28 03:39:19,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {7868#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7872#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:39:19,611 INFO L272 TraceCheckUtils]: 25: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7868#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:39:19,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:19,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:39:19,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {7785#(<= 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; {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {7784#(<= 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; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {7783#(<= 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; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:39:19,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {7782#(<= 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; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {7781#(<= 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; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {7780#(<= 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; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:19,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {7779#(<= 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; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:19,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {7774#true} [106] 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[] {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:39:19,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {7774#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_397 v_main_~x~0_396)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (mod v_main_~x~0_397 4294967296)) (.cse2 (= |v_main_#t~post6_104| |v_main_#t~post6_103|))) (or (and (= v_main_~y~0_320 v_main_~y~0_319) .cse0 .cse1 .cse2) (and (= v_main_~x~0_396 (+ v_main_~x~0_397 v_main_~y~0_320 (* (- 1) v_main_~y~0_319))) (< v_main_~y~0_320 v_main_~y~0_319) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_320 v_it_22 1) v_main_~y~0_319)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_397 (* 4294967295 v_it_22)) 4294967296)))) (< 0 .cse3)) (and .cse0 (= v_main_~y~0_319 v_main_~y~0_320) .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_320, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_319, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7774#true} is VALID [2022-04-28 03:39:19,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {7774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7774#true} is VALID [2022-04-28 03:39:19,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {7774#true} call #t~ret11 := main(); {7774#true} is VALID [2022-04-28 03:39:19,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7774#true} {7774#true} #61#return; {7774#true} is VALID [2022-04-28 03:39:19,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {7774#true} assume true; {7774#true} is VALID [2022-04-28 03:39:19,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {7774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7774#true} is VALID [2022-04-28 03:39:19,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {7774#true} call ULTIMATE.init(); {7774#true} is VALID [2022-04-28 03:39:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:19,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593731174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:39:19,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:39:19,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2022-04-28 03:39:20,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:20,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1951394323] [2022-04-28 03:39:20,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1951394323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:20,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:20,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:39:20,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807166252] [2022-04-28 03:39:20,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:20,501 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:39:20,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:20,502 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), 18 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:39:20,545 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:39:20,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:39:20,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:39:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:39:20,546 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 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:39:23,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:23,226 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-28 03:39:23,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:39:23,226 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:39:23,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 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:39:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2022-04-28 03:39:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 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:39:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2022-04-28 03:39:23,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 67 transitions. [2022-04-28 03:39:23,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:23,360 INFO L225 Difference]: With dead ends: 64 [2022-04-28 03:39:23,360 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:39:23,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=344, Invalid=1138, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:39:23,361 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:23,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 40 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:39:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:39:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2022-04-28 03:39:23,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:23,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,518 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,518 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:23,519 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 03:39:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 03:39:23,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:23,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:23,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 03:39:23,519 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 03:39:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:23,520 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-28 03:39:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-28 03:39:23,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:23,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:23,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:23,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 03:39:23,521 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2022-04-28 03:39:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:23,521 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 03:39:23,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 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:39:23,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 03:39:36,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 36 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 03:39:36,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:39:36,474 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:36,474 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:36,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-28 03:39:36,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:36,675 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:36,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash -858602802, now seen corresponding path program 20 times [2022-04-28 03:39:36,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:36,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1413304433] [2022-04-28 03:39:36,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:39:36,834 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:36,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1719415825, now seen corresponding path program 1 times [2022-04-28 03:39:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:36,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346421159] [2022-04-28 03:39:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:36,847 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:39:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:36,873 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:39:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:37,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {8349#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8328#true} is VALID [2022-04-28 03:39:37,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {8328#true} assume true; {8328#true} is VALID [2022-04-28 03:39:37,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8328#true} {8328#true} #61#return; {8328#true} is VALID [2022-04-28 03:39:37,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {8328#true} call ULTIMATE.init(); {8349#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:37,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {8349#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8328#true} is VALID [2022-04-28 03:39:37,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {8328#true} assume true; {8328#true} is VALID [2022-04-28 03:39:37,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8328#true} {8328#true} #61#return; {8328#true} is VALID [2022-04-28 03:39:37,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {8328#true} call #t~ret11 := main(); {8328#true} is VALID [2022-04-28 03:39:37,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {8328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8328#true} is VALID [2022-04-28 03:39:37,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {8328#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_438 4294967296)) (.cse0 (= v_main_~x~0_438 v_main_~x~0_437)) (.cse1 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse2 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_340 v_main_~y~0_339)) (and (= v_main_~x~0_437 (+ v_main_~x~0_438 v_main_~y~0_340 (* (- 1) v_main_~y~0_339))) (< 0 .cse3) (< v_main_~y~0_340 v_main_~y~0_339) (forall ((v_it_23 Int)) (or (not (<= (+ v_main_~y~0_340 v_it_23 1) v_main_~y~0_339)) (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_438 (* 4294967295 v_it_23)) 4294967296))))) (and (<= .cse3 0) .cse0 (= v_main_~y~0_339 v_main_~y~0_340) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_340, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_438, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_339, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_437, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8328#true} is VALID [2022-04-28 03:39:37,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {8328#true} [108] 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[] {8328#true} is VALID [2022-04-28 03:39:37,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {8328#true} ~z~0 := ~y~0; {8333#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:39:37,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {8333#(= 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; {8334#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:39:37,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {8334#(= (+ (- 1) 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; {8335#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:39:37,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {8335#(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; {8336#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:39:37,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {8336#(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; {8337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:39:37,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {8337#(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; {8338#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:39:37,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {8338#(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; {8339#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:39:37,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {8339#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8340#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:39:37,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {8340#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:37,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:39:37,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:37,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:37,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:37,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:37,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:39:37,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:39:37,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8329#false} is VALID [2022-04-28 03:39:37,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {8329#false} assume !(~y~0 % 4294967296 > 0); {8329#false} is VALID [2022-04-28 03:39:37,177 INFO L272 TraceCheckUtils]: 26: Hoare triple {8329#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8329#false} is VALID [2022-04-28 03:39:37,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {8329#false} ~cond := #in~cond; {8329#false} is VALID [2022-04-28 03:39:37,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {8329#false} assume 0 == ~cond; {8329#false} is VALID [2022-04-28 03:39:37,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {8329#false} assume !false; {8329#false} is VALID [2022-04-28 03:39:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:37,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:37,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346421159] [2022-04-28 03:39:37,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346421159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:39:37,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55084786] [2022-04-28 03:39:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:37,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:37,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:39:37,180 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:39:37,181 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:39:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:37,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 03:39:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:37,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:39:37,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {8328#true} call ULTIMATE.init(); {8328#true} is VALID [2022-04-28 03:39:37,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {8328#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8328#true} is VALID [2022-04-28 03:39:37,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {8328#true} assume true; {8328#true} is VALID [2022-04-28 03:39:37,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8328#true} {8328#true} #61#return; {8328#true} is VALID [2022-04-28 03:39:37,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {8328#true} call #t~ret11 := main(); {8328#true} is VALID [2022-04-28 03:39:37,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {8328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8328#true} is VALID [2022-04-28 03:39:37,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {8328#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_438 4294967296)) (.cse0 (= v_main_~x~0_438 v_main_~x~0_437)) (.cse1 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse2 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_340 v_main_~y~0_339)) (and (= v_main_~x~0_437 (+ v_main_~x~0_438 v_main_~y~0_340 (* (- 1) v_main_~y~0_339))) (< 0 .cse3) (< v_main_~y~0_340 v_main_~y~0_339) (forall ((v_it_23 Int)) (or (not (<= (+ v_main_~y~0_340 v_it_23 1) v_main_~y~0_339)) (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_438 (* 4294967295 v_it_23)) 4294967296))))) (and (<= .cse3 0) .cse0 (= v_main_~y~0_339 v_main_~y~0_340) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_340, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_438, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_339, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_437, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8328#true} is VALID [2022-04-28 03:39:37,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {8328#true} [108] 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[] {8328#true} is VALID [2022-04-28 03:39:37,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {8328#true} ~z~0 := ~y~0; {8333#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:39:37,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {8333#(= 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; {8334#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:39:37,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {8334#(= (+ (- 1) 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; {8335#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:39:37,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {8335#(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; {8336#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:39:37,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {8336#(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; {8337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:39:37,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {8337#(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; {8338#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:39:37,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {8338#(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; {8339#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:39:37,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {8339#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8340#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:39:37,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {8340#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:37,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:39:37,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:37,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:37,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:37,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:37,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:39:37,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:39:37,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8329#false} is VALID [2022-04-28 03:39:37,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {8329#false} assume !(~y~0 % 4294967296 > 0); {8329#false} is VALID [2022-04-28 03:39:37,625 INFO L272 TraceCheckUtils]: 26: Hoare triple {8329#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8329#false} is VALID [2022-04-28 03:39:37,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {8329#false} ~cond := #in~cond; {8329#false} is VALID [2022-04-28 03:39:37,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {8329#false} assume 0 == ~cond; {8329#false} is VALID [2022-04-28 03:39:37,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {8329#false} assume !false; {8329#false} is VALID [2022-04-28 03:39:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:37,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:39:38,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {8329#false} assume !false; {8329#false} is VALID [2022-04-28 03:39:38,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {8329#false} assume 0 == ~cond; {8329#false} is VALID [2022-04-28 03:39:38,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {8329#false} ~cond := #in~cond; {8329#false} is VALID [2022-04-28 03:39:38,200 INFO L272 TraceCheckUtils]: 26: Hoare triple {8329#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8329#false} is VALID [2022-04-28 03:39:38,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {8329#false} assume !(~y~0 % 4294967296 > 0); {8329#false} is VALID [2022-04-28 03:39:38,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8329#false} is VALID [2022-04-28 03:39:38,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:39:38,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:39:38,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:38,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:38,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:38,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:38,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:39:38,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {8479#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:38,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {8483#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~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; {8479#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:38,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {8487#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~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; {8483#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:38,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {8491#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~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; {8487#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:38,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {8495#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~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; {8491#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:38,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {8499#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~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; {8495#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:38,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {8503#(or (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8499#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:38,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {8507#(or (< 0 (mod (+ main_~z~0 4294967289) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~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; {8503#(or (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:39:38,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {8328#true} ~z~0 := ~y~0; {8507#(or (< 0 (mod (+ main_~z~0 4294967289) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:38,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {8328#true} [108] 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[] {8328#true} is VALID [2022-04-28 03:39:38,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {8328#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_438 4294967296)) (.cse0 (= v_main_~x~0_438 v_main_~x~0_437)) (.cse1 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse2 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_340 v_main_~y~0_339)) (and (= v_main_~x~0_437 (+ v_main_~x~0_438 v_main_~y~0_340 (* (- 1) v_main_~y~0_339))) (< 0 .cse3) (< v_main_~y~0_340 v_main_~y~0_339) (forall ((v_it_23 Int)) (or (not (<= (+ v_main_~y~0_340 v_it_23 1) v_main_~y~0_339)) (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_438 (* 4294967295 v_it_23)) 4294967296))))) (and (<= .cse3 0) .cse0 (= v_main_~y~0_339 v_main_~y~0_340) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_340, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_438, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_339, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_437, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8328#true} is VALID [2022-04-28 03:39:38,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {8328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8328#true} is VALID [2022-04-28 03:39:38,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {8328#true} call #t~ret11 := main(); {8328#true} is VALID [2022-04-28 03:39:38,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8328#true} {8328#true} #61#return; {8328#true} is VALID [2022-04-28 03:39:38,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {8328#true} assume true; {8328#true} is VALID [2022-04-28 03:39:38,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {8328#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8328#true} is VALID [2022-04-28 03:39:38,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {8328#true} call ULTIMATE.init(); {8328#true} is VALID [2022-04-28 03:39:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:38,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55084786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:39:38,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:39:38,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 27 [2022-04-28 03:39:39,272 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:39,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1413304433] [2022-04-28 03:39:39,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1413304433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:39,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:39,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:39:39,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427623009] [2022-04-28 03:39:39,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:39,273 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 03:39:39,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:39,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:39,363 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:39:39,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:39:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:39,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:39:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:39:39,364 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:47,165 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-04-28 03:39:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:39:47,165 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 03:39:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2022-04-28 03:39:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2022-04-28 03:39:47,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 61 transitions. [2022-04-28 03:39:47,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:47,466 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:39:47,466 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 03:39:47,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=477, Invalid=3813, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 03:39:47,468 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:47,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 108 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:39:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 03:39:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 03:39:47,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:47,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 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:39:47,637 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 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:39:47,638 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 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:39:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:47,638 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-28 03:39:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-28 03:39:47,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:47,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:47,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 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 38 states. [2022-04-28 03:39:47,639 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 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 38 states. [2022-04-28 03:39:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:47,640 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-28 03:39:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-28 03:39:47,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:47,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:47,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:47,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:47,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 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:39:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-04-28 03:39:47,641 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36 [2022-04-28 03:39:47,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:47,641 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-04-28 03:39:47,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:47,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2022-04-28 03:40:04,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 32 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-28 03:40:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-28 03:40:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:40:04,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:40:04,187 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:40:04,203 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:40:04,388 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,SelfDestructingSolverStorable24 [2022-04-28 03:40:04,388 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:40:04,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:40:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash 843169312, now seen corresponding path program 21 times [2022-04-28 03:40:04,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:04,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1730833198] [2022-04-28 03:40:04,565 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:40:04,566 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:40:04,568 INFO L85 PathProgramCache]: Analyzing trace with hash -855745824, now seen corresponding path program 1 times [2022-04-28 03:40:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:40:04,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593010986] [2022-04-28 03:40:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:40:04,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:40:04,577 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:40:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:04,605 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:40:04,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:40:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:04,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {8922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8901#true} is VALID [2022-04-28 03:40:04,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {8901#true} assume true; {8901#true} is VALID [2022-04-28 03:40:04,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8901#true} {8901#true} #61#return; {8901#true} is VALID [2022-04-28 03:40:04,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {8901#true} call ULTIMATE.init(); {8922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:40:04,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {8922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8901#true} is VALID [2022-04-28 03:40:04,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {8901#true} assume true; {8901#true} is VALID [2022-04-28 03:40:04,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8901#true} {8901#true} #61#return; {8901#true} is VALID [2022-04-28 03:40:04,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {8901#true} call #t~ret11 := main(); {8901#true} is VALID [2022-04-28 03:40:04,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {8901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8901#true} is VALID [2022-04-28 03:40:04,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {8901#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_467 4294967296)) (.cse1 (= v_main_~x~0_467 v_main_~x~0_466)) (.cse2 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse3 (= |v_main_#t~post6_114| |v_main_#t~post6_113|))) (or (and (forall ((v_it_24 Int)) (or (not (<= (+ v_main_~y~0_370 v_it_24 1) v_main_~y~0_369)) (< 0 (mod (+ v_main_~x~0_467 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)))) (= v_main_~x~0_466 (+ v_main_~x~0_467 (* (- 1) v_main_~y~0_369) v_main_~y~0_370)) (< v_main_~y~0_370 v_main_~y~0_369) (< 0 .cse0)) (and (<= .cse0 0) .cse1 (= v_main_~y~0_369 v_main_~y~0_370) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= v_main_~y~0_370 v_main_~y~0_369)))) InVars {main_~y~0=v_main_~y~0_370, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_467, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_369, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_466, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8901#true} is VALID [2022-04-28 03:40:04,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {8901#true} [110] 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[] {8901#true} is VALID [2022-04-28 03:40:04,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {8901#true} ~z~0 := ~y~0; {8906#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:40:04,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {8906#(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; {8907#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:40:04,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {8907#(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; {8908#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:40:04,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {8908#(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; {8909#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:40:04,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {8909#(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; {8910#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:40:04,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {8910#(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; {8911#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:40:04,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {8911#(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; {8912#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:40:04,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {8912#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8913#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:40:04,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {8913#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:04,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:04,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:40:04,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:40:04,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:40:04,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:40:04,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:40:04,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:40:04,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:40:04,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8902#false} is VALID [2022-04-28 03:40:04,904 INFO L272 TraceCheckUtils]: 26: Hoare triple {8902#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8902#false} is VALID [2022-04-28 03:40:04,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {8902#false} ~cond := #in~cond; {8902#false} is VALID [2022-04-28 03:40:04,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {8902#false} assume 0 == ~cond; {8902#false} is VALID [2022-04-28 03:40:04,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {8902#false} assume !false; {8902#false} is VALID [2022-04-28 03:40:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:40:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:40:04,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593010986] [2022-04-28 03:40:04,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593010986] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:40:04,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912886995] [2022-04-28 03:40:04,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:40:04,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:40:04,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:40:04,908 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:40:04,918 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:40:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:04,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:40:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:04,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:40:05,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {8901#true} call ULTIMATE.init(); {8901#true} is VALID [2022-04-28 03:40:05,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {8901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8901#true} is VALID [2022-04-28 03:40:05,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {8901#true} assume true; {8901#true} is VALID [2022-04-28 03:40:05,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8901#true} {8901#true} #61#return; {8901#true} is VALID [2022-04-28 03:40:05,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {8901#true} call #t~ret11 := main(); {8901#true} is VALID [2022-04-28 03:40:05,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {8901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8901#true} is VALID [2022-04-28 03:40:05,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {8901#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_467 4294967296)) (.cse1 (= v_main_~x~0_467 v_main_~x~0_466)) (.cse2 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse3 (= |v_main_#t~post6_114| |v_main_#t~post6_113|))) (or (and (forall ((v_it_24 Int)) (or (not (<= (+ v_main_~y~0_370 v_it_24 1) v_main_~y~0_369)) (< 0 (mod (+ v_main_~x~0_467 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)))) (= v_main_~x~0_466 (+ v_main_~x~0_467 (* (- 1) v_main_~y~0_369) v_main_~y~0_370)) (< v_main_~y~0_370 v_main_~y~0_369) (< 0 .cse0)) (and (<= .cse0 0) .cse1 (= v_main_~y~0_369 v_main_~y~0_370) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= v_main_~y~0_370 v_main_~y~0_369)))) InVars {main_~y~0=v_main_~y~0_370, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_467, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_369, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_466, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8901#true} is VALID [2022-04-28 03:40:05,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {8901#true} [110] 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[] {8901#true} is VALID [2022-04-28 03:40:05,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {8901#true} ~z~0 := ~y~0; {8906#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:40:05,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {8906#(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; {8907#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:40:05,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {8907#(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; {8908#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:40:05,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {8908#(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; {8909#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:40:05,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {8909#(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; {8910#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:40:05,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {8910#(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; {8911#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:40:05,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {8911#(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; {8912#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:40:05,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {8912#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8913#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:40:05,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {8913#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:05,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:05,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:40:05,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:40:05,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:40:05,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:40:05,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:40:05,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:40:05,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:40:05,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8902#false} is VALID [2022-04-28 03:40:05,435 INFO L272 TraceCheckUtils]: 26: Hoare triple {8902#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8902#false} is VALID [2022-04-28 03:40:05,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {8902#false} ~cond := #in~cond; {8902#false} is VALID [2022-04-28 03:40:05,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {8902#false} assume 0 == ~cond; {8902#false} is VALID [2022-04-28 03:40:05,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {8902#false} assume !false; {8902#false} is VALID [2022-04-28 03:40:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:40:05,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:40:05,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {8902#false} assume !false; {8902#false} is VALID [2022-04-28 03:40:05,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {8902#false} assume 0 == ~cond; {8902#false} is VALID [2022-04-28 03:40:05,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {8902#false} ~cond := #in~cond; {8902#false} is VALID [2022-04-28 03:40:05,956 INFO L272 TraceCheckUtils]: 26: Hoare triple {8902#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8902#false} is VALID [2022-04-28 03:40:05,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8902#false} is VALID [2022-04-28 03:40:05,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:40:05,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:40:05,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:40:05,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:40:05,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:40:05,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:40:05,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:40:05,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:05,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {9052#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:05,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {9056#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9052#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:40:05,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {9060#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9056#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:40:05,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {9064#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9060#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:40:05,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {9068#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9064#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:40:05,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {9072#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9068#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:40:05,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {9076#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9072#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:40:05,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {9080#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9076#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:40:05,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {8901#true} ~z~0 := ~y~0; {9080#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 03:40:05,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {8901#true} [110] 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[] {8901#true} is VALID [2022-04-28 03:40:05,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {8901#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_467 4294967296)) (.cse1 (= v_main_~x~0_467 v_main_~x~0_466)) (.cse2 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse3 (= |v_main_#t~post6_114| |v_main_#t~post6_113|))) (or (and (forall ((v_it_24 Int)) (or (not (<= (+ v_main_~y~0_370 v_it_24 1) v_main_~y~0_369)) (< 0 (mod (+ v_main_~x~0_467 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)))) (= v_main_~x~0_466 (+ v_main_~x~0_467 (* (- 1) v_main_~y~0_369) v_main_~y~0_370)) (< v_main_~y~0_370 v_main_~y~0_369) (< 0 .cse0)) (and (<= .cse0 0) .cse1 (= v_main_~y~0_369 v_main_~y~0_370) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= v_main_~y~0_370 v_main_~y~0_369)))) InVars {main_~y~0=v_main_~y~0_370, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_467, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_369, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_466, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8901#true} is VALID [2022-04-28 03:40:05,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {8901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8901#true} is VALID [2022-04-28 03:40:05,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {8901#true} call #t~ret11 := main(); {8901#true} is VALID [2022-04-28 03:40:05,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8901#true} {8901#true} #61#return; {8901#true} is VALID [2022-04-28 03:40:05,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {8901#true} assume true; {8901#true} is VALID [2022-04-28 03:40:05,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {8901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8901#true} is VALID [2022-04-28 03:40:05,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {8901#true} call ULTIMATE.init(); {8901#true} is VALID [2022-04-28 03:40:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:40:05,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912886995] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:40:05,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:40:05,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 27 [2022-04-28 03:40:07,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:40:07,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1730833198] [2022-04-28 03:40:07,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1730833198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:40:07,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:40:07,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 03:40:07,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482205957] [2022-04-28 03:40:07,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:40:07,573 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 03:40:07,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:40:07,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:08,355 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:40:08,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 03:40:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:08,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 03:40:08,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1079, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:40:08,357 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:25,558 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 03:40:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:40:25,559 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 03:40:25,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:40:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2022-04-28 03:40:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2022-04-28 03:40:25,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 46 transitions. [2022-04-28 03:40:27,174 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:40:27,174 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:40:27,174 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 03:40:27,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=491, Invalid=3049, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:40:27,176 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:40:27,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 111 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 03:40:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 03:40:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 03:40:27,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:40:27,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:27,341 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:27,341 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:27,341 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 03:40:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 03:40:27,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:40:27,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:40:27,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 03:40:27,342 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 03:40:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:27,343 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-28 03:40:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 03:40:27,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:40:27,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:40:27,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:40:27,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:40:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-28 03:40:27,344 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37 [2022-04-28 03:40:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:40:27,344 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-28 03:40:27,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:27,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-28 03:40:42,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 34 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-28 03:40:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 03:40:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 03:40:42,579 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:40:42,579 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:40:42,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 03:40:42,779 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,SelfDestructingSolverStorable25 [2022-04-28 03:40:42,780 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:40:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:40:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 22 times [2022-04-28 03:40:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:42,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1301401097] [2022-04-28 03:40:44,936 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:40:44,938 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:40:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash -717286579, now seen corresponding path program 1 times [2022-04-28 03:40:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:40:44,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53939344] [2022-04-28 03:40:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:40:44,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:40:44,954 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:40:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:44,971 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:40:45,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:40:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:45,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {9430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9414#true} is VALID [2022-04-28 03:40:45,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {9414#true} assume true; {9414#true} is VALID [2022-04-28 03:40:45,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9414#true} {9414#true} #61#return; {9414#true} is VALID [2022-04-28 03:40:45,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {9414#true} call ULTIMATE.init(); {9430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:40:45,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {9430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9414#true} is VALID [2022-04-28 03:40:45,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {9414#true} assume true; {9414#true} is VALID [2022-04-28 03:40:45,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9414#true} {9414#true} #61#return; {9414#true} is VALID [2022-04-28 03:40:45,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {9414#true} call #t~ret11 := main(); {9414#true} is VALID [2022-04-28 03:40:45,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {9414#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9414#true} is VALID [2022-04-28 03:40:45,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {9414#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_398 v_main_~y~0_397)) (.cse1 (= |v_main_#t~post5_119| |v_main_#t~post5_118|)) (.cse3 (= v_main_~x~0_496 v_main_~x~0_495)) (.cse2 (mod v_main_~x~0_496 4294967296))) (or (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) .cse0 .cse1 (<= .cse2 0) .cse3) (and .cse0 .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_118|) .cse3) (and (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_496 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~y~0_398 v_it_25 1) v_main_~y~0_397)) (not (<= 1 v_it_25)))) (< 0 .cse2) (< v_main_~y~0_398 v_main_~y~0_397) (= v_main_~x~0_495 (+ v_main_~x~0_496 v_main_~y~0_398 (* (- 1) v_main_~y~0_397)))))) InVars {main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_495, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9414#true} is VALID [2022-04-28 03:40:45,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {9414#true} [112] 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[] {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {9419#(<= 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; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:40:45,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {9420#(<= 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; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {9421#(<= 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; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {9422#(<= 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; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {9423#(<= 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; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:40:45,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {9424#(<= 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; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {9425#(<= 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; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {9426#(<= 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; {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:40:45,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:40:45,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,188 INFO L272 TraceCheckUtils]: 27: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:40:45,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {9428#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9429#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:40:45,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {9429#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9415#false} is VALID [2022-04-28 03:40:45,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {9415#false} assume !false; {9415#false} is VALID [2022-04-28 03:40:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:40:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:40:45,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53939344] [2022-04-28 03:40:45,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53939344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:40:45,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289354262] [2022-04-28 03:40:45,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:40:45,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:40:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:40:45,192 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:40:45,196 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:40:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:45,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:40:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:45,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:40:45,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {9414#true} call ULTIMATE.init(); {9414#true} is VALID [2022-04-28 03:40:45,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {9414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9414#true} is VALID [2022-04-28 03:40:45,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {9414#true} assume true; {9414#true} is VALID [2022-04-28 03:40:45,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9414#true} {9414#true} #61#return; {9414#true} is VALID [2022-04-28 03:40:45,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {9414#true} call #t~ret11 := main(); {9414#true} is VALID [2022-04-28 03:40:45,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {9414#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9414#true} is VALID [2022-04-28 03:40:45,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {9414#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_398 v_main_~y~0_397)) (.cse1 (= |v_main_#t~post5_119| |v_main_#t~post5_118|)) (.cse3 (= v_main_~x~0_496 v_main_~x~0_495)) (.cse2 (mod v_main_~x~0_496 4294967296))) (or (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) .cse0 .cse1 (<= .cse2 0) .cse3) (and .cse0 .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_118|) .cse3) (and (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_496 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~y~0_398 v_it_25 1) v_main_~y~0_397)) (not (<= 1 v_it_25)))) (< 0 .cse2) (< v_main_~y~0_398 v_main_~y~0_397) (= v_main_~x~0_495 (+ v_main_~x~0_496 v_main_~y~0_398 (* (- 1) v_main_~y~0_397)))))) InVars {main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_495, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9414#true} is VALID [2022-04-28 03:40:45,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {9414#true} [112] 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[] {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {9419#(<= 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; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:40:45,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {9420#(<= 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; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {9421#(<= 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; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {9422#(<= 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; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {9423#(<= 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; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:40:45,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {9424#(<= 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; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {9425#(<= 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; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {9426#(<= 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; {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:40:45,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:40:45,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,545 INFO L272 TraceCheckUtils]: 27: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:40:45,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {9515#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:40:45,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {9519#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9415#false} is VALID [2022-04-28 03:40:45,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {9415#false} assume !false; {9415#false} is VALID [2022-04-28 03:40:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:40:45,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:40:45,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {9415#false} assume !false; {9415#false} is VALID [2022-04-28 03:40:45,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {9519#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9415#false} is VALID [2022-04-28 03:40:45,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {9515#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:40:45,843 INFO L272 TraceCheckUtils]: 27: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:40:45,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:40:45,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:40:45,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {9426#(<= 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; {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {9425#(<= 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; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {9424#(<= 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; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {9423#(<= 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; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:40:45,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {9422#(<= 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; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {9421#(<= 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; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {9420#(<= 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; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:45,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {9419#(<= 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; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:40:45,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {9414#true} [112] 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[] {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:45,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {9414#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_398 v_main_~y~0_397)) (.cse1 (= |v_main_#t~post5_119| |v_main_#t~post5_118|)) (.cse3 (= v_main_~x~0_496 v_main_~x~0_495)) (.cse2 (mod v_main_~x~0_496 4294967296))) (or (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) .cse0 .cse1 (<= .cse2 0) .cse3) (and .cse0 .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_118|) .cse3) (and (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_496 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~y~0_398 v_it_25 1) v_main_~y~0_397)) (not (<= 1 v_it_25)))) (< 0 .cse2) (< v_main_~y~0_398 v_main_~y~0_397) (= v_main_~x~0_495 (+ v_main_~x~0_496 v_main_~y~0_398 (* (- 1) v_main_~y~0_397)))))) InVars {main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_495, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9414#true} is VALID [2022-04-28 03:40:45,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {9414#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9414#true} is VALID [2022-04-28 03:40:45,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {9414#true} call #t~ret11 := main(); {9414#true} is VALID [2022-04-28 03:40:45,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9414#true} {9414#true} #61#return; {9414#true} is VALID [2022-04-28 03:40:45,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {9414#true} assume true; {9414#true} is VALID [2022-04-28 03:40:45,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {9414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9414#true} is VALID [2022-04-28 03:40:45,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {9414#true} call ULTIMATE.init(); {9414#true} is VALID [2022-04-28 03:40:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:40:45,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289354262] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:40:45,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:40:45,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2022-04-28 03:40:46,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:40:46,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1301401097] [2022-04-28 03:40:46,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1301401097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:40:46,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:40:46,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:40:46,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062044851] [2022-04-28 03:40:46,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:40:46,921 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 03:40:46,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:40:46,921 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), 20 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:40:47,044 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:40:47,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:40:47,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:47,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:40:47,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:40:47,045 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 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:40:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:52,429 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-04-28 03:40:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:40:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 03:40:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:40:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 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:40:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-28 03:40:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 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:40:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-28 03:40:52,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 73 transitions. [2022-04-28 03:40:52,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:40:52,593 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:40:52,593 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:40:52,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:40:52,594 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:40:52,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 35 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:40:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:40:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2022-04-28 03:40:52,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:40:52,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:52,785 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:52,785 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:52,786 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 03:40:52,786 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 03:40:52,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:40:52,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:40:52,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 03:40:52,787 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 03:40:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:52,788 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 03:40:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 03:40:52,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:40:52,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:40:52,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:40:52,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:40:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:40:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-04-28 03:40:52,789 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2022-04-28 03:40:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:40:52,789 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-04-28 03:40:52,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 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:40:52,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 44 transitions. [2022-04-28 03:41:08,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 37 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-28 03:41:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:41:08,185 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:08,185 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:08,201 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:41:08,385 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,SelfDestructingSolverStorable26 [2022-04-28 03:41:08,385 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash -359267392, now seen corresponding path program 23 times [2022-04-28 03:41:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:08,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [884453366] [2022-04-28 03:41:10,501 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:41:10,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:41:10,613 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:10,615 INFO L85 PathProgramCache]: Analyzing trace with hash -523964160, now seen corresponding path program 1 times [2022-04-28 03:41:10,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:10,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787814241] [2022-04-28 03:41:10,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:10,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:10,627 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:41:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:10,656 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:41:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:11,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {10039#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10016#true} is VALID [2022-04-28 03:41:11,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {10016#true} assume true; {10016#true} is VALID [2022-04-28 03:41:11,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10016#true} {10016#true} #61#return; {10016#true} is VALID [2022-04-28 03:41:11,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {10016#true} call ULTIMATE.init(); {10039#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:11,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {10039#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10016#true} is VALID [2022-04-28 03:41:11,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {10016#true} assume true; {10016#true} is VALID [2022-04-28 03:41:11,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10016#true} {10016#true} #61#return; {10016#true} is VALID [2022-04-28 03:41:11,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {10016#true} call #t~ret11 := main(); {10016#true} is VALID [2022-04-28 03:41:11,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {10016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10016#true} is VALID [2022-04-28 03:41:11,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {10016#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_542 v_main_~x~0_541)) (.cse1 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse2 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (mod v_main_~x~0_542 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_420 v_main_~y~0_419)) (and .cse0 .cse1 .cse2 (<= .cse3 0) (= v_main_~y~0_419 v_main_~y~0_420)) (and (= v_main_~y~0_419 (+ v_main_~x~0_542 v_main_~y~0_420 (* v_main_~x~0_541 (- 1)))) (< v_main_~x~0_541 v_main_~x~0_542) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_541 v_it_26 1) v_main_~x~0_542)) (< 0 (mod (+ v_main_~x~0_542 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26)))) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_542, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_419, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_541, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10016#true} is VALID [2022-04-28 03:41:11,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {10016#true} [114] 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[] {10016#true} is VALID [2022-04-28 03:41:11,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {10016#true} ~z~0 := ~y~0; {10021#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:11,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {10021#(= (+ 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; {10022#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:11,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {10022#(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; {10023#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:41:11,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {10023#(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; {10024#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:41:11,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {10024#(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; {10025#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:41:11,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {10025#(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; {10026#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:41:11,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {10026#(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; {10027#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:41:11,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {10027#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10028#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:41:11,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {10028#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10029#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:41:11,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {10029#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:41:11,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:11,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:41:11,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:11,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:11,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:11,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:11,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:11,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:11,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10017#false} is VALID [2022-04-28 03:41:11,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {10017#false} assume !(~y~0 % 4294967296 > 0); {10017#false} is VALID [2022-04-28 03:41:11,027 INFO L272 TraceCheckUtils]: 28: Hoare triple {10017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10017#false} is VALID [2022-04-28 03:41:11,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {10017#false} ~cond := #in~cond; {10017#false} is VALID [2022-04-28 03:41:11,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {10017#false} assume 0 == ~cond; {10017#false} is VALID [2022-04-28 03:41:11,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {10017#false} assume !false; {10017#false} is VALID [2022-04-28 03:41:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:11,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787814241] [2022-04-28 03:41:11,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787814241] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:11,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035053619] [2022-04-28 03:41:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:11,029 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:41:11,029 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:41:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:11,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 03:41:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:11,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:11,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {10016#true} call ULTIMATE.init(); {10016#true} is VALID [2022-04-28 03:41:11,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {10016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10016#true} is VALID [2022-04-28 03:41:11,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {10016#true} assume true; {10016#true} is VALID [2022-04-28 03:41:11,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10016#true} {10016#true} #61#return; {10016#true} is VALID [2022-04-28 03:41:11,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {10016#true} call #t~ret11 := main(); {10016#true} is VALID [2022-04-28 03:41:11,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {10016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10016#true} is VALID [2022-04-28 03:41:11,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {10016#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_542 v_main_~x~0_541)) (.cse1 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse2 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (mod v_main_~x~0_542 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_420 v_main_~y~0_419)) (and .cse0 .cse1 .cse2 (<= .cse3 0) (= v_main_~y~0_419 v_main_~y~0_420)) (and (= v_main_~y~0_419 (+ v_main_~x~0_542 v_main_~y~0_420 (* v_main_~x~0_541 (- 1)))) (< v_main_~x~0_541 v_main_~x~0_542) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_541 v_it_26 1) v_main_~x~0_542)) (< 0 (mod (+ v_main_~x~0_542 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26)))) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_542, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_419, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_541, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10016#true} is VALID [2022-04-28 03:41:11,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {10016#true} [114] 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[] {10016#true} is VALID [2022-04-28 03:41:11,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {10016#true} ~z~0 := ~y~0; {10021#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:11,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {10021#(= (+ 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; {10022#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:11,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {10022#(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; {10023#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:41:11,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {10023#(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; {10024#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:41:11,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {10024#(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; {10025#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:41:11,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {10025#(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; {10026#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:41:11,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {10026#(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; {10027#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:41:11,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {10027#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10028#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:41:11,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {10028#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10029#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:41:11,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {10029#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:41:11,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:11,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:41:11,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:11,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:11,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:11,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:11,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:11,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:11,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10017#false} is VALID [2022-04-28 03:41:11,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {10017#false} assume !(~y~0 % 4294967296 > 0); {10017#false} is VALID [2022-04-28 03:41:11,476 INFO L272 TraceCheckUtils]: 28: Hoare triple {10017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10017#false} is VALID [2022-04-28 03:41:11,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {10017#false} ~cond := #in~cond; {10017#false} is VALID [2022-04-28 03:41:11,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {10017#false} assume 0 == ~cond; {10017#false} is VALID [2022-04-28 03:41:11,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {10017#false} assume !false; {10017#false} is VALID [2022-04-28 03:41:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:11,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:12,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {10017#false} assume !false; {10017#false} is VALID [2022-04-28 03:41:12,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {10017#false} assume 0 == ~cond; {10017#false} is VALID [2022-04-28 03:41:12,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {10017#false} ~cond := #in~cond; {10017#false} is VALID [2022-04-28 03:41:12,040 INFO L272 TraceCheckUtils]: 28: Hoare triple {10017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10017#false} is VALID [2022-04-28 03:41:12,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {10017#false} assume !(~y~0 % 4294967296 > 0); {10017#false} is VALID [2022-04-28 03:41:12,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10017#false} is VALID [2022-04-28 03:41:12,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:12,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:12,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:12,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:12,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:12,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:12,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:41:12,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:12,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {10178#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} assume !(~z~0 % 4294967296 > 0); {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:41:12,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {10182#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 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; {10178#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-28 03:41:12,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {10186#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10182#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:41:12,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {10190#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 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; {10186#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-28 03:41:12,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {10194#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10190#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:41:12,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {10198#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10194#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-28 03:41:12,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {10202#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 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; {10198#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-28 03:41:12,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {10206#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10202#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:41:12,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {10210#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10206#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 03:41:12,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {10016#true} ~z~0 := ~y~0; {10210#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:41:12,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {10016#true} [114] 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[] {10016#true} is VALID [2022-04-28 03:41:12,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {10016#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_542 v_main_~x~0_541)) (.cse1 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse2 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (mod v_main_~x~0_542 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_420 v_main_~y~0_419)) (and .cse0 .cse1 .cse2 (<= .cse3 0) (= v_main_~y~0_419 v_main_~y~0_420)) (and (= v_main_~y~0_419 (+ v_main_~x~0_542 v_main_~y~0_420 (* v_main_~x~0_541 (- 1)))) (< v_main_~x~0_541 v_main_~x~0_542) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_541 v_it_26 1) v_main_~x~0_542)) (< 0 (mod (+ v_main_~x~0_542 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26)))) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_542, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_419, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_541, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10016#true} is VALID [2022-04-28 03:41:12,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {10016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10016#true} is VALID [2022-04-28 03:41:12,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {10016#true} call #t~ret11 := main(); {10016#true} is VALID [2022-04-28 03:41:12,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10016#true} {10016#true} #61#return; {10016#true} is VALID [2022-04-28 03:41:12,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {10016#true} assume true; {10016#true} is VALID [2022-04-28 03:41:12,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {10016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10016#true} is VALID [2022-04-28 03:41:12,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {10016#true} call ULTIMATE.init(); {10016#true} is VALID [2022-04-28 03:41:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:12,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035053619] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:12,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:12,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 30 [2022-04-28 03:41:14,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:14,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [884453366] [2022-04-28 03:41:14,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [884453366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:14,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:14,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 03:41:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077235467] [2022-04-28 03:41:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:14,294 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 03:41:14,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:14,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:14,336 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:41:14,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 03:41:14,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:14,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 03:41:14,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1287, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 03:41:14,337 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:27,963 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-04-28 03:41:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 03:41:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 03:41:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2022-04-28 03:41:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2022-04-28 03:41:27,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 65 transitions. [2022-04-28 03:41:28,272 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:28,273 INFO L225 Difference]: With dead ends: 75 [2022-04-28 03:41:28,273 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:41:28,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=572, Invalid=4830, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 03:41:28,275 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:28,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 123 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 03:41:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:41:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 03:41:28,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:28,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 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:28,466 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 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:28,466 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 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:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:28,467 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-28 03:41:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-28 03:41:28,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:28,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:28,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 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 41 states. [2022-04-28 03:41:28,467 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 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 41 states. [2022-04-28 03:41:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:28,468 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-28 03:41:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-28 03:41:28,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:28,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:28,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:28,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 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:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-28 03:41:28,470 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 39 [2022-04-28 03:41:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:28,470 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-28 03:41:28,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:28,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-28 03:41:46,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 35 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-28 03:41:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 03:41:46,849 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:46,849 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:46,867 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:41:47,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:47,050 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash -416379154, now seen corresponding path program 24 times [2022-04-28 03:41:47,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:47,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1218395798] [2022-04-28 03:41:49,247 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:49,249 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash 676055215, now seen corresponding path program 1 times [2022-04-28 03:41:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:49,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446144593] [2022-04-28 03:41:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:49,263 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:41:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:49,290 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:41:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:49,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {10660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10637#true} is VALID [2022-04-28 03:41:49,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {10637#true} assume true; {10637#true} is VALID [2022-04-28 03:41:49,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10637#true} {10637#true} #61#return; {10637#true} is VALID [2022-04-28 03:41:49,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {10637#true} call ULTIMATE.init(); {10660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:49,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10637#true} is VALID [2022-04-28 03:41:49,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {10637#true} assume true; {10637#true} is VALID [2022-04-28 03:41:49,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10637#true} {10637#true} #61#return; {10637#true} is VALID [2022-04-28 03:41:49,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {10637#true} call #t~ret11 := main(); {10637#true} is VALID [2022-04-28 03:41:49,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {10637#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10637#true} is VALID [2022-04-28 03:41:49,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {10637#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_453 v_main_~y~0_452)) (.cse3 (= v_main_~x~0_574 v_main_~x~0_573)) (.cse4 (mod v_main_~x~0_574 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_27 Int)) (or (not (<= (+ v_main_~y~0_453 v_it_27 1) v_main_~y~0_452)) (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_574 (* 4294967295 v_it_27)) 4294967296)))) (< v_main_~y~0_453 v_main_~y~0_452) (= v_main_~x~0_573 (+ v_main_~x~0_574 v_main_~y~0_453 (* (- 1) v_main_~y~0_452))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_574, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_452, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_573, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10637#true} is VALID [2022-04-28 03:41:49,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {10637#true} [116] 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[] {10637#true} is VALID [2022-04-28 03:41:49,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {10637#true} ~z~0 := ~y~0; {10642#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:41:49,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {10642#(= 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; {10643#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:41:49,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {10643#(= (+ (- 1) 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; {10644#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:41:49,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {10644#(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; {10645#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:41:49,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {10645#(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; {10646#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:41:49,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {10646#(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; {10647#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:41:49,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {10647#(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; {10648#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:41:49,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {10648#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10649#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:41:49,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {10649#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10650#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:41:49,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {10650#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:49,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:49,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:49,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:41:49,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:41:49,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:41:49,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:41:49,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:41:49,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:49,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:49,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10638#false} is VALID [2022-04-28 03:41:49,641 INFO L272 TraceCheckUtils]: 28: Hoare triple {10638#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10638#false} is VALID [2022-04-28 03:41:49,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {10638#false} ~cond := #in~cond; {10638#false} is VALID [2022-04-28 03:41:49,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {10638#false} assume 0 == ~cond; {10638#false} is VALID [2022-04-28 03:41:49,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {10638#false} assume !false; {10638#false} is VALID [2022-04-28 03:41:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:49,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446144593] [2022-04-28 03:41:49,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446144593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:49,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833376920] [2022-04-28 03:41:49,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:49,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:49,642 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:41:49,643 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:41:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:49,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:41:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:49,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:50,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {10637#true} call ULTIMATE.init(); {10637#true} is VALID [2022-04-28 03:41:50,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {10637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10637#true} is VALID [2022-04-28 03:41:50,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {10637#true} assume true; {10637#true} is VALID [2022-04-28 03:41:50,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10637#true} {10637#true} #61#return; {10637#true} is VALID [2022-04-28 03:41:50,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {10637#true} call #t~ret11 := main(); {10637#true} is VALID [2022-04-28 03:41:50,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {10637#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10637#true} is VALID [2022-04-28 03:41:50,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {10637#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_453 v_main_~y~0_452)) (.cse3 (= v_main_~x~0_574 v_main_~x~0_573)) (.cse4 (mod v_main_~x~0_574 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_27 Int)) (or (not (<= (+ v_main_~y~0_453 v_it_27 1) v_main_~y~0_452)) (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_574 (* 4294967295 v_it_27)) 4294967296)))) (< v_main_~y~0_453 v_main_~y~0_452) (= v_main_~x~0_573 (+ v_main_~x~0_574 v_main_~y~0_453 (* (- 1) v_main_~y~0_452))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_574, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_452, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_573, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10637#true} is VALID [2022-04-28 03:41:50,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {10637#true} [116] 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[] {10637#true} is VALID [2022-04-28 03:41:50,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {10637#true} ~z~0 := ~y~0; {10642#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:41:50,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {10642#(= 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; {10643#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:41:50,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {10643#(= (+ (- 1) 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; {10644#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:41:50,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {10644#(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; {10645#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:41:50,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {10645#(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; {10646#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:41:50,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {10646#(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; {10647#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:41:50,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {10647#(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; {10648#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:41:50,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {10648#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10649#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:41:50,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {10649#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10650#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:41:50,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {10650#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:50,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:50,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:50,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:41:50,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:41:50,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:41:50,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:41:50,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:41:50,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:50,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:50,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10638#false} is VALID [2022-04-28 03:41:50,134 INFO L272 TraceCheckUtils]: 28: Hoare triple {10638#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10638#false} is VALID [2022-04-28 03:41:50,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {10638#false} ~cond := #in~cond; {10638#false} is VALID [2022-04-28 03:41:50,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {10638#false} assume 0 == ~cond; {10638#false} is VALID [2022-04-28 03:41:50,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {10638#false} assume !false; {10638#false} is VALID [2022-04-28 03:41:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:50,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:50,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {10638#false} assume !false; {10638#false} is VALID [2022-04-28 03:41:50,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {10638#false} assume 0 == ~cond; {10638#false} is VALID [2022-04-28 03:41:50,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {10638#false} ~cond := #in~cond; {10638#false} is VALID [2022-04-28 03:41:50,750 INFO L272 TraceCheckUtils]: 28: Hoare triple {10638#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10638#false} is VALID [2022-04-28 03:41:50,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10638#false} is VALID [2022-04-28 03:41:50,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:50,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:50,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:41:50,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:41:50,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:41:50,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:41:50,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:41:50,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:50,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:50,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {10799#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 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; {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:50,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {10803#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~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; {10799#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:41:50,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {10807#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10803#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:50,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {10811#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~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; {10807#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:41:50,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {10815#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10811#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:50,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {10819#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10815#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:41:50,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {10823#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10819#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:41:50,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {10827#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10823#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:41:50,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {10831#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10827#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 03:41:50,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {10637#true} ~z~0 := ~y~0; {10831#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:41:50,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {10637#true} [116] 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[] {10637#true} is VALID [2022-04-28 03:41:50,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {10637#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_453 v_main_~y~0_452)) (.cse3 (= v_main_~x~0_574 v_main_~x~0_573)) (.cse4 (mod v_main_~x~0_574 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_27 Int)) (or (not (<= (+ v_main_~y~0_453 v_it_27 1) v_main_~y~0_452)) (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_574 (* 4294967295 v_it_27)) 4294967296)))) (< v_main_~y~0_453 v_main_~y~0_452) (= v_main_~x~0_573 (+ v_main_~x~0_574 v_main_~y~0_453 (* (- 1) v_main_~y~0_452))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_574, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_452, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_573, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10637#true} is VALID [2022-04-28 03:41:50,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {10637#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10637#true} is VALID [2022-04-28 03:41:50,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {10637#true} call #t~ret11 := main(); {10637#true} is VALID [2022-04-28 03:41:50,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10637#true} {10637#true} #61#return; {10637#true} is VALID [2022-04-28 03:41:50,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {10637#true} assume true; {10637#true} is VALID [2022-04-28 03:41:50,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {10637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10637#true} is VALID [2022-04-28 03:41:50,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {10637#true} call ULTIMATE.init(); {10637#true} is VALID [2022-04-28 03:41:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:50,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833376920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:50,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:50,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 30 [2022-04-28 03:41:54,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:54,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1218395798] [2022-04-28 03:41:54,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1218395798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:54,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:54,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 03:41:54,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445695920] [2022-04-28 03:41:54,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:54,339 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 03:41:54,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:54,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:54,686 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:54,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 03:41:54,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:54,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 03:41:54,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:41:54,687 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:24,884 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-28 03:42:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:42:24,884 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 03:42:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2022-04-28 03:42:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2022-04-28 03:42:24,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 49 transitions. [2022-04-28 03:42:25,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:25,814 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:42:25,814 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 03:42:25,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=596, Invalid=3826, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:42:25,816 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:25,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 116 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-04-28 03:42:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 03:42:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 03:42:26,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:26,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call 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,020 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call 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,021 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call 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,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:26,021 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-28 03:42:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-28 03:42:26,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:26,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:26,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 03:42:26,022 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 03:42:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:26,023 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-28 03:42:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-28 03:42:26,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:26,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:26,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:26,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call 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,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-04-28 03:42:26,024 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40 [2022-04-28 03:42:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:26,024 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-04-28 03:42:26,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:26,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2022-04-28 03:42:45,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 36 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-28 03:42:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:42:45,165 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:45,165 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:45,184 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:42:45,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 03:42:45,366 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:45,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 25 times [2022-04-28 03:42:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:45,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1365121676] [2022-04-28 03:42:45,739 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:45,741 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1502637918, now seen corresponding path program 1 times [2022-04-28 03:42:45,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:45,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660896866] [2022-04-28 03:42:45,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:45,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:45,764 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:42:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:45,784 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:42:45,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:45,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {11207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11190#true} is VALID [2022-04-28 03:42:45,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {11190#true} assume true; {11190#true} is VALID [2022-04-28 03:42:45,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11190#true} {11190#true} #61#return; {11190#true} is VALID [2022-04-28 03:42:45,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {11190#true} call ULTIMATE.init(); {11207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:45,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {11207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11190#true} is VALID [2022-04-28 03:42:45,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {11190#true} assume true; {11190#true} is VALID [2022-04-28 03:42:45,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11190#true} {11190#true} #61#return; {11190#true} is VALID [2022-04-28 03:42:45,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {11190#true} call #t~ret11 := main(); {11190#true} is VALID [2022-04-28 03:42:45,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {11190#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11190#true} is VALID [2022-04-28 03:42:45,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {11190#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= v_main_~y~0_484 v_main_~y~0_483)) (.cse0 (mod v_main_~x~0_606 4294967296)) (.cse3 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse4 (= v_main_~x~0_606 v_main_~x~0_605))) (or (and (< 0 .cse0) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_606 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_605 v_it_28 1) v_main_~x~0_606)) (not (<= 1 v_it_28)))) (< v_main_~x~0_605 v_main_~x~0_606) (= v_main_~y~0_483 (+ v_main_~x~0_606 v_main_~y~0_484 (* v_main_~x~0_605 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_484, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_606, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_483, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_605, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11190#true} is VALID [2022-04-28 03:42:45,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {11190#true} [118] 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[] {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:45,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:45,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {11195#(<= 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; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:45,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {11196#(<= 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; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:45,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {11197#(<= 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; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:45,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {11198#(<= 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; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:45,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {11199#(<= 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; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:45,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {11200#(<= 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; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:45,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {11201#(<= 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; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:45,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {11202#(<= 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; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:45,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {11203#(<= 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; {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:42:45,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:42:45,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:45,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:45,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:45,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:45,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:46,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:46,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:46,003 INFO L272 TraceCheckUtils]: 29: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11205#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:42:46,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {11205#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11206#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:42:46,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {11206#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11191#false} is VALID [2022-04-28 03:42:46,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {11191#false} assume !false; {11191#false} is VALID [2022-04-28 03:42:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:46,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:46,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660896866] [2022-04-28 03:42:46,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660896866] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:46,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870552514] [2022-04-28 03:42:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:46,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:46,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:46,006 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:42:46,006 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:42:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:46,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:42:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:46,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:46,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {11190#true} call ULTIMATE.init(); {11190#true} is VALID [2022-04-28 03:42:46,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {11190#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11190#true} is VALID [2022-04-28 03:42:46,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {11190#true} assume true; {11190#true} is VALID [2022-04-28 03:42:46,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11190#true} {11190#true} #61#return; {11190#true} is VALID [2022-04-28 03:42:46,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {11190#true} call #t~ret11 := main(); {11190#true} is VALID [2022-04-28 03:42:46,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {11190#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11190#true} is VALID [2022-04-28 03:42:46,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {11190#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= v_main_~y~0_484 v_main_~y~0_483)) (.cse0 (mod v_main_~x~0_606 4294967296)) (.cse3 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse4 (= v_main_~x~0_606 v_main_~x~0_605))) (or (and (< 0 .cse0) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_606 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_605 v_it_28 1) v_main_~x~0_606)) (not (<= 1 v_it_28)))) (< v_main_~x~0_605 v_main_~x~0_606) (= v_main_~y~0_483 (+ v_main_~x~0_606 v_main_~y~0_484 (* v_main_~x~0_605 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_484, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_606, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_483, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_605, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11190#true} is VALID [2022-04-28 03:42:46,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {11190#true} [118] 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[] {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:46,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:46,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {11195#(<= 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; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:46,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {11196#(<= 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; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {11197#(<= 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; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {11198#(<= 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; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {11199#(<= 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; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:46,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {11200#(<= 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; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {11201#(<= 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; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {11202#(<= 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; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {11203#(<= 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; {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:42:46,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:42:46,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:46,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:46,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:46,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:46,347 INFO L272 TraceCheckUtils]: 29: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:42:46,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {11298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:42:46,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {11302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11191#false} is VALID [2022-04-28 03:42:46,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {11191#false} assume !false; {11191#false} is VALID [2022-04-28 03:42:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:46,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:46,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {11191#false} assume !false; {11191#false} is VALID [2022-04-28 03:42:46,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {11302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11191#false} is VALID [2022-04-28 03:42:46,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {11298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:42:46,692 INFO L272 TraceCheckUtils]: 29: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:42:46,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:46,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:46,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:46,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:46,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:42:46,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {11203#(<= 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; {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:42:46,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {11202#(<= 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; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {11201#(<= 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; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {11200#(<= 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; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {11199#(<= 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; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:46,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {11198#(<= 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; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {11197#(<= 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; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {11196#(<= 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; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:46,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {11195#(<= 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; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:46,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:46,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {11190#true} [118] 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[] {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:46,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {11190#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= v_main_~y~0_484 v_main_~y~0_483)) (.cse0 (mod v_main_~x~0_606 4294967296)) (.cse3 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse4 (= v_main_~x~0_606 v_main_~x~0_605))) (or (and (< 0 .cse0) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_606 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_605 v_it_28 1) v_main_~x~0_606)) (not (<= 1 v_it_28)))) (< v_main_~x~0_605 v_main_~x~0_606) (= v_main_~y~0_483 (+ v_main_~x~0_606 v_main_~y~0_484 (* v_main_~x~0_605 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_484, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_606, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_483, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_605, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11190#true} is VALID [2022-04-28 03:42:46,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {11190#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11190#true} is VALID [2022-04-28 03:42:46,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {11190#true} call #t~ret11 := main(); {11190#true} is VALID [2022-04-28 03:42:46,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11190#true} {11190#true} #61#return; {11190#true} is VALID [2022-04-28 03:42:46,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {11190#true} assume true; {11190#true} is VALID [2022-04-28 03:42:46,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {11190#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11190#true} is VALID [2022-04-28 03:42:46,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {11190#true} call ULTIMATE.init(); {11190#true} is VALID [2022-04-28 03:42:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:46,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870552514] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:46,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:46,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2022-04-28 03:42:49,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:49,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1365121676] [2022-04-28 03:42:49,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1365121676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:49,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:49,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:42:49,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795709021] [2022-04-28 03:42:49,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:49,147 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 03:42:49,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:49,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:49,498 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:42:49,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:42:49,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:42:49,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:42:49,499 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:56,429 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-04-28 03:42:56,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:42:56,429 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 03:42:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2022-04-28 03:42:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2022-04-28 03:42:56,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 79 transitions. [2022-04-28 03:42:56,751 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:56,752 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:42:56,752 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:42:56,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=515, Invalid=1647, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:42:56,754 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:56,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 40 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:42:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:42:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 44. [2022-04-28 03:42:56,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:56,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,993 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,993 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:56,994 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-28 03:42:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-28 03:42:56,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:56,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:56,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:42:56,995 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:42:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:56,996 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-28 03:42:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-28 03:42:56,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:56,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:56,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:56,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-28 03:42:56,997 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2022-04-28 03:42:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:56,997 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-28 03:42:56,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 47 transitions. [2022-04-28 03:43:17,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 38 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-28 03:43:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:43:17,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:17,197 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:17,213 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:43:17,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:17,398 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash 395434254, now seen corresponding path program 26 times [2022-04-28 03:43:17,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:17,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286814815] [2022-04-28 03:43:19,628 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:19,707 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:19,708 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash 785385231, now seen corresponding path program 1 times [2022-04-28 03:43:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:19,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671746731] [2022-04-28 03:43:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:19,720 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:43:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:19,758 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:43:20,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:20,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {11865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-28 03:43:20,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-28 03:43:20,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11840#true} {11840#true} #61#return; {11840#true} is VALID [2022-04-28 03:43:20,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {11840#true} call ULTIMATE.init(); {11865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:20,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {11865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-28 03:43:20,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-28 03:43:20,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#true} {11840#true} #61#return; {11840#true} is VALID [2022-04-28 03:43:20,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#true} call #t~ret11 := main(); {11840#true} is VALID [2022-04-28 03:43:20,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11840#true} is VALID [2022-04-28 03:43:20,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {11840#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_508 v_main_~y~0_507)) (.cse0 (mod v_main_~x~0_657 4294967296)) (.cse2 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse3 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse4 (= v_main_~x~0_657 v_main_~x~0_656))) (or (and (< v_main_~y~0_508 v_main_~y~0_507) (= v_main_~x~0_656 (+ v_main_~x~0_657 v_main_~y~0_508 (* (- 1) v_main_~y~0_507))) (< 0 .cse0) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_508 v_it_29 1) v_main_~y~0_507)) (< 0 (mod (+ v_main_~x~0_657 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_508, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_657, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_507, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_656, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11840#true} is VALID [2022-04-28 03:43:20,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {11840#true} [120] 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[] {11840#true} is VALID [2022-04-28 03:43:20,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {11840#true} ~z~0 := ~y~0; {11845#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:43:20,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {11845#(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; {11846#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:20,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {11846#(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; {11847#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:20,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {11847#(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; {11848#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:20,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {11848#(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; {11849#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:43:20,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {11849#(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; {11850#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:43:20,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {11850#(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; {11851#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:43:20,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {11851#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11852#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:43:20,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {11852#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11853#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:43:20,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {11853#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11854#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-28 03:43:20,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {11854#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !(~z~0 % 4294967296 > 0); {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:43:20,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:43:20,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:20,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:20,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11841#false} is VALID [2022-04-28 03:43:20,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {11841#false} assume !(~y~0 % 4294967296 > 0); {11841#false} is VALID [2022-04-28 03:43:20,152 INFO L272 TraceCheckUtils]: 30: Hoare triple {11841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11841#false} is VALID [2022-04-28 03:43:20,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {11841#false} ~cond := #in~cond; {11841#false} is VALID [2022-04-28 03:43:20,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {11841#false} assume 0 == ~cond; {11841#false} is VALID [2022-04-28 03:43:20,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {11841#false} assume !false; {11841#false} is VALID [2022-04-28 03:43:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:20,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:20,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671746731] [2022-04-28 03:43:20,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671746731] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:20,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804633251] [2022-04-28 03:43:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:20,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:20,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:20,154 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:43:20,155 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:43:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:20,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:43:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:20,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:20,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {11840#true} call ULTIMATE.init(); {11840#true} is VALID [2022-04-28 03:43:20,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {11840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-28 03:43:20,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-28 03:43:20,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#true} {11840#true} #61#return; {11840#true} is VALID [2022-04-28 03:43:20,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#true} call #t~ret11 := main(); {11840#true} is VALID [2022-04-28 03:43:20,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11840#true} is VALID [2022-04-28 03:43:20,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {11840#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_508 v_main_~y~0_507)) (.cse0 (mod v_main_~x~0_657 4294967296)) (.cse2 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse3 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse4 (= v_main_~x~0_657 v_main_~x~0_656))) (or (and (< v_main_~y~0_508 v_main_~y~0_507) (= v_main_~x~0_656 (+ v_main_~x~0_657 v_main_~y~0_508 (* (- 1) v_main_~y~0_507))) (< 0 .cse0) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_508 v_it_29 1) v_main_~y~0_507)) (< 0 (mod (+ v_main_~x~0_657 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_508, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_657, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_507, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_656, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11840#true} is VALID [2022-04-28 03:43:20,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {11840#true} [120] 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[] {11840#true} is VALID [2022-04-28 03:43:20,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {11840#true} ~z~0 := ~y~0; {11845#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:43:20,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {11845#(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; {11846#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:20,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {11846#(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; {11847#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:20,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {11847#(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; {11848#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:20,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {11848#(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; {11849#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:43:20,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {11849#(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; {11850#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:43:20,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {11850#(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; {11851#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:43:20,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {11851#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11852#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:43:20,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {11852#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11853#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:43:20,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {11853#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11854#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-28 03:43:20,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {11854#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !(~z~0 % 4294967296 > 0); {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:43:20,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:43:20,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:20,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:20,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:20,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11841#false} is VALID [2022-04-28 03:43:20,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {11841#false} assume !(~y~0 % 4294967296 > 0); {11841#false} is VALID [2022-04-28 03:43:20,568 INFO L272 TraceCheckUtils]: 30: Hoare triple {11841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11841#false} is VALID [2022-04-28 03:43:20,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {11841#false} ~cond := #in~cond; {11841#false} is VALID [2022-04-28 03:43:20,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {11841#false} assume 0 == ~cond; {11841#false} is VALID [2022-04-28 03:43:20,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {11841#false} assume !false; {11841#false} is VALID [2022-04-28 03:43:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:20,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:21,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {11841#false} assume !false; {11841#false} is VALID [2022-04-28 03:43:21,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {11841#false} assume 0 == ~cond; {11841#false} is VALID [2022-04-28 03:43:21,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {11841#false} ~cond := #in~cond; {11841#false} is VALID [2022-04-28 03:43:21,281 INFO L272 TraceCheckUtils]: 30: Hoare triple {11841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11841#false} is VALID [2022-04-28 03:43:21,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {11841#false} assume !(~y~0 % 4294967296 > 0); {11841#false} is VALID [2022-04-28 03:43:21,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11841#false} is VALID [2022-04-28 03:43:21,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:21,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:21,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:21,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:21,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:21,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:21,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:43:21,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:21,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:43:21,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {12013#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:21,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {12017#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) 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; {12013#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-28 03:43:21,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {12021#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~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; {12017#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:21,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12021#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-28 03:43:21,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {12029#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~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; {12025#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:21,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {12033#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~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; {12029#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-28 03:43:21,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {12037#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12033#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-28 03:43:21,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {12041#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12037#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:43:21,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {12045#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12041#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 03:43:21,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {12049#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12045#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:43:21,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {11840#true} ~z~0 := ~y~0; {12049#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 03:43:21,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {11840#true} [120] 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[] {11840#true} is VALID [2022-04-28 03:43:21,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {11840#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_508 v_main_~y~0_507)) (.cse0 (mod v_main_~x~0_657 4294967296)) (.cse2 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse3 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse4 (= v_main_~x~0_657 v_main_~x~0_656))) (or (and (< v_main_~y~0_508 v_main_~y~0_507) (= v_main_~x~0_656 (+ v_main_~x~0_657 v_main_~y~0_508 (* (- 1) v_main_~y~0_507))) (< 0 .cse0) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_508 v_it_29 1) v_main_~y~0_507)) (< 0 (mod (+ v_main_~x~0_657 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_508, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_657, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_507, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_656, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11840#true} is VALID [2022-04-28 03:43:21,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11840#true} is VALID [2022-04-28 03:43:21,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#true} call #t~ret11 := main(); {11840#true} is VALID [2022-04-28 03:43:21,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#true} {11840#true} #61#return; {11840#true} is VALID [2022-04-28 03:43:21,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-28 03:43:21,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {11840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-28 03:43:21,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {11840#true} call ULTIMATE.init(); {11840#true} is VALID [2022-04-28 03:43:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:21,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804633251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:21,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:21,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 33 [2022-04-28 03:43:24,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:24,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286814815] [2022-04-28 03:43:24,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286814815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:24,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:24,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 03:43:24,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204305467] [2022-04-28 03:43:24,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:24,322 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 03:43:24,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:24,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:24,423 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:43:24,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 03:43:24,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:24,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 03:43:24,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:43:24,424 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:49,150 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-04-28 03:43:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 03:43:49,150 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 03:43:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2022-04-28 03:43:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2022-04-28 03:43:49,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 69 transitions. [2022-04-28 03:43:50,702 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:43:50,704 INFO L225 Difference]: With dead ends: 81 [2022-04-28 03:43:50,704 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 03:43:50,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=675, Invalid=5967, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:43:50,706 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:50,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 128 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-28 03:43:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 03:43:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 03:43:50,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:50,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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:43:50,933 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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:43:50,933 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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:43:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:50,934 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 03:43:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 03:43:50,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:50,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:50,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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 44 states. [2022-04-28 03:43:50,935 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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 44 states. [2022-04-28 03:43:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:50,936 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 03:43:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 03:43:50,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:50,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:50,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:50,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 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:43:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 03:43:50,938 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42 [2022-04-28 03:43:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:50,938 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 03:43:50,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:50,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 03:44:13,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 37 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 03:44:13,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:44:13,179 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:13,179 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:13,198 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:13,381 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,SelfDestructingSolverStorable30 [2022-04-28 03:44:13,382 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:13,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:13,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1246089376, now seen corresponding path program 27 times [2022-04-28 03:44:13,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:13,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820288065] [2022-04-28 03:44:13,541 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:13,542 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1240232512, now seen corresponding path program 1 times [2022-04-28 03:44:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:13,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428960362] [2022-04-28 03:44:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:13,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:13,555 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:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:13,589 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:14,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:14,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {12534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12509#true} is VALID [2022-04-28 03:44:14,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {12509#true} assume true; {12509#true} is VALID [2022-04-28 03:44:14,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12509#true} {12509#true} #61#return; {12509#true} is VALID [2022-04-28 03:44:14,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {12509#true} call ULTIMATE.init(); {12534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:14,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {12534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12509#true} is VALID [2022-04-28 03:44:14,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {12509#true} assume true; {12509#true} is VALID [2022-04-28 03:44:14,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12509#true} {12509#true} #61#return; {12509#true} is VALID [2022-04-28 03:44:14,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {12509#true} call #t~ret11 := main(); {12509#true} is VALID [2022-04-28 03:44:14,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {12509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12509#true} is VALID [2022-04-28 03:44:14,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {12509#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_543 v_main_~y~0_542)) (.cse1 (= v_main_~x~0_692 v_main_~x~0_691)) (.cse2 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_692 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (= v_main_~x~0_691 (+ v_main_~x~0_692 v_main_~y~0_543 (* (- 1) v_main_~y~0_542))) (< 0 .cse4) (< v_main_~y~0_543 v_main_~y~0_542) (forall ((v_it_30 Int)) (or (not (<= (+ v_main_~y~0_543 v_it_30 1) v_main_~y~0_542)) (< 0 (mod (+ v_main_~x~0_692 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30))))))) InVars {main_~y~0=v_main_~y~0_543, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_692, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_542, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_691, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12509#true} is VALID [2022-04-28 03:44:14,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {12509#true} [122] 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[] {12509#true} is VALID [2022-04-28 03:44:14,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {12509#true} ~z~0 := ~y~0; {12514#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:14,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {12514#(= 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; {12515#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:14,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {12515#(= (+ (- 1) 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; {12516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:14,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {12516#(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; {12517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:14,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {12517#(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; {12518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:44:14,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {12518#(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; {12519#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:44:14,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {12519#(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; {12520#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:44:14,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {12520#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12521#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:44:14,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {12521#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12522#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:44:14,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {12522#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12523#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-28 03:44:14,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {12523#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-28 03:44:14,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !(~z~0 % 4294967296 > 0); {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-28 03:44:14,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:14,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:14,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:44:14,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:44:14,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:44:14,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:14,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:14,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:14,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:14,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {12510#false} is VALID [2022-04-28 03:44:14,041 INFO L272 TraceCheckUtils]: 30: Hoare triple {12510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12510#false} is VALID [2022-04-28 03:44:14,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {12510#false} ~cond := #in~cond; {12510#false} is VALID [2022-04-28 03:44:14,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {12510#false} assume 0 == ~cond; {12510#false} is VALID [2022-04-28 03:44:14,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {12510#false} assume !false; {12510#false} is VALID [2022-04-28 03:44:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:14,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:14,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428960362] [2022-04-28 03:44:14,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428960362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:14,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86070330] [2022-04-28 03:44:14,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:14,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:14,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:14,048 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:14,052 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:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:14,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:44:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:14,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:14,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {12509#true} call ULTIMATE.init(); {12509#true} is VALID [2022-04-28 03:44:14,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {12509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12509#true} is VALID [2022-04-28 03:44:14,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {12509#true} assume true; {12509#true} is VALID [2022-04-28 03:44:14,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12509#true} {12509#true} #61#return; {12509#true} is VALID [2022-04-28 03:44:14,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {12509#true} call #t~ret11 := main(); {12509#true} is VALID [2022-04-28 03:44:14,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {12509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12509#true} is VALID [2022-04-28 03:44:14,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {12509#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_543 v_main_~y~0_542)) (.cse1 (= v_main_~x~0_692 v_main_~x~0_691)) (.cse2 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_692 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (= v_main_~x~0_691 (+ v_main_~x~0_692 v_main_~y~0_543 (* (- 1) v_main_~y~0_542))) (< 0 .cse4) (< v_main_~y~0_543 v_main_~y~0_542) (forall ((v_it_30 Int)) (or (not (<= (+ v_main_~y~0_543 v_it_30 1) v_main_~y~0_542)) (< 0 (mod (+ v_main_~x~0_692 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30))))))) InVars {main_~y~0=v_main_~y~0_543, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_692, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_542, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_691, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12509#true} is VALID [2022-04-28 03:44:14,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {12509#true} [122] 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[] {12509#true} is VALID [2022-04-28 03:44:14,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {12509#true} ~z~0 := ~y~0; {12514#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:14,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {12514#(= 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; {12515#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:14,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {12515#(= (+ (- 1) 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; {12516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:14,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {12516#(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; {12517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:14,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {12517#(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; {12518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:44:14,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {12518#(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; {12519#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:44:14,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {12519#(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; {12520#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:44:14,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {12520#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12521#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:44:14,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {12521#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12522#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:44:14,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {12522#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12523#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-28 03:44:14,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {12523#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-28 03:44:14,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !(~z~0 % 4294967296 > 0); {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-28 03:44:14,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:14,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:14,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:44:14,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:44:14,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:44:14,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:14,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:14,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:14,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:14,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {12510#false} is VALID [2022-04-28 03:44:14,563 INFO L272 TraceCheckUtils]: 30: Hoare triple {12510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12510#false} is VALID [2022-04-28 03:44:14,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {12510#false} ~cond := #in~cond; {12510#false} is VALID [2022-04-28 03:44:14,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {12510#false} assume 0 == ~cond; {12510#false} is VALID [2022-04-28 03:44:14,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {12510#false} assume !false; {12510#false} is VALID [2022-04-28 03:44:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:14,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:15,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {12510#false} assume !false; {12510#false} is VALID [2022-04-28 03:44:15,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {12510#false} assume 0 == ~cond; {12510#false} is VALID [2022-04-28 03:44:15,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {12510#false} ~cond := #in~cond; {12510#false} is VALID [2022-04-28 03:44:15,260 INFO L272 TraceCheckUtils]: 30: Hoare triple {12510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12510#false} is VALID [2022-04-28 03:44:15,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {12510#false} is VALID [2022-04-28 03:44:15,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:15,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:15,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:15,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:15,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:44:15,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:44:15,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:44:15,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:15,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:15,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !(~z~0 % 4294967296 > 0); {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-28 03:44:15,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {12682#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (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; {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-28 03:44:15,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {12686#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12682#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:44:15,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {12690#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (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; {12686#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} is VALID [2022-04-28 03:44:15,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {12694#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12690#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:44:15,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {12698#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (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; {12694#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} is VALID [2022-04-28 03:44:15,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {12702#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (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; {12698#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:15,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {12706#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (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; {12702#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:15,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {12710#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12706#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:15,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {12714#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12710#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 03:44:15,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {12718#(or (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12714#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:15,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {12509#true} ~z~0 := ~y~0; {12718#(or (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} is VALID [2022-04-28 03:44:15,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {12509#true} [122] 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[] {12509#true} is VALID [2022-04-28 03:44:15,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {12509#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_543 v_main_~y~0_542)) (.cse1 (= v_main_~x~0_692 v_main_~x~0_691)) (.cse2 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_692 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (= v_main_~x~0_691 (+ v_main_~x~0_692 v_main_~y~0_543 (* (- 1) v_main_~y~0_542))) (< 0 .cse4) (< v_main_~y~0_543 v_main_~y~0_542) (forall ((v_it_30 Int)) (or (not (<= (+ v_main_~y~0_543 v_it_30 1) v_main_~y~0_542)) (< 0 (mod (+ v_main_~x~0_692 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30))))))) InVars {main_~y~0=v_main_~y~0_543, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_692, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_542, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_691, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12509#true} is VALID [2022-04-28 03:44:15,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {12509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12509#true} is VALID [2022-04-28 03:44:15,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {12509#true} call #t~ret11 := main(); {12509#true} is VALID [2022-04-28 03:44:15,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12509#true} {12509#true} #61#return; {12509#true} is VALID [2022-04-28 03:44:15,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {12509#true} assume true; {12509#true} is VALID [2022-04-28 03:44:15,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {12509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12509#true} is VALID [2022-04-28 03:44:15,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {12509#true} call ULTIMATE.init(); {12509#true} is VALID [2022-04-28 03:44:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:15,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86070330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:15,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:15,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 33 [2022-04-28 03:44:21,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:21,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820288065] [2022-04-28 03:44:21,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820288065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:21,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:21,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 03:44:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431279462] [2022-04-28 03:44:21,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:21,715 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have 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:44:21,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:21,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call 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:21,809 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:44:21,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 03:44:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:21,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 03:44:21,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1658, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:44:21,810 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call 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,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:14,297 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-28 03:45:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:45:14,297 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have 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:45:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call 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,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2022-04-28 03:45:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call 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,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2022-04-28 03:45:14,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 52 transitions. [2022-04-28 03:45:15,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:15,362 INFO L225 Difference]: With dead ends: 50 [2022-04-28 03:45:15,363 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:45:15,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=711, Invalid=4691, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 03:45:15,363 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:15,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 131 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2022-04-28 03:45:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:45:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 03:45:15,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:15,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:15,592 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:15,592 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:15,593 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-28 03:45:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 03:45:15,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:15,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:15,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 03:45:15,594 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 03:45:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:15,594 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-28 03:45:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 03:45:15,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:15,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:15,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:15,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-28 03:45:15,595 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 43 [2022-04-28 03:45:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:15,595 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-28 03:45:15,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call 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,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-28 03:45:36,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 37 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 03:45:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:45:36,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:36,599 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:36,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 03:45:36,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:36,799 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:36,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 28 times [2022-04-28 03:45:36,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:36,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286212045] [2022-04-28 03:45:36,948 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:36,949 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1118723181, now seen corresponding path program 1 times [2022-04-28 03:45:36,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:36,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167788885] [2022-04-28 03:45:36,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:36,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:36,961 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:45:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:36,981 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:45:37,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:37,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {13120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13102#true} is VALID [2022-04-28 03:45:37,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-28 03:45:37,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13102#true} {13102#true} #61#return; {13102#true} is VALID [2022-04-28 03:45:37,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {13102#true} call ULTIMATE.init(); {13120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:37,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {13120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13102#true} is VALID [2022-04-28 03:45:37,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-28 03:45:37,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13102#true} {13102#true} #61#return; {13102#true} is VALID [2022-04-28 03:45:37,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {13102#true} call #t~ret11 := main(); {13102#true} is VALID [2022-04-28 03:45:37,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {13102#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13102#true} is VALID [2022-04-28 03:45:37,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {13102#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_727 v_main_~x~0_726)) (.cse1 (= v_main_~y~0_577 v_main_~y~0_576)) (.cse2 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse4 (mod v_main_~x~0_727 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (< 0 (mod (+ v_main_~x~0_727 (* 4294967295 v_it_31)) 4294967296)) (not (<= (+ v_main_~y~0_577 v_it_31 1) v_main_~y~0_576)))) (= (+ v_main_~x~0_727 v_main_~y~0_577 (* (- 1) v_main_~y~0_576)) v_main_~x~0_726) (< v_main_~y~0_577 v_main_~y~0_576)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_577, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_727, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_576, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13102#true} is VALID [2022-04-28 03:45:37,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {13102#true} [124] 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[] {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {13107#(<= 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; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:45:37,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {13108#(<= 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; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {13109#(<= 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; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {13110#(<= 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; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {13111#(<= 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; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:45:37,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {13112#(<= 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; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {13113#(<= 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; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {13114#(<= 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; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {13115#(<= 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; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:45:37,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {13116#(<= 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; {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:45:37,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:45:37,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:45:37,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:45:37,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:45:37,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,224 INFO L272 TraceCheckUtils]: 31: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:45:37,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {13118#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13119#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:45:37,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {13119#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13103#false} is VALID [2022-04-28 03:45:37,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {13103#false} assume !false; {13103#false} is VALID [2022-04-28 03:45:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:37,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:37,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167788885] [2022-04-28 03:45:37,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167788885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:37,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191775910] [2022-04-28 03:45:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:37,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:37,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:37,227 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:45:37,229 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:45:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:37,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 03:45:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:37,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:37,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {13102#true} call ULTIMATE.init(); {13102#true} is VALID [2022-04-28 03:45:37,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {13102#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13102#true} is VALID [2022-04-28 03:45:37,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-28 03:45:37,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13102#true} {13102#true} #61#return; {13102#true} is VALID [2022-04-28 03:45:37,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {13102#true} call #t~ret11 := main(); {13102#true} is VALID [2022-04-28 03:45:37,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {13102#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13102#true} is VALID [2022-04-28 03:45:37,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {13102#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_727 v_main_~x~0_726)) (.cse1 (= v_main_~y~0_577 v_main_~y~0_576)) (.cse2 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse4 (mod v_main_~x~0_727 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (< 0 (mod (+ v_main_~x~0_727 (* 4294967295 v_it_31)) 4294967296)) (not (<= (+ v_main_~y~0_577 v_it_31 1) v_main_~y~0_576)))) (= (+ v_main_~x~0_727 v_main_~y~0_577 (* (- 1) v_main_~y~0_576)) v_main_~x~0_726) (< v_main_~y~0_577 v_main_~y~0_576)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_577, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_727, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_576, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13102#true} is VALID [2022-04-28 03:45:37,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {13102#true} [124] 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[] {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {13107#(<= 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; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:45:37,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {13108#(<= 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; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {13109#(<= 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; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {13110#(<= 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; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {13111#(<= 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; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:45:37,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {13112#(<= 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; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {13113#(<= 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; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {13114#(<= 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; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {13115#(<= 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; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:45:37,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {13116#(<= 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; {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:45:37,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:45:37,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:45:37,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:45:37,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:45:37,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,574 INFO L272 TraceCheckUtils]: 31: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:37,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {13217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:37,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {13221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13103#false} is VALID [2022-04-28 03:45:37,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {13103#false} assume !false; {13103#false} is VALID [2022-04-28 03:45:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:37,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:37,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {13103#false} assume !false; {13103#false} is VALID [2022-04-28 03:45:37,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {13221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13103#false} is VALID [2022-04-28 03:45:37,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {13217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:37,871 INFO L272 TraceCheckUtils]: 31: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:37,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:45:37,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:45:37,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:45:37,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:45:37,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {13116#(<= 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; {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:45:37,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {13115#(<= 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; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:45:37,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {13114#(<= 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; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {13113#(<= 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; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {13112#(<= 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; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {13111#(<= 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; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:45:37,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {13110#(<= 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; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {13109#(<= 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; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {13108#(<= 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; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:37,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {13107#(<= 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; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:45:37,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {13102#true} [124] 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[] {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:37,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {13102#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_727 v_main_~x~0_726)) (.cse1 (= v_main_~y~0_577 v_main_~y~0_576)) (.cse2 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse4 (mod v_main_~x~0_727 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (< 0 (mod (+ v_main_~x~0_727 (* 4294967295 v_it_31)) 4294967296)) (not (<= (+ v_main_~y~0_577 v_it_31 1) v_main_~y~0_576)))) (= (+ v_main_~x~0_727 v_main_~y~0_577 (* (- 1) v_main_~y~0_576)) v_main_~x~0_726) (< v_main_~y~0_577 v_main_~y~0_576)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_577, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_727, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_576, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13102#true} is VALID [2022-04-28 03:45:37,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {13102#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13102#true} is VALID [2022-04-28 03:45:37,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {13102#true} call #t~ret11 := main(); {13102#true} is VALID [2022-04-28 03:45:37,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13102#true} {13102#true} #61#return; {13102#true} is VALID [2022-04-28 03:45:37,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-28 03:45:37,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {13102#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13102#true} is VALID [2022-04-28 03:45:37,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {13102#true} call ULTIMATE.init(); {13102#true} is VALID [2022-04-28 03:45:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:37,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191775910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:37,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:37,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2022-04-28 03:45:41,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:41,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286212045] [2022-04-28 03:45:41,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286212045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:41,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:41,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:45:41,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135801667] [2022-04-28 03:45:41,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 03:45:41,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:41,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:41,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:41,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:45:41,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:45:41,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:45:41,406 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:51,318 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-04-28 03:45:51,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:45:51,318 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 03:45:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 85 transitions. [2022-04-28 03:45:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 85 transitions. [2022-04-28 03:45:51,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 85 transitions. [2022-04-28 03:45:51,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:51,597 INFO L225 Difference]: With dead ends: 82 [2022-04-28 03:45:51,597 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 03:45:51,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=614, Invalid=1936, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:45:51,598 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:51,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 45 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:45:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 03:45:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2022-04-28 03:45:51,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:51,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call 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:51,880 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call 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:51,880 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call 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:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:51,881 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-28 03:45:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-28 03:45:51,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:51,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:51,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-28 03:45:51,882 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-28 03:45:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:51,883 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-28 03:45:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-28 03:45:51,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:51,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:51,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:51,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call 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:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-28 03:45:51,884 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2022-04-28 03:45:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:51,885 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-28 03:45:51,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:51,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-28 03:46:15,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 39 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 03:46:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:46:15,994 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:15,995 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:16,010 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:46:16,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:16,195 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1907827968, now seen corresponding path program 29 times [2022-04-28 03:46:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:16,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452518913] [2022-04-28 03:46:16,359 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:16,361 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1764010976, now seen corresponding path program 1 times [2022-04-28 03:46:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:16,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423388313] [2022-04-28 03:46:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:16,373 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:46:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:16,424 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:17,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {13827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13800#true} is VALID [2022-04-28 03:46:17,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {13800#true} assume true; {13800#true} is VALID [2022-04-28 03:46:17,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13800#true} {13800#true} #61#return; {13800#true} is VALID [2022-04-28 03:46:17,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {13800#true} call ULTIMATE.init(); {13827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:17,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {13827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13800#true} is VALID [2022-04-28 03:46:17,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {13800#true} assume true; {13800#true} is VALID [2022-04-28 03:46:17,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13800#true} {13800#true} #61#return; {13800#true} is VALID [2022-04-28 03:46:17,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {13800#true} call #t~ret11 := main(); {13800#true} is VALID [2022-04-28 03:46:17,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {13800#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13800#true} is VALID [2022-04-28 03:46:17,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {13800#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse1 (= v_main_~y~0_603 v_main_~y~0_602)) (.cse2 (= v_main_~x~0_783 v_main_~x~0_782)) (.cse3 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse4 (mod v_main_~x~0_783 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (< 0 (mod (+ v_main_~x~0_783 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~x~0_782 v_it_32 1) v_main_~x~0_783)))) (< 0 .cse4) (= v_main_~y~0_602 (+ v_main_~x~0_783 v_main_~y~0_603 (* v_main_~x~0_782 (- 1)))) (< v_main_~x~0_782 v_main_~x~0_783)))) InVars {main_~y~0=v_main_~y~0_603, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_783, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_602, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_782, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13800#true} is VALID [2022-04-28 03:46:17,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {13800#true} [126] 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[] {13800#true} is VALID [2022-04-28 03:46:17,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {13800#true} ~z~0 := ~y~0; {13805#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:46:17,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {13805#(= (+ 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; {13806#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 1) 4294967296) 4294967296))))} is VALID [2022-04-28 03:46:17,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {13806#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 1) 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; {13807#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296)) 4294967293)))} is VALID [2022-04-28 03:46:17,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {13807#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296)) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13808#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 3 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:46:17,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {13808#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 3 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~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; {13809#(and (<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 4) 4294967296) 4294967296))) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:46:17,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {13809#(and (<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 4) 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; {13810#(and (<= (+ 5 main_~z~0) main_~y~0) (<= main_~z~0 (+ 4294967290 (* (div (+ 5 main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:46:17,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {13810#(and (<= (+ 5 main_~z~0) main_~y~0) (<= main_~z~0 (+ 4294967290 (* (div (+ 5 main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~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; {13811#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~z~0 (+ 4294967289 (* (div (+ main_~z~0 6 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:46:17,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {13811#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~z~0 (+ 4294967289 (* (div (+ main_~z~0 6 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~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; {13812#(and (<= (+ 7 main_~z~0) main_~y~0) (<= main_~z~0 (+ 4294967288 (* (div (+ 7 main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:46:17,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {13812#(and (<= (+ 7 main_~z~0) main_~y~0) (<= main_~z~0 (+ 4294967288 (* (div (+ 7 main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~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; {13813#(and (<= main_~z~0 (+ 4294967287 (* (div (+ main_~z~0 8 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:46:17,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {13813#(and (<= main_~z~0 (+ 4294967287 (* (div (+ main_~z~0 8 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13814#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 9 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967286)))} is VALID [2022-04-28 03:46:17,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {13814#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 9 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967286)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13815#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) main_~z~0 10))} is VALID [2022-04-28 03:46:17,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {13815#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) main_~z~0 10))} assume !(~z~0 % 4294967296 > 0); {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:46:17,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:17,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:46:17,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:17,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:46:17,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:17,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:17,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:17,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:17,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:17,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:17,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13801#false} is VALID [2022-04-28 03:46:17,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {13801#false} assume !(~y~0 % 4294967296 > 0); {13801#false} is VALID [2022-04-28 03:46:17,679 INFO L272 TraceCheckUtils]: 32: Hoare triple {13801#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13801#false} is VALID [2022-04-28 03:46:17,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {13801#false} ~cond := #in~cond; {13801#false} is VALID [2022-04-28 03:46:17,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {13801#false} assume 0 == ~cond; {13801#false} is VALID [2022-04-28 03:46:17,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {13801#false} assume !false; {13801#false} is VALID [2022-04-28 03:46:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:17,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:17,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423388313] [2022-04-28 03:46:17,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423388313] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:17,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139708043] [2022-04-28 03:46:17,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:17,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:17,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:17,681 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:46:17,682 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:46:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:17,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 03:46:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:17,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:18,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {13800#true} call ULTIMATE.init(); {13800#true} is VALID [2022-04-28 03:46:18,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {13800#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13800#true} is VALID [2022-04-28 03:46:18,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {13800#true} assume true; {13800#true} is VALID [2022-04-28 03:46:18,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13800#true} {13800#true} #61#return; {13800#true} is VALID [2022-04-28 03:46:18,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {13800#true} call #t~ret11 := main(); {13800#true} is VALID [2022-04-28 03:46:18,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {13800#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13800#true} is VALID [2022-04-28 03:46:18,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {13800#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse1 (= v_main_~y~0_603 v_main_~y~0_602)) (.cse2 (= v_main_~x~0_783 v_main_~x~0_782)) (.cse3 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse4 (mod v_main_~x~0_783 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (< 0 (mod (+ v_main_~x~0_783 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~x~0_782 v_it_32 1) v_main_~x~0_783)))) (< 0 .cse4) (= v_main_~y~0_602 (+ v_main_~x~0_783 v_main_~y~0_603 (* v_main_~x~0_782 (- 1)))) (< v_main_~x~0_782 v_main_~x~0_783)))) InVars {main_~y~0=v_main_~y~0_603, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_783, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_602, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_782, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13800#true} is VALID [2022-04-28 03:46:18,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {13800#true} [126] 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[] {13800#true} is VALID [2022-04-28 03:46:18,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {13800#true} ~z~0 := ~y~0; {13805#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:46:18,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {13805#(= (+ 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; {13858#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:46:18,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {13858#(= 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; {13862#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:46:18,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {13862#(= 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; {13866#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:46:18,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {13866#(= (+ (- 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; {13870#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:46:18,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {13870#(= (+ (- 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; {13874#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} is VALID [2022-04-28 03:46:18,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {13874#(= (+ (- 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; {13878#(= (+ (- 2) main_~y~0) (+ main_~z~0 4))} is VALID [2022-04-28 03:46:18,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {13878#(= (+ (- 2) 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; {13882#(= (+ (- 2) main_~y~0) (+ 5 main_~z~0))} is VALID [2022-04-28 03:46:18,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {13882#(= (+ (- 2) main_~y~0) (+ 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13886#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} is VALID [2022-04-28 03:46:18,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {13886#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13890#(= (+ main_~z~0 2) (+ main_~y~0 (- 7)))} is VALID [2022-04-28 03:46:18,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {13890#(= (+ main_~z~0 2) (+ main_~y~0 (- 7)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13894#(= (+ main_~z~0 3) (+ main_~y~0 (- 7)))} is VALID [2022-04-28 03:46:18,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {13894#(= (+ main_~z~0 3) (+ main_~y~0 (- 7)))} assume !(~z~0 % 4294967296 > 0); {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:46:18,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:18,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:46:18,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:18,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:46:18,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:18,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:18,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:18,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:18,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:18,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:18,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13801#false} is VALID [2022-04-28 03:46:18,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {13801#false} assume !(~y~0 % 4294967296 > 0); {13801#false} is VALID [2022-04-28 03:46:18,259 INFO L272 TraceCheckUtils]: 32: Hoare triple {13801#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13801#false} is VALID [2022-04-28 03:46:18,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {13801#false} ~cond := #in~cond; {13801#false} is VALID [2022-04-28 03:46:18,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {13801#false} assume 0 == ~cond; {13801#false} is VALID [2022-04-28 03:46:18,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {13801#false} assume !false; {13801#false} is VALID [2022-04-28 03:46:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:18,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:19,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {13801#false} assume !false; {13801#false} is VALID [2022-04-28 03:46:19,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {13801#false} assume 0 == ~cond; {13801#false} is VALID [2022-04-28 03:46:19,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {13801#false} ~cond := #in~cond; {13801#false} is VALID [2022-04-28 03:46:19,212 INFO L272 TraceCheckUtils]: 32: Hoare triple {13801#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13801#false} is VALID [2022-04-28 03:46:19,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {13801#false} assume !(~y~0 % 4294967296 > 0); {13801#false} is VALID [2022-04-28 03:46:19,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13801#false} is VALID [2022-04-28 03:46:19,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:19,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:19,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:19,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:19,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:19,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:19,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:46:19,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:19,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:46:19,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:19,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {13994#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:46:19,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {13998#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 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; {13994#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:19,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {14002#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 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; {13998#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:46:19,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {14006#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 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; {14002#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:46:19,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {14010#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 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; {14006#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:46:19,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {14014#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 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; {14010#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:46:19,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {14018#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 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; {14014#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:46:19,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {14022#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14018#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:46:19,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {14026#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14022#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 03:46:19,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {14030#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14026#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:46:19,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {14034#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14030#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 03:46:19,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {13800#true} ~z~0 := ~y~0; {14034#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-28 03:46:19,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {13800#true} [126] 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[] {13800#true} is VALID [2022-04-28 03:46:19,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {13800#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse1 (= v_main_~y~0_603 v_main_~y~0_602)) (.cse2 (= v_main_~x~0_783 v_main_~x~0_782)) (.cse3 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse4 (mod v_main_~x~0_783 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (< 0 (mod (+ v_main_~x~0_783 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~x~0_782 v_it_32 1) v_main_~x~0_783)))) (< 0 .cse4) (= v_main_~y~0_602 (+ v_main_~x~0_783 v_main_~y~0_603 (* v_main_~x~0_782 (- 1)))) (< v_main_~x~0_782 v_main_~x~0_783)))) InVars {main_~y~0=v_main_~y~0_603, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_783, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_602, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_782, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13800#true} is VALID [2022-04-28 03:46:19,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {13800#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13800#true} is VALID [2022-04-28 03:46:19,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {13800#true} call #t~ret11 := main(); {13800#true} is VALID [2022-04-28 03:46:19,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13800#true} {13800#true} #61#return; {13800#true} is VALID [2022-04-28 03:46:19,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {13800#true} assume true; {13800#true} is VALID [2022-04-28 03:46:19,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {13800#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13800#true} is VALID [2022-04-28 03:46:19,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {13800#true} call ULTIMATE.init(); {13800#true} is VALID [2022-04-28 03:46:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:19,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139708043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:19,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:19,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 46 [2022-04-28 03:46:27,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:27,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452518913] [2022-04-28 03:46:27,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452518913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:27,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:27,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 03:46:27,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709934084] [2022-04-28 03:46:27,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:27,660 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have 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:46:27,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:27,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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:28,241 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:46:28,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 03:46:28,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:28,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 03:46:28,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2883, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 03:46:28,242 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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:11,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:47:15,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:47:17,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:47:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:29,217 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-28 03:47:29,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:47:29,217 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have 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:47:29,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 72 transitions. [2022-04-28 03:47:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 72 transitions. [2022-04-28 03:47:29,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 72 transitions. [2022-04-28 03:47:31,169 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:47:31,170 INFO L225 Difference]: With dead ends: 88 [2022-04-28 03:47:31,170 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:47:31,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=772, Invalid=8930, Unknown=0, NotChecked=0, Total=9702 [2022-04-28 03:47:31,172 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 96 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:31,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 143 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 979 Invalid, 1 Unknown, 0 Unchecked, 17.7s Time] [2022-04-28 03:47:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:47:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 03:47:31,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:31,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:31,609 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:31,609 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:31,610 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-28 03:47:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-28 03:47:31,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:31,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:31,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:47:31,611 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:47:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:31,612 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-28 03:47:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-28 03:47:31,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:31,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:31,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:31,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-04-28 03:47:31,613 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 45 [2022-04-28 03:47:31,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:31,613 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-04-28 03:47:31,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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:31,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 75 transitions. [2022-04-28 03:47:54,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 65 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-28 03:47:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:47:54,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:54,419 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:54,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 03:47:54,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:54,619 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:54,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1633510225, now seen corresponding path program 30 times [2022-04-28 03:47:54,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:54,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [215129080] [2022-04-28 03:47:58,716 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:47:58,787 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:58,788 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:58,790 INFO L85 PathProgramCache]: Analyzing trace with hash -368491569, now seen corresponding path program 1 times [2022-04-28 03:47:58,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:58,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760733578] [2022-04-28 03:47:58,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:58,801 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:47:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:58,844 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:47:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:59,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {14650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14623#true} is VALID [2022-04-28 03:47:59,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {14623#true} assume true; {14623#true} is VALID [2022-04-28 03:47:59,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14623#true} {14623#true} #61#return; {14623#true} is VALID [2022-04-28 03:47:59,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {14623#true} call ULTIMATE.init(); {14650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:59,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {14650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14623#true} is VALID [2022-04-28 03:47:59,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {14623#true} assume true; {14623#true} is VALID [2022-04-28 03:47:59,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14623#true} {14623#true} #61#return; {14623#true} is VALID [2022-04-28 03:47:59,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {14623#true} call #t~ret11 := main(); {14623#true} is VALID [2022-04-28 03:47:59,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {14623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14623#true} is VALID [2022-04-28 03:47:59,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {14623#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_821 v_main_~x~0_820)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~y~0_641 v_main_~y~0_640)) (.cse0 (mod v_main_~x~0_821 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_641 v_main_~y~0_640) (= v_main_~x~0_820 (+ v_main_~x~0_821 v_main_~y~0_641 (* (- 1) v_main_~y~0_640))) (< 0 .cse0) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_641 v_it_33 1) v_main_~y~0_640)) (< 0 (mod (+ v_main_~x~0_821 (* 4294967295 v_it_33)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_641, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_821, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_640, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_820, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14623#true} is VALID [2022-04-28 03:47:59,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {14623#true} [128] 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[] {14623#true} is VALID [2022-04-28 03:47:59,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {14623#true} ~z~0 := ~y~0; {14628#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:59,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {14628#(= 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; {14629#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:47:59,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {14629#(= (+ (- 1) 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; {14630#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:47:59,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {14630#(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; {14631#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:47:59,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {14631#(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; {14632#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:47:59,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {14632#(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; {14633#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:47:59,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {14633#(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; {14634#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:47:59,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {14634#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14635#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:47:59,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {14635#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14636#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:47:59,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {14636#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14637#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-28 03:47:59,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {14637#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14638#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} is VALID [2022-04-28 03:47:59,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {14638#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 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; {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:47:59,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:47:59,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-28 03:47:59,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:59,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:59,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:47:59,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:47:59,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:47:59,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:47:59,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:47:59,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:47:59,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:47:59,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14624#false} is VALID [2022-04-28 03:47:59,324 INFO L272 TraceCheckUtils]: 32: Hoare triple {14624#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14624#false} is VALID [2022-04-28 03:47:59,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {14624#false} ~cond := #in~cond; {14624#false} is VALID [2022-04-28 03:47:59,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {14624#false} assume 0 == ~cond; {14624#false} is VALID [2022-04-28 03:47:59,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {14624#false} assume !false; {14624#false} is VALID [2022-04-28 03:47:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:59,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:59,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760733578] [2022-04-28 03:47:59,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760733578] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:59,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863091910] [2022-04-28 03:47:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:59,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:59,326 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:47:59,326 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:47:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:59,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 03:47:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:59,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:59,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {14623#true} call ULTIMATE.init(); {14623#true} is VALID [2022-04-28 03:47:59,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {14623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14623#true} is VALID [2022-04-28 03:47:59,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {14623#true} assume true; {14623#true} is VALID [2022-04-28 03:47:59,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14623#true} {14623#true} #61#return; {14623#true} is VALID [2022-04-28 03:47:59,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {14623#true} call #t~ret11 := main(); {14623#true} is VALID [2022-04-28 03:47:59,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {14623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14623#true} is VALID [2022-04-28 03:47:59,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {14623#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_821 v_main_~x~0_820)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~y~0_641 v_main_~y~0_640)) (.cse0 (mod v_main_~x~0_821 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_641 v_main_~y~0_640) (= v_main_~x~0_820 (+ v_main_~x~0_821 v_main_~y~0_641 (* (- 1) v_main_~y~0_640))) (< 0 .cse0) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_641 v_it_33 1) v_main_~y~0_640)) (< 0 (mod (+ v_main_~x~0_821 (* 4294967295 v_it_33)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_641, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_821, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_640, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_820, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14623#true} is VALID [2022-04-28 03:47:59,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {14623#true} [128] 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[] {14623#true} is VALID [2022-04-28 03:47:59,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {14623#true} ~z~0 := ~y~0; {14628#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:59,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {14628#(= 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; {14629#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:47:59,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {14629#(= (+ (- 1) 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; {14630#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:47:59,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {14630#(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; {14631#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:47:59,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {14631#(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; {14632#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:47:59,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {14632#(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; {14633#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:47:59,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {14633#(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; {14634#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:47:59,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {14634#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14635#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:47:59,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {14635#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14636#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-28 03:47:59,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {14636#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14637#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-28 03:47:59,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {14637#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14638#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} is VALID [2022-04-28 03:47:59,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {14638#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 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; {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:47:59,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:47:59,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-28 03:47:59,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:59,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:59,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:47:59,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:47:59,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:47:59,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:47:59,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:47:59,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:47:59,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:47:59,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14624#false} is VALID [2022-04-28 03:47:59,856 INFO L272 TraceCheckUtils]: 32: Hoare triple {14624#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14624#false} is VALID [2022-04-28 03:47:59,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {14624#false} ~cond := #in~cond; {14624#false} is VALID [2022-04-28 03:47:59,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {14624#false} assume 0 == ~cond; {14624#false} is VALID [2022-04-28 03:47:59,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {14624#false} assume !false; {14624#false} is VALID [2022-04-28 03:47:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:59,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:00,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {14624#false} assume !false; {14624#false} is VALID [2022-04-28 03:48:00,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {14624#false} assume 0 == ~cond; {14624#false} is VALID [2022-04-28 03:48:00,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {14624#false} ~cond := #in~cond; {14624#false} is VALID [2022-04-28 03:48:00,628 INFO L272 TraceCheckUtils]: 32: Hoare triple {14624#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14624#false} is VALID [2022-04-28 03:48:00,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14624#false} is VALID [2022-04-28 03:48:00,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:48:00,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:48:00,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:48:00,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:48:00,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:48:00,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:48:00,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-28 03:48:00,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:00,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:00,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-28 03:48:00,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:48:00,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {14807#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) 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; {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-28 03:48:00,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {14811#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) 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; {14807#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:48:00,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {14815#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) 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; {14811#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))))} is VALID [2022-04-28 03:48:00,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {14819#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) 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; {14815#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:48:00,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {14823#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) 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; {14819#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))))} is VALID [2022-04-28 03:48:00,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {14827#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) 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; {14823#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:00,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {14831#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) 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; {14827#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:00,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {14835#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14831#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:00,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {14839#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14835#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-28 03:48:00,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {14843#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14839#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:00,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {14847#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) 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; {14843#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} is VALID [2022-04-28 03:48:00,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {14623#true} ~z~0 := ~y~0; {14847#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))))} is VALID [2022-04-28 03:48:00,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {14623#true} [128] 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[] {14623#true} is VALID [2022-04-28 03:48:00,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {14623#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_821 v_main_~x~0_820)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~y~0_641 v_main_~y~0_640)) (.cse0 (mod v_main_~x~0_821 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_641 v_main_~y~0_640) (= v_main_~x~0_820 (+ v_main_~x~0_821 v_main_~y~0_641 (* (- 1) v_main_~y~0_640))) (< 0 .cse0) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_641 v_it_33 1) v_main_~y~0_640)) (< 0 (mod (+ v_main_~x~0_821 (* 4294967295 v_it_33)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_641, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_821, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_640, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_820, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14623#true} is VALID [2022-04-28 03:48:00,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {14623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14623#true} is VALID [2022-04-28 03:48:00,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {14623#true} call #t~ret11 := main(); {14623#true} is VALID [2022-04-28 03:48:00,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14623#true} {14623#true} #61#return; {14623#true} is VALID [2022-04-28 03:48:00,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {14623#true} assume true; {14623#true} is VALID [2022-04-28 03:48:00,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {14623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14623#true} is VALID [2022-04-28 03:48:00,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {14623#true} call ULTIMATE.init(); {14623#true} is VALID [2022-04-28 03:48:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:48:00,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863091910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:00,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:00,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 36 [2022-04-28 03:48:07,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:07,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [215129080] [2022-04-28 03:48:07,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [215129080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:07,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:07,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 03:48:07,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951785926] [2022-04-28 03:48:07,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:07,952 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have 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:48:07,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:07,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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,073 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:48:08,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 03:48:08,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:08,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 03:48:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1914, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:48:08,074 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:49:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:17,882 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-04-28 03:49:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:49:17,882 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have 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:49:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-04-28 03:49:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-04-28 03:49:17,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 54 transitions. [2022-04-28 03:49:20,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:20,260 INFO L225 Difference]: With dead ends: 77 [2022-04-28 03:49:20,260 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 03:49:20,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=796, Invalid=5366, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 03:49:20,261 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:20,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 136 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 20.9s Time] [2022-04-28 03:49:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 03:49:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 03:49:20,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:20,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call 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:20,536 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call 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:20,537 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call 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:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:20,537 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-04-28 03:49:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-28 03:49:20,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:20,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:20,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 03:49:20,538 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 03:49:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:20,539 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-04-28 03:49:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-28 03:49:20,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:20,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:20,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:20,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call 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:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-04-28 03:49:20,540 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2022-04-28 03:49:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:20,540 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-04-28 03:49:20,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call 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:20,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 50 transitions. [2022-04-28 03:49:44,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 39 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-28 03:49:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 03:49:44,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:44,426 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:44,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 03:49:44,626 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,SelfDestructingSolverStorable34 [2022-04-28 03:49:44,626 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:44,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:44,627 INFO L85 PathProgramCache]: Analyzing trace with hash -457999617, now seen corresponding path program 31 times [2022-04-28 03:49:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:44,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [312930827] [2022-04-28 03:49:44,780 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:49:44,782 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2074576834, now seen corresponding path program 1 times [2022-04-28 03:49:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:44,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123578949] [2022-04-28 03:49:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:44,794 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:49:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:44,824 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:49:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:45,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {15320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15301#true} is VALID [2022-04-28 03:49:45,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {15301#true} assume true; {15301#true} is VALID [2022-04-28 03:49:45,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15301#true} {15301#true} #61#return; {15301#true} is VALID [2022-04-28 03:49:45,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {15301#true} call ULTIMATE.init(); {15320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:45,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {15320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15301#true} is VALID [2022-04-28 03:49:45,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {15301#true} assume true; {15301#true} is VALID [2022-04-28 03:49:45,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15301#true} {15301#true} #61#return; {15301#true} is VALID [2022-04-28 03:49:45,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {15301#true} call #t~ret11 := main(); {15301#true} is VALID [2022-04-28 03:49:45,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {15301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15301#true} is VALID [2022-04-28 03:49:45,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {15301#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~y~0_677 v_main_~y~0_676)) (.cse4 (= v_main_~x~0_858 v_main_~x~0_857)) (.cse3 (mod v_main_~x~0_858 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (forall ((v_it_34 Int)) (or (not (<= (+ v_main_~x~0_857 v_it_34 1) v_main_~x~0_858)) (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_858 (* 4294967295 v_it_34)) 4294967296)))) (< v_main_~x~0_857 v_main_~x~0_858) (= v_main_~y~0_676 (+ (* v_main_~x~0_857 (- 1)) v_main_~x~0_858 v_main_~y~0_677))))) InVars {main_~y~0=v_main_~y~0_677, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_858, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_676, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_857, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15301#true} is VALID [2022-04-28 03:49:45,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {15301#true} [130] 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[] {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {15306#(<= 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; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:49:45,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {15307#(<= 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; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {15308#(<= 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; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {15309#(<= 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; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {15310#(<= 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; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:49:45,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {15311#(<= 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; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {15312#(<= 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; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {15313#(<= 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; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {15314#(<= 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; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:49:45,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {15315#(<= 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; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:49:45,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {15316#(<= 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; {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:49:45,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:49:45,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:49:45,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:49:45,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:49:45,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:49:45,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,133 INFO L272 TraceCheckUtils]: 33: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15318#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:49:45,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {15318#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15319#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:49:45,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {15319#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15302#false} is VALID [2022-04-28 03:49:45,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {15302#false} assume !false; {15302#false} is VALID [2022-04-28 03:49:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:45,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:45,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123578949] [2022-04-28 03:49:45,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123578949] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:45,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427480665] [2022-04-28 03:49:45,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:45,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:45,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:45,140 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:49:45,141 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:49:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:45,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 03:49:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:45,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:45,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {15301#true} call ULTIMATE.init(); {15301#true} is VALID [2022-04-28 03:49:45,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {15301#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15301#true} is VALID [2022-04-28 03:49:45,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {15301#true} assume true; {15301#true} is VALID [2022-04-28 03:49:45,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15301#true} {15301#true} #61#return; {15301#true} is VALID [2022-04-28 03:49:45,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {15301#true} call #t~ret11 := main(); {15301#true} is VALID [2022-04-28 03:49:45,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {15301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15301#true} is VALID [2022-04-28 03:49:45,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {15301#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~y~0_677 v_main_~y~0_676)) (.cse4 (= v_main_~x~0_858 v_main_~x~0_857)) (.cse3 (mod v_main_~x~0_858 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (forall ((v_it_34 Int)) (or (not (<= (+ v_main_~x~0_857 v_it_34 1) v_main_~x~0_858)) (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_858 (* 4294967295 v_it_34)) 4294967296)))) (< v_main_~x~0_857 v_main_~x~0_858) (= v_main_~y~0_676 (+ (* v_main_~x~0_857 (- 1)) v_main_~x~0_858 v_main_~y~0_677))))) InVars {main_~y~0=v_main_~y~0_677, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_858, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_676, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_857, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15301#true} is VALID [2022-04-28 03:49:45,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {15301#true} [130] 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[] {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {15306#(<= 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; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:49:45,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {15307#(<= 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; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {15308#(<= 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; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {15309#(<= 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; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {15310#(<= 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; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:49:45,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {15311#(<= 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; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {15312#(<= 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; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {15313#(<= 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; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {15314#(<= 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; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:49:45,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {15315#(<= 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; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:49:45,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {15316#(<= 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; {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:49:45,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:49:45,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:49:45,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:49:45,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:49:45,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:49:45,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,601 INFO L272 TraceCheckUtils]: 33: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:49:45,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {15423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:49:45,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {15427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15302#false} is VALID [2022-04-28 03:49:45,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {15302#false} assume !false; {15302#false} is VALID [2022-04-28 03:49:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:45,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:45,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {15302#false} assume !false; {15302#false} is VALID [2022-04-28 03:49:45,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {15427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15302#false} is VALID [2022-04-28 03:49:45,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {15423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:49:45,918 INFO L272 TraceCheckUtils]: 33: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:49:45,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:49:45,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:49:45,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:49:45,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:49:45,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:49:45,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {15316#(<= 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; {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:49:45,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {15315#(<= 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; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:49:45,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {15314#(<= 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; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:49:45,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {15313#(<= 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; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {15312#(<= 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; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {15311#(<= 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; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {15310#(<= 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; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:49:45,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {15309#(<= 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; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {15308#(<= 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; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {15307#(<= 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; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:45,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {15306#(<= 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; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:49:45,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {15301#true} [130] 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[] {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:49:45,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {15301#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~y~0_677 v_main_~y~0_676)) (.cse4 (= v_main_~x~0_858 v_main_~x~0_857)) (.cse3 (mod v_main_~x~0_858 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (forall ((v_it_34 Int)) (or (not (<= (+ v_main_~x~0_857 v_it_34 1) v_main_~x~0_858)) (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_858 (* 4294967295 v_it_34)) 4294967296)))) (< v_main_~x~0_857 v_main_~x~0_858) (= v_main_~y~0_676 (+ (* v_main_~x~0_857 (- 1)) v_main_~x~0_858 v_main_~y~0_677))))) InVars {main_~y~0=v_main_~y~0_677, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_858, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_676, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_857, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15301#true} is VALID [2022-04-28 03:49:45,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {15301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15301#true} is VALID [2022-04-28 03:49:45,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {15301#true} call #t~ret11 := main(); {15301#true} is VALID [2022-04-28 03:49:45,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15301#true} {15301#true} #61#return; {15301#true} is VALID [2022-04-28 03:49:45,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {15301#true} assume true; {15301#true} is VALID [2022-04-28 03:49:45,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {15301#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15301#true} is VALID [2022-04-28 03:49:45,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {15301#true} call ULTIMATE.init(); {15301#true} is VALID [2022-04-28 03:49:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:45,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427480665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:45,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:45,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 19 [2022-04-28 03:49:52,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:52,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [312930827] [2022-04-28 03:49:52,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [312930827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:52,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:52,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 03:49:52,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381603087] [2022-04-28 03:49:52,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:52,163 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 03:49:52,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:52,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call 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:52,935 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:49:52,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 03:49:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:52,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 03:49:52,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:49:52,936 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)