/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:48:30,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:48:30,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:48:30,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:48:30,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:48:30,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:48:30,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:48:30,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:48:30,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:48:30,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:48:30,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:48:30,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:48:30,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:48:30,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:48:30,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:48:30,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:48:30,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:48:30,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:48:30,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:48:30,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:48:30,078 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:48:30,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:48:30,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:48:30,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:48:30,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:48:30,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:48:30,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:48:30,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:48:30,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:48:30,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:48:30,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:48:30,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:48:30,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:48:30,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:48:30,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:48:30,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:48:30,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:48:30,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:48:30,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:48:30,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:48:30,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:48:30,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:48:30,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:48:30,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:48:30,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:48:30,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:48:30,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:48:30,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:48:30,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:48:30,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:48:30,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:48:30,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:48:30,104 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:48:30,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:48:30,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:48:30,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:48:30,105 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:48:30,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:48:30,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:48:30,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:48:30,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:48:30,105 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:48:30,105 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:48:30,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:48:30,105 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:48:30,105 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:48:30,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:48:30,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:48:30,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:48:30,316 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:48:30,323 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:48:30,324 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-15 12:48:30,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4ea0e93/80bc91027a284509b7985ecc38f51917/FLAG945f86ea9 [2022-04-15 12:48:30,663 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:48:30,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-15 12:48:30,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4ea0e93/80bc91027a284509b7985ecc38f51917/FLAG945f86ea9 [2022-04-15 12:48:31,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4ea0e93/80bc91027a284509b7985ecc38f51917 [2022-04-15 12:48:31,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:48:31,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:48:31,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:48:31,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:48:31,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:48:31,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:48:31" (1/1) ... [2022-04-15 12:48:31,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c7089f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31, skipping insertion in model container [2022-04-15 12:48:31,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:48:31" (1/1) ... [2022-04-15 12:48:31,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:48:31,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:48:31,242 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-15 12:48:31,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:48:31,261 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:48:31,269 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-15 12:48:31,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:48:31,280 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:48:31,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31 WrapperNode [2022-04-15 12:48:31,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:48:31,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:48:31,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:48:31,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:48:31,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31" (1/1) ... [2022-04-15 12:48:31,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31" (1/1) ... [2022-04-15 12:48:31,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31" (1/1) ... [2022-04-15 12:48:31,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31" (1/1) ... [2022-04-15 12:48:31,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31" (1/1) ... [2022-04-15 12:48:31,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31" (1/1) ... [2022-04-15 12:48:31,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31" (1/1) ... [2022-04-15 12:48:31,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:48:31,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:48:31,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:48:31,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:48:31,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31" (1/1) ... [2022-04-15 12:48:31,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:48:31,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:31,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:48:31,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:48:31,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:48:31,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:48:31,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:48:31,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:48:31,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:48:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:48:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:48:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:48:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:48:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:48:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:48:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:48:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:48:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:48:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:48:31,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:48:31,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:48:31,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:48:31,414 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:48:31,415 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:48:31,545 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:48:31,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:48:31,549 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 12:48:31,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:48:31 BoogieIcfgContainer [2022-04-15 12:48:31,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:48:31,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:48:31,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:48:31,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:48:31,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:48:31" (1/3) ... [2022-04-15 12:48:31,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304db98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:48:31, skipping insertion in model container [2022-04-15 12:48:31,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:48:31" (2/3) ... [2022-04-15 12:48:31,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304db98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:48:31, skipping insertion in model container [2022-04-15 12:48:31,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:48:31" (3/3) ... [2022-04-15 12:48:31,556 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de32.c [2022-04-15 12:48:31,559 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:48:31,559 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:48:31,585 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:48:31,590 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:48:31,590 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:48:31,602 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-15 12:48:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:48:31,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:31,607 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:31,608 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:31,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-15 12:48:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:31,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409246117] [2022-04-15 12:48:31,625 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:48:31,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 2 times [2022-04-15 12:48:31,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:31,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665249238] [2022-04-15 12:48:31,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:31,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:31,813 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-15 12:48:31,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:48:31,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-15 12:48:31,815 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-15 12:48:31,815 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-15 12:48:31,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:48:31,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-15 12:48:31,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-15 12:48:31,816 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-15 12:48:31,817 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-15 12:48:31,819 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-15 12:48:31,821 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-15 12:48:31,822 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-15 12:48:31,824 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-15 12:48:31,825 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-15 12:48:31,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-15 12:48:31,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 12:48:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:31,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:31,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665249238] [2022-04-15 12:48:31,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665249238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:31,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:31,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:48:31,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:31,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409246117] [2022-04-15 12:48:31,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409246117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:31,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:31,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:48:31,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419759255] [2022-04-15 12:48:31,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:31,836 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-15 12:48:31,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:31,841 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-15 12:48:31,870 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-15 12:48:31,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:48:31,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:31,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:48:31,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:48:31,896 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-15 12:48:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:32,163 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-15 12:48:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:48:32,164 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-15 12:48:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:32,165 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-15 12:48:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 12:48:32,175 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-15 12:48:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 12:48:32,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-15 12:48:32,251 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-15 12:48:32,259 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:48:32,259 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:48:32,262 INFO L912 BasicCegarLoop]: 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-15 12:48:32,266 INFO L913 BasicCegarLoop]: 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-15 12:48:32,267 INFO L914 BasicCegarLoop]: 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-15 12:48:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:48:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:48:32,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:32,300 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-15 12:48:32,301 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-15 12:48:32,301 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-15 12:48:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:32,308 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 12:48:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 12:48:32,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:32,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:32,312 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-15 12:48:32,313 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-15 12:48:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:32,316 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 12:48:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 12:48:32,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:32,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:32,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:32,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:32,318 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-15 12:48:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-15 12:48:32,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2022-04-15 12:48:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:32,324 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-15 12:48:32,324 INFO L479 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-15 12:48:32,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-15 12:48:32,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 12:48:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:48:32,345 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:32,355 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:32,356 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:48:32,356 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 1 times [2022-04-15 12:48:32,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:32,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [787007965] [2022-04-15 12:48:32,358 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:48:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 2 times [2022-04-15 12:48:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:32,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083501671] [2022-04-15 12:48:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:32,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:32,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:32,415 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-15 12:48:32,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-15 12:48:32,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-15 12:48:32,416 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-15 12:48:32,417 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-15 12:48:32,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-15 12:48:32,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-15 12:48:32,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} call #t~ret11 := main(); {206#true} is VALID [2022-04-15 12:48:32,417 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-15 12:48:32,418 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-15 12:48:32,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(= main_~y~0 0)} ~z~0 := ~y~0; {211#(= main_~y~0 0)} is VALID [2022-04-15 12:48:32,419 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-15 12:48:32,419 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-15 12:48:32,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#false} assume !(~y~0 % 4294967296 > 0); {207#false} is VALID [2022-04-15 12:48:32,421 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-15 12:48:32,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2022-04-15 12:48:32,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2022-04-15 12:48:32,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {207#false} assume !false; {207#false} is VALID [2022-04-15 12:48:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:32,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:32,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083501671] [2022-04-15 12:48:32,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083501671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:32,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:32,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:32,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:32,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [787007965] [2022-04-15 12:48:32,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [787007965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:32,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:32,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:32,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207246464] [2022-04-15 12:48:32,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:32,426 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-15 12:48:32,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:32,426 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-15 12:48:32,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:32,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:48:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:32,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:48:32,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:48:32,444 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-15 12:48:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:32,515 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-15 12:48:32,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:48:32,516 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-15 12:48:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:32,516 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-15 12:48:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-15 12:48:32,519 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-15 12:48:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-15 12:48:32,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-15 12:48:32,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:32,548 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:48:32,548 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:48:32,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:48:32,551 INFO L913 BasicCegarLoop]: 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-15 12:48:32,551 INFO L914 BasicCegarLoop]: 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-15 12:48:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:48:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 12:48:32,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:32,564 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-15 12:48:32,564 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-15 12:48:32,564 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-15 12:48:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:32,565 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 12:48:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 12:48:32,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:32,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:32,566 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-15 12:48:32,566 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-15 12:48:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:32,568 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 12:48:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 12:48:32,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:32,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:32,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:32,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-15 12:48:32,571 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-15 12:48:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:32,572 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-15 12:48:32,572 INFO L479 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-15 12:48:32,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-15 12:48:32,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 12:48:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:48:32,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:32,600 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:32,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:48:32,601 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:32,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:32,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1179931951, now seen corresponding path program 1 times [2022-04-15 12:48:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:32,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273672517] [2022-04-15 12:48:32,775 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash 115301550, now seen corresponding path program 1 times [2022-04-15 12:48:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:32,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820802841] [2022-04-15 12:48:32,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:32,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:32,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:32,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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-15 12:48:32,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-15 12:48:32,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {367#true} {367#true} #61#return; {367#true} is VALID [2022-04-15 12:48:32,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:32,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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-15 12:48:32,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-15 12:48:32,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #61#return; {367#true} is VALID [2022-04-15 12:48:32,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret11 := main(); {367#true} is VALID [2022-04-15 12:48:32,979 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-15 12:48:32,981 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-15 12:48:32,983 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-15 12:48:32,985 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: (or (and (= v_main_~z~0_In_1 v_main_~z~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post8_Out_2| 0) (= (+ v_main_~x~0_Out_2 v_main_~z~0_Out_2) (+ v_main_~z~0_In_1 v_main_~x~0_In_1)) (< 0 (mod (+ v_main_~z~0_Out_2 1) 4294967296)) (= |v_main_#t~post7_Out_2| 0))) InVars {main_~x~0=v_main_~x~0_In_1, main_~z~0=v_main_~z~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post8=|v_main_#t~post8_Out_2|, main_~z~0=v_main_~z~0_Out_2, main_#t~post7=|v_main_#t~post7_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {375#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:48:32,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {375#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~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[] {376#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:32,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {376#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:32,988 INFO L272 TraceCheckUtils]: 11: Hoare triple {376#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {377#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:48:32,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {378#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:32,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {378#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {368#false} is VALID [2022-04-15 12:48:32,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#false} assume !false; {368#false} is VALID [2022-04-15 12:48:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:32,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:32,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820802841] [2022-04-15 12:48:32,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820802841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:32,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:32,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:48:33,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:33,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273672517] [2022-04-15 12:48:33,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273672517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:33,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:33,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:48:33,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540332891] [2022-04-15 12:48:33,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:33,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:48:33,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:33,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:33,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:48:33,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:33,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:48:33,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:48:33,335 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:33,562 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 12:48:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:48:33,562 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:48:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 31 transitions. [2022-04-15 12:48:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 31 transitions. [2022-04-15 12:48:33,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 31 transitions. [2022-04-15 12:48:33,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:33,603 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:48:33,604 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:48:33,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:48:33,605 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:33,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 50 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 36 Unchecked, 0.0s Time] [2022-04-15 12:48:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:48:33,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:48:33,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:33,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,628 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,628 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:33,629 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 12:48:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 12:48:33,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:33,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:33,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:48:33,630 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:48:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:33,630 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 12:48:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 12:48:33,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:33,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:33,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:33,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 12:48:33,632 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2022-04-15 12:48:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:33,632 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 12:48:33,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-15 12:48:33,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 12:48:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:48:33,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:33,672 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:33,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:48:33,672 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash -639491699, now seen corresponding path program 2 times [2022-04-15 12:48:33,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:33,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1431349153] [2022-04-15 12:48:33,882 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1947567214, now seen corresponding path program 1 times [2022-04-15 12:48:33,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:33,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264084755] [2022-04-15 12:48:33,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:34,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {546#true} is VALID [2022-04-15 12:48:34,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} assume true; {546#true} is VALID [2022-04-15 12:48:34,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {546#true} {546#true} #61#return; {546#true} is VALID [2022-04-15 12:48:34,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:34,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {546#true} is VALID [2022-04-15 12:48:34,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {546#true} assume true; {546#true} is VALID [2022-04-15 12:48:34,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {546#true} {546#true} #61#return; {546#true} is VALID [2022-04-15 12:48:34,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {546#true} call #t~ret11 := main(); {546#true} is VALID [2022-04-15 12:48:34,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {546#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {551#(= main_~y~0 0)} is VALID [2022-04-15 12:48:34,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {551#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {552#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 12:48:34,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {552#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {553#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:48:34,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {553#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [67] L23-2-->L29-1_primed: Formula: (or (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~z~0_In_2 v_main_~z~0_Out_4)) (and (< 0 (mod (+ v_main_~z~0_Out_4 1) 4294967296)) (<= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= |v_main_#t~post7_Out_4| 0) (= (+ v_main_~x~0_Out_4 v_main_~z~0_Out_4) (+ v_main_~z~0_In_2 v_main_~x~0_In_2)) (= |v_main_#t~post8_Out_4| 0))) InVars {main_~x~0=v_main_~x~0_In_2, main_~z~0=v_main_~z~0_In_2} OutVars{main_~x~0=v_main_~x~0_Out_4, main_#t~post8=|v_main_#t~post8_Out_4|, main_~z~0=v_main_~z~0_Out_4, main_#t~post7=|v_main_#t~post7_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {554#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 12:48:34,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0)) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [66] 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[] {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:34,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:34,050 INFO L272 TraceCheckUtils]: 11: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:48:34,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {556#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {557#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:34,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {557#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {547#false} is VALID [2022-04-15 12:48:34,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-15 12:48:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:34,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264084755] [2022-04-15 12:48:34,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264084755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:34,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:34,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:48:34,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:34,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1431349153] [2022-04-15 12:48:34,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1431349153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:34,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:34,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:48:34,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171131243] [2022-04-15 12:48:34,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:34,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:48:34,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:34,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:34,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:34,461 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:48:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:48:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:48:34,461 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:34,662 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 12:48:34,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:48:34,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:48:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2022-04-15 12:48:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2022-04-15 12:48:34,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 32 transitions. [2022-04-15 12:48:34,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:34,712 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:48:34,712 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:48:34,712 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:48:34,713 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:34,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 50 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-04-15 12:48:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:48:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:48:34,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:34,718 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-15 12:48:34,719 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-15 12:48:34,719 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-15 12:48:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:34,719 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-15 12:48:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 12:48:34,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:34,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:34,720 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-15 12:48:34,720 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-15 12:48:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:34,721 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-15 12:48:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 12:48:34,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:34,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:34,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:34,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:34,721 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-15 12:48:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-15 12:48:34,722 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 16 [2022-04-15 12:48:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:34,722 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-15 12:48:34,722 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:34,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-15 12:48:34,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 12:48:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:48:34,741 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:34,741 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:34,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:48:34,741 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 1 times [2022-04-15 12:48:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:34,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1095984477] [2022-04-15 12:48:34,887 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash -759458368, now seen corresponding path program 1 times [2022-04-15 12:48:34,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:34,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113579100] [2022-04-15 12:48:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:34,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:34,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:34,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-15 12:48:34,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-15 12:48:34,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {704#true} {704#true} #61#return; {704#true} is VALID [2022-04-15 12:48:34,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:34,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-15 12:48:34,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-15 12:48:34,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #61#return; {704#true} is VALID [2022-04-15 12:48:34,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret11 := main(); {704#true} is VALID [2022-04-15 12:48:34,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {704#true} is VALID [2022-04-15 12:48:34,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {704#true} [69] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_1 v_main_~y~0_Out_2) (= v_main_~x~0_In_3 v_main_~x~0_Out_6)) (and (= 0 |v_main_#t~post6_Out_2|) (= (+ v_main_~x~0_In_3 v_main_~y~0_In_1) (+ v_main_~x~0_Out_6 v_main_~y~0_Out_2)) (<= v_main_~x~0_Out_6 v_main_~x~0_In_3) (= |v_main_#t~post5_Out_2| 0) (< 0 (mod (+ v_main_~x~0_Out_6 1) 4294967296)))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_1} OutVars{main_~y~0=v_main_~y~0_Out_2, main_#t~post5=|v_main_#t~post5_Out_2|, main_~x~0=v_main_~x~0_Out_6, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {704#true} is VALID [2022-04-15 12:48:34,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {704#true} [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[] {704#true} is VALID [2022-04-15 12:48:34,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {704#true} ~z~0 := ~y~0; {709#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:48:34,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {710#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:34,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {710#(<= 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; {705#false} is VALID [2022-04-15 12:48:34,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#false} assume !(~y~0 % 4294967296 > 0); {705#false} is VALID [2022-04-15 12:48:34,933 INFO L272 TraceCheckUtils]: 12: Hoare triple {705#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {705#false} is VALID [2022-04-15 12:48:34,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#false} ~cond := #in~cond; {705#false} is VALID [2022-04-15 12:48:34,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {705#false} assume 0 == ~cond; {705#false} is VALID [2022-04-15 12:48:34,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-15 12:48:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:34,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:34,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113579100] [2022-04-15 12:48:34,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113579100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:34,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:34,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:48:34,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:34,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1095984477] [2022-04-15 12:48:34,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1095984477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:34,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:34,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:48:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271973010] [2022-04-15 12:48:34,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:34,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:48:34,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:34,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:34,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:34,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:48:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:34,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:48:34,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:48:34,966 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:35,095 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 12:48:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:48:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:48:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-15 12:48:35,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-15 12:48:35,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-15 12:48:35,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:35,120 INFO L225 Difference]: With dead ends: 24 [2022-04-15 12:48:35,120 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:48:35,121 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:48:35,121 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:35,122 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 30 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:48:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:48:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:48:35,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:35,129 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-15 12:48:35,129 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-15 12:48:35,129 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-15 12:48:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:35,130 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:48:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:48:35,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:35,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:35,131 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-15 12:48:35,131 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-15 12:48:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:35,132 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:48:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:48:35,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:35,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:35,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:35,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:35,134 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-15 12:48:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 12:48:35,135 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-15 12:48:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:35,135 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 12:48:35,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:35,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 12:48:35,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:48:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:48:35,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:35,153 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:35,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:48:35,153 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1578117650, now seen corresponding path program 1 times [2022-04-15 12:48:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:35,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494749046] [2022-04-15 12:48:35,297 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash 930401391, now seen corresponding path program 1 times [2022-04-15 12:48:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:35,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058266573] [2022-04-15 12:48:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:35,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {841#true} is VALID [2022-04-15 12:48:35,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {841#true} assume true; {841#true} is VALID [2022-04-15 12:48:35,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {841#true} {841#true} #61#return; {841#true} is VALID [2022-04-15 12:48:35,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {841#true} call ULTIMATE.init(); {849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:35,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {841#true} is VALID [2022-04-15 12:48:35,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {841#true} assume true; {841#true} is VALID [2022-04-15 12:48:35,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {841#true} {841#true} #61#return; {841#true} is VALID [2022-04-15 12:48:35,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {841#true} call #t~ret11 := main(); {841#true} is VALID [2022-04-15 12:48:35,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {841#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {841#true} is VALID [2022-04-15 12:48:35,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#true} [71] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) (and (= (+ v_main_~x~0_Out_8 v_main_~y~0_Out_4) (+ v_main_~x~0_In_4 v_main_~y~0_In_2)) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= |v_main_#t~post5_Out_4| 0) (= 0 |v_main_#t~post6_Out_4|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {841#true} is VALID [2022-04-15 12:48:35,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {841#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[] {841#true} is VALID [2022-04-15 12:48:35,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {841#true} ~z~0 := ~y~0; {846#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:48:35,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#(= 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; {847#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:48:35,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {847#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {848#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:35,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {848#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {842#false} is VALID [2022-04-15 12:48:35,349 INFO L272 TraceCheckUtils]: 12: Hoare triple {842#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {842#false} is VALID [2022-04-15 12:48:35,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {842#false} ~cond := #in~cond; {842#false} is VALID [2022-04-15 12:48:35,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#false} assume 0 == ~cond; {842#false} is VALID [2022-04-15 12:48:35,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {842#false} assume !false; {842#false} is VALID [2022-04-15 12:48:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:35,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:35,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058266573] [2022-04-15 12:48:35,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058266573] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:35,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93474664] [2022-04-15 12:48:35,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:35,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:35,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:35,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:35,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:48:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:35,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:48:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:35,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:35,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {841#true} call ULTIMATE.init(); {841#true} is VALID [2022-04-15 12:48:35,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {841#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {841#true} is VALID [2022-04-15 12:48:35,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {841#true} assume true; {841#true} is VALID [2022-04-15 12:48:35,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {841#true} {841#true} #61#return; {841#true} is VALID [2022-04-15 12:48:35,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {841#true} call #t~ret11 := main(); {841#true} is VALID [2022-04-15 12:48:35,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {841#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {841#true} is VALID [2022-04-15 12:48:35,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#true} [71] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) (and (= (+ v_main_~x~0_Out_8 v_main_~y~0_Out_4) (+ v_main_~x~0_In_4 v_main_~y~0_In_2)) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= |v_main_#t~post5_Out_4| 0) (= 0 |v_main_#t~post6_Out_4|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {841#true} is VALID [2022-04-15 12:48:35,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {841#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[] {841#true} is VALID [2022-04-15 12:48:35,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {841#true} ~z~0 := ~y~0; {846#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:48:35,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#(= 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; {848#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:35,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {848#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {848#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:35,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {848#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {842#false} is VALID [2022-04-15 12:48:35,684 INFO L272 TraceCheckUtils]: 12: Hoare triple {842#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {842#false} is VALID [2022-04-15 12:48:35,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {842#false} ~cond := #in~cond; {842#false} is VALID [2022-04-15 12:48:35,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#false} assume 0 == ~cond; {842#false} is VALID [2022-04-15 12:48:35,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {842#false} assume !false; {842#false} is VALID [2022-04-15 12:48:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:35,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:35,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {842#false} assume !false; {842#false} is VALID [2022-04-15 12:48:35,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#false} assume 0 == ~cond; {842#false} is VALID [2022-04-15 12:48:35,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {842#false} ~cond := #in~cond; {842#false} is VALID [2022-04-15 12:48:35,913 INFO L272 TraceCheckUtils]: 12: Hoare triple {842#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {842#false} is VALID [2022-04-15 12:48:35,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {848#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {842#false} is VALID [2022-04-15 12:48:35,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {848#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {848#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:35,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {916#(or (not (< 0 (mod main_~z~0 4294967296))) (<= (+ (* (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; {848#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:35,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {841#true} ~z~0 := ~y~0; {916#(or (not (< 0 (mod main_~z~0 4294967296))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:48:35,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {841#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[] {841#true} is VALID [2022-04-15 12:48:35,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#true} [71] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_2 v_main_~y~0_Out_4)) (and (= (+ v_main_~x~0_Out_8 v_main_~y~0_Out_4) (+ v_main_~x~0_In_4 v_main_~y~0_In_2)) (<= v_main_~x~0_Out_8 v_main_~x~0_In_4) (< 0 (mod (+ v_main_~x~0_Out_8 1) 4294967296)) (= |v_main_#t~post5_Out_4| 0) (= 0 |v_main_#t~post6_Out_4|))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_2} OutVars{main_~y~0=v_main_~y~0_Out_4, main_#t~post5=|v_main_#t~post5_Out_4|, main_~x~0=v_main_~x~0_Out_8, main_#t~post6=|v_main_#t~post6_Out_4|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {841#true} is VALID [2022-04-15 12:48:35,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {841#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {841#true} is VALID [2022-04-15 12:48:35,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {841#true} call #t~ret11 := main(); {841#true} is VALID [2022-04-15 12:48:35,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {841#true} {841#true} #61#return; {841#true} is VALID [2022-04-15 12:48:35,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {841#true} assume true; {841#true} is VALID [2022-04-15 12:48:35,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {841#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {841#true} is VALID [2022-04-15 12:48:35,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {841#true} call ULTIMATE.init(); {841#true} is VALID [2022-04-15 12:48:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:35,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93474664] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:35,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:48:35,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 7 [2022-04-15 12:48:35,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:35,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [494749046] [2022-04-15 12:48:35,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [494749046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:35,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:35,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:48:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396911535] [2022-04-15 12:48:35,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:35,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:48:35,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:35,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:35,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:35,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:48:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:35,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:48:35,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:48:35,950 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:36,029 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:48:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:48:36,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:48:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-15 12:48:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-15 12:48:36,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-15 12:48:36,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:36,050 INFO L225 Difference]: With dead ends: 23 [2022-04-15 12:48:36,050 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:48:36,050 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:48:36,052 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:36,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 43 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:48:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:48:36,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:48:36,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:36,062 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-15 12:48:36,062 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-15 12:48:36,062 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-15 12:48:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:36,063 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 12:48:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:48:36,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:36,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:36,063 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-15 12:48:36,063 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-15 12:48:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:36,064 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 12:48:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:48:36,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:36,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:36,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:36,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:36,064 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-15 12:48:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 12:48:36,065 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-04-15 12:48:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:36,065 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 12:48:36,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:36,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 12:48:36,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:48:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:48:36,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:36,085 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:36,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:36,295 WARN L460 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-15 12:48:36,295 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:36,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:36,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-04-15 12:48:36,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:36,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1127515671] [2022-04-15 12:48:36,431 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:36,432 INFO L85 PathProgramCache]: Analyzing trace with hash -879795298, now seen corresponding path program 1 times [2022-04-15 12:48:36,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:36,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074505004] [2022-04-15 12:48:36,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:36,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:36,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:36,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1067#true} is VALID [2022-04-15 12:48:36,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {1067#true} assume true; {1067#true} is VALID [2022-04-15 12:48:36,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1067#true} {1067#true} #61#return; {1067#true} is VALID [2022-04-15 12:48:36,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {1067#true} call ULTIMATE.init(); {1076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:36,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1067#true} is VALID [2022-04-15 12:48:36,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1067#true} assume true; {1067#true} is VALID [2022-04-15 12:48:36,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1067#true} {1067#true} #61#return; {1067#true} is VALID [2022-04-15 12:48:36,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {1067#true} call #t~ret11 := main(); {1067#true} is VALID [2022-04-15 12:48:36,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {1067#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1067#true} is VALID [2022-04-15 12:48:36,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {1067#true} [73] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1067#true} is VALID [2022-04-15 12:48:36,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#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[] {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#(<= 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; {1073#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:36,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {1073#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1073#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:36,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {1073#(<= 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; {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,527 INFO L272 TraceCheckUtils]: 13: Hoare triple {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1074#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:48:36,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1075#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:36,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1068#false} is VALID [2022-04-15 12:48:36,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {1068#false} assume !false; {1068#false} is VALID [2022-04-15 12:48:36,529 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-15 12:48:36,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:36,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074505004] [2022-04-15 12:48:36,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074505004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:36,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111396001] [2022-04-15 12:48:36,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:36,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:36,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:36,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:36,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:48:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:36,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:48:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:36,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:36,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {1067#true} call ULTIMATE.init(); {1067#true} is VALID [2022-04-15 12:48:36,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {1067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1067#true} is VALID [2022-04-15 12:48:36,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {1067#true} assume true; {1067#true} is VALID [2022-04-15 12:48:36,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1067#true} {1067#true} #61#return; {1067#true} is VALID [2022-04-15 12:48:36,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {1067#true} call #t~ret11 := main(); {1067#true} is VALID [2022-04-15 12:48:36,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {1067#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1067#true} is VALID [2022-04-15 12:48:36,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {1067#true} [73] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1067#true} is VALID [2022-04-15 12:48:36,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#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[] {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#(<= 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; {1073#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:36,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {1073#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1073#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:36,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {1073#(<= 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; {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,761 INFO L272 TraceCheckUtils]: 13: Hoare triple {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1119#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:36,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {1119#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1123#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:36,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {1123#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1068#false} is VALID [2022-04-15 12:48:36,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {1068#false} assume !false; {1068#false} is VALID [2022-04-15 12:48:36,762 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-15 12:48:36,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:36,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {1068#false} assume !false; {1068#false} is VALID [2022-04-15 12:48:36,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {1123#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1068#false} is VALID [2022-04-15 12:48:36,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {1119#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1123#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:36,962 INFO L272 TraceCheckUtils]: 13: Hoare triple {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1119#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:36,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {1073#(<= 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; {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {1073#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1073#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:36,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#(<= 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; {1073#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:36,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#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[] {1072#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:36,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {1067#true} [73] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (and (< 0 (mod (+ v_main_~x~0_Out_10 1) 4294967296)) (= |v_main_#t~post5_Out_6| 0) (= 0 |v_main_#t~post6_Out_6|) (= (+ v_main_~x~0_In_5 v_main_~y~0_In_3) (+ v_main_~x~0_Out_10 v_main_~y~0_Out_6)) (<= v_main_~x~0_Out_10 v_main_~x~0_In_5))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_3} OutVars{main_~y~0=v_main_~y~0_Out_6, main_#t~post5=|v_main_#t~post5_Out_6|, main_~x~0=v_main_~x~0_Out_10, main_#t~post6=|v_main_#t~post6_Out_6|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1067#true} is VALID [2022-04-15 12:48:36,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {1067#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1067#true} is VALID [2022-04-15 12:48:36,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {1067#true} call #t~ret11 := main(); {1067#true} is VALID [2022-04-15 12:48:36,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1067#true} {1067#true} #61#return; {1067#true} is VALID [2022-04-15 12:48:36,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {1067#true} assume true; {1067#true} is VALID [2022-04-15 12:48:36,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {1067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1067#true} is VALID [2022-04-15 12:48:36,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {1067#true} call ULTIMATE.init(); {1067#true} is VALID [2022-04-15 12:48:36,967 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-15 12:48:36,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111396001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:36,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:36,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 12:48:36,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:36,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1127515671] [2022-04-15 12:48:36,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1127515671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:36,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:36,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:48:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101899512] [2022-04-15 12:48:36,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:36,993 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-15 12:48:36,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:36,994 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-15 12:48:37,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:37,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:48:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:37,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:48:37,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:48:37,009 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-15 12:48:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:37,222 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 12:48:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:48:37,222 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-15 12:48:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:37,222 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-15 12:48:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-15 12:48:37,223 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-15 12:48:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-15 12:48:37,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-15 12:48:37,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:37,250 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:48:37,250 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:48:37,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 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-15 12:48:37,251 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:37,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 40 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:48:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:48:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-15 12:48:37,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:37,264 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-15 12:48:37,264 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-15 12:48:37,265 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-15 12:48:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:37,265 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 12:48:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 12:48:37,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:37,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:37,266 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-15 12:48:37,266 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-15 12:48:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:37,266 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 12:48:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 12:48:37,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:37,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:37,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:37,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:37,267 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-15 12:48:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 12:48:37,267 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2022-04-15 12:48:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:37,268 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 12:48:37,268 INFO L479 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-15 12:48:37,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 12:48:37,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 12:48:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:48:37,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:37,290 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:37,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:37,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-15 12:48:37,499 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 2 times [2022-04-15 12:48:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:37,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882793716] [2022-04-15 12:48:37,654 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:37,656 INFO L85 PathProgramCache]: Analyzing trace with hash -510125361, now seen corresponding path program 1 times [2022-04-15 12:48:37,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:37,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626519001] [2022-04-15 12:48:37,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:37,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:37,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:37,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1333#true} is VALID [2022-04-15 12:48:37,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {1333#true} assume true; {1333#true} is VALID [2022-04-15 12:48:37,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1333#true} {1333#true} #61#return; {1333#true} is VALID [2022-04-15 12:48:37,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:37,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {1342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1333#true} is VALID [2022-04-15 12:48:37,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2022-04-15 12:48:37,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #61#return; {1333#true} is VALID [2022-04-15 12:48:37,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret11 := main(); {1333#true} is VALID [2022-04-15 12:48:37,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {1333#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1333#true} is VALID [2022-04-15 12:48:37,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {1333#true} [75] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_4) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_8))) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1333#true} is VALID [2022-04-15 12:48:37,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {1333#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[] {1333#true} is VALID [2022-04-15 12:48:37,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {1333#true} ~z~0 := ~y~0; {1338#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:48:37,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {1338#(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; {1339#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:48:37,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {1339#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1340#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:37,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {1340#(<= 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; {1341#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:37,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#(<= 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; {1334#false} is VALID [2022-04-15 12:48:37,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#false} assume !(~y~0 % 4294967296 > 0); {1334#false} is VALID [2022-04-15 12:48:37,727 INFO L272 TraceCheckUtils]: 14: Hoare triple {1334#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1334#false} is VALID [2022-04-15 12:48:37,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {1334#false} ~cond := #in~cond; {1334#false} is VALID [2022-04-15 12:48:37,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {1334#false} assume 0 == ~cond; {1334#false} is VALID [2022-04-15 12:48:37,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2022-04-15 12:48:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:37,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:37,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626519001] [2022-04-15 12:48:37,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626519001] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:37,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808878058] [2022-04-15 12:48:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:37,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:37,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:37,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:37,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:48:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:37,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:48:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:37,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:38,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1333#true} is VALID [2022-04-15 12:48:38,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {1333#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1333#true} is VALID [2022-04-15 12:48:38,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2022-04-15 12:48:38,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #61#return; {1333#true} is VALID [2022-04-15 12:48:38,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret11 := main(); {1333#true} is VALID [2022-04-15 12:48:38,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {1333#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1333#true} is VALID [2022-04-15 12:48:38,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {1333#true} [75] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_4) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_8))) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1333#true} is VALID [2022-04-15 12:48:38,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {1333#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[] {1333#true} is VALID [2022-04-15 12:48:38,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {1333#true} ~z~0 := ~y~0; {1338#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:48:38,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {1338#(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; {1339#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:48:38,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {1339#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1340#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:38,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {1340#(<= 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; {1341#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:38,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#(<= 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; {1334#false} is VALID [2022-04-15 12:48:38,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#false} assume !(~y~0 % 4294967296 > 0); {1334#false} is VALID [2022-04-15 12:48:38,074 INFO L272 TraceCheckUtils]: 14: Hoare triple {1334#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1334#false} is VALID [2022-04-15 12:48:38,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {1334#false} ~cond := #in~cond; {1334#false} is VALID [2022-04-15 12:48:38,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {1334#false} assume 0 == ~cond; {1334#false} is VALID [2022-04-15 12:48:38,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2022-04-15 12:48:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:38,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:38,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {1334#false} assume !false; {1334#false} is VALID [2022-04-15 12:48:38,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {1334#false} assume 0 == ~cond; {1334#false} is VALID [2022-04-15 12:48:38,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {1334#false} ~cond := #in~cond; {1334#false} is VALID [2022-04-15 12:48:38,306 INFO L272 TraceCheckUtils]: 14: Hoare triple {1334#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1334#false} is VALID [2022-04-15 12:48:38,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#false} assume !(~y~0 % 4294967296 > 0); {1334#false} is VALID [2022-04-15 12:48:38,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#(<= 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; {1334#false} is VALID [2022-04-15 12:48:38,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {1340#(<= 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; {1341#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:38,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {1418#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1340#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:38,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {1422#(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; {1418#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:48:38,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {1333#true} ~z~0 := ~y~0; {1422#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:48:38,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {1333#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[] {1333#true} is VALID [2022-04-15 12:48:38,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {1333#true} [75] L16-2-->L16-3_primed: Formula: (or (and (= 0 |v_main_#t~post6_Out_8|) (= |v_main_#t~post5_Out_8| 0) (< 0 (mod (+ v_main_~x~0_Out_12 1) 4294967296)) (<= v_main_~x~0_Out_12 v_main_~x~0_In_6) (= (+ v_main_~x~0_In_6 v_main_~y~0_In_4) (+ v_main_~x~0_Out_12 v_main_~y~0_Out_8))) (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_6 v_main_~x~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_4} OutVars{main_~y~0=v_main_~y~0_Out_8, main_#t~post5=|v_main_#t~post5_Out_8|, main_~x~0=v_main_~x~0_Out_12, main_#t~post6=|v_main_#t~post6_Out_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1333#true} is VALID [2022-04-15 12:48:38,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {1333#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1333#true} is VALID [2022-04-15 12:48:38,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {1333#true} call #t~ret11 := main(); {1333#true} is VALID [2022-04-15 12:48:38,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1333#true} {1333#true} #61#return; {1333#true} is VALID [2022-04-15 12:48:38,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1333#true} assume true; {1333#true} is VALID [2022-04-15 12:48:38,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1333#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1333#true} is VALID [2022-04-15 12:48:38,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {1333#true} call ULTIMATE.init(); {1333#true} is VALID [2022-04-15 12:48:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808878058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:38,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:38,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 12:48:38,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:38,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882793716] [2022-04-15 12:48:38,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882793716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:38,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:38,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:48:38,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701601699] [2022-04-15 12:48:38,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:48:38,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:38,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:38,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:38,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:48:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:38,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:48:38,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:48:38,355 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-15 12:48:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:38,682 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 12:48:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:48:38,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:48:38,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-15 12:48:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-15 12:48:38,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2022-04-15 12:48:38,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:38,720 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:48:38,720 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:48:38,720 INFO L912 BasicCegarLoop]: 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-15 12:48:38,720 INFO L913 BasicCegarLoop]: 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-15 12:48:38,721 INFO L914 BasicCegarLoop]: 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-15 12:48:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:48:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 12:48:38,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:38,737 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-15 12:48:38,737 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-15 12:48:38,738 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-15 12:48:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:38,739 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 12:48:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 12:48:38,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:38,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:38,739 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-15 12:48:38,739 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-15 12:48:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:38,740 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 12:48:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 12:48:38,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:38,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:38,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:38,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:38,740 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-15 12:48:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 12:48:38,741 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-04-15 12:48:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:38,741 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 12:48:38,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:38,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 12:48:38,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 12:48:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:48:38,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:38,765 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:38,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:38,967 WARN L460 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-15 12:48:38,968 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:38,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1137046944, now seen corresponding path program 3 times [2022-04-15 12:48:38,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:38,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962268597] [2022-04-15 12:48:39,116 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash 987112064, now seen corresponding path program 1 times [2022-04-15 12:48:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:39,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666257979] [2022-04-15 12:48:39,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:39,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:39,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:39,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {1627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1618#true} is VALID [2022-04-15 12:48:39,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 12:48:39,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1618#true} {1618#true} #61#return; {1618#true} is VALID [2022-04-15 12:48:39,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:39,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {1627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1618#true} is VALID [2022-04-15 12:48:39,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 12:48:39,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1618#true} {1618#true} #61#return; {1618#true} is VALID [2022-04-15 12:48:39,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {1618#true} call #t~ret11 := main(); {1618#true} is VALID [2022-04-15 12:48:39,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {1618#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1618#true} is VALID [2022-04-15 12:48:39,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {1618#true} [77] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_7 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_14)) (= |v_main_#t~post6_Out_10| 0) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post5_Out_10| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_5 v_main_~y~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1618#true} is VALID [2022-04-15 12:48:39,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {1618#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[] {1618#true} is VALID [2022-04-15 12:48:39,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {1618#true} ~z~0 := ~y~0; {1623#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:48:39,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {1623#(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; {1624#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:48:39,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {1624#(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; {1625#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:39,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1625#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:39,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#(<= 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; {1626#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:39,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1619#false} is VALID [2022-04-15 12:48:39,229 INFO L272 TraceCheckUtils]: 14: Hoare triple {1619#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-15 12:48:39,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-15 12:48:39,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {1619#false} assume 0 == ~cond; {1619#false} is VALID [2022-04-15 12:48:39,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-15 12:48:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:39,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666257979] [2022-04-15 12:48:39,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666257979] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:39,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777671381] [2022-04-15 12:48:39,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:39,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:39,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:39,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:39,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:48:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:39,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:48:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:39,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:39,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1618#true} is VALID [2022-04-15 12:48:39,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1618#true} is VALID [2022-04-15 12:48:39,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 12:48:39,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1618#true} {1618#true} #61#return; {1618#true} is VALID [2022-04-15 12:48:39,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {1618#true} call #t~ret11 := main(); {1618#true} is VALID [2022-04-15 12:48:39,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {1618#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1618#true} is VALID [2022-04-15 12:48:39,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {1618#true} [77] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_7 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_14)) (= |v_main_#t~post6_Out_10| 0) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post5_Out_10| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_5 v_main_~y~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1618#true} is VALID [2022-04-15 12:48:39,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {1618#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[] {1618#true} is VALID [2022-04-15 12:48:39,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {1618#true} ~z~0 := ~y~0; {1623#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:48:39,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {1623#(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; {1624#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:48:39,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {1624#(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; {1625#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:39,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1625#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:39,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#(<= 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; {1626#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:39,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1619#false} is VALID [2022-04-15 12:48:39,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {1619#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-15 12:48:39,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-15 12:48:39,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {1619#false} assume 0 == ~cond; {1619#false} is VALID [2022-04-15 12:48:39,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-15 12:48:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:39,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:39,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-15 12:48:39,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {1619#false} assume 0 == ~cond; {1619#false} is VALID [2022-04-15 12:48:39,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-15 12:48:39,804 INFO L272 TraceCheckUtils]: 14: Hoare triple {1619#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-15 12:48:39,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1619#false} is VALID [2022-04-15 12:48:39,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#(<= 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; {1626#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:39,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1625#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:39,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {1703#(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; {1625#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:39,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {1707#(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; {1703#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:48:39,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {1618#true} ~z~0 := ~y~0; {1707#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:39,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {1618#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[] {1618#true} is VALID [2022-04-15 12:48:39,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {1618#true} [77] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~x~0_In_7 v_main_~y~0_In_5) (+ v_main_~y~0_Out_10 v_main_~x~0_Out_14)) (= |v_main_#t~post6_Out_10| 0) (< 0 (mod (+ v_main_~x~0_Out_14 1) 4294967296)) (= |v_main_#t~post5_Out_10| 0) (<= v_main_~x~0_Out_14 v_main_~x~0_In_7)) (and (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_5 v_main_~y~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_5} OutVars{main_~y~0=v_main_~y~0_Out_10, main_#t~post5=|v_main_#t~post5_Out_10|, main_~x~0=v_main_~x~0_Out_14, main_#t~post6=|v_main_#t~post6_Out_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1618#true} is VALID [2022-04-15 12:48:39,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {1618#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1618#true} is VALID [2022-04-15 12:48:39,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1618#true} call #t~ret11 := main(); {1618#true} is VALID [2022-04-15 12:48:39,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1618#true} {1618#true} #61#return; {1618#true} is VALID [2022-04-15 12:48:39,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 12:48:39,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1618#true} is VALID [2022-04-15 12:48:39,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1618#true} is VALID [2022-04-15 12:48:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:39,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777671381] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:39,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:39,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 12:48:39,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:39,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962268597] [2022-04-15 12:48:39,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962268597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:39,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:39,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:48:39,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220779563] [2022-04-15 12:48:39,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:39,869 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-15 12:48:39,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:39,869 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-15 12:48:39,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:39,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:48:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:39,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:48:39,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:48:39,884 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-15 12:48:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:40,219 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:48:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:48:40,219 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-15 12:48:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:40,219 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-15 12:48:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2022-04-15 12:48:40,220 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-15 12:48:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2022-04-15 12:48:40,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 28 transitions. [2022-04-15 12:48:40,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:40,249 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:48:40,249 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:48:40,249 INFO L912 BasicCegarLoop]: 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-15 12:48:40,250 INFO L913 BasicCegarLoop]: 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-15 12:48:40,250 INFO L914 BasicCegarLoop]: 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-15 12:48:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:48:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:48:40,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:40,268 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-15 12:48:40,268 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-15 12:48:40,269 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-15 12:48:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:40,269 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:48:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:48:40,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:40,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:40,270 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-15 12:48:40,270 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-15 12:48:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:40,270 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:48:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:48:40,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:40,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:40,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:40,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:40,271 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-15 12:48:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 12:48:40,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-04-15 12:48:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:40,271 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 12:48:40,271 INFO L479 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-15 12:48:40,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 12:48:40,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:48:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:48:40,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:40,299 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:40,319 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-15 12:48:40,499 WARN L460 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-15 12:48:40,500 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 4 times [2022-04-15 12:48:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:40,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520027503] [2022-04-15 12:48:40,627 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash 241557421, now seen corresponding path program 1 times [2022-04-15 12:48:40,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:40,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889259427] [2022-04-15 12:48:40,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:40,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {1901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1891#true} is VALID [2022-04-15 12:48:40,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {1891#true} assume true; {1891#true} is VALID [2022-04-15 12:48:40,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1891#true} {1891#true} #61#return; {1891#true} is VALID [2022-04-15 12:48:40,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {1891#true} call ULTIMATE.init(); {1901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:40,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {1901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1891#true} is VALID [2022-04-15 12:48:40,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {1891#true} assume true; {1891#true} is VALID [2022-04-15 12:48:40,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1891#true} {1891#true} #61#return; {1891#true} is VALID [2022-04-15 12:48:40,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {1891#true} call #t~ret11 := main(); {1891#true} is VALID [2022-04-15 12:48:40,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {1891#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1891#true} is VALID [2022-04-15 12:48:40,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {1891#true} [79] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_6)) (= |v_main_#t~post6_Out_12| 0) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~y~0_In_6 v_main_~y~0_Out_12) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1891#true} is VALID [2022-04-15 12:48:40,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {1891#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[] {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:40,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:40,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {1896#(<= 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; {1897#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:40,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {1897#(<= 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; {1898#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:40,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {1898#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1898#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:40,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#(<= 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; {1897#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:40,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {1897#(<= 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; {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:40,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:40,710 INFO L272 TraceCheckUtils]: 15: Hoare triple {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1899#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:48:40,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {1899#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1900#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:40,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1892#false} is VALID [2022-04-15 12:48:40,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {1892#false} assume !false; {1892#false} is VALID [2022-04-15 12:48:40,711 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-15 12:48:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889259427] [2022-04-15 12:48:40,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889259427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836926448] [2022-04-15 12:48:40,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:40,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:40,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:40,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:40,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:48:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:40,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:48:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:40,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:40,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {1891#true} call ULTIMATE.init(); {1891#true} is VALID [2022-04-15 12:48:40,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {1891#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1891#true} is VALID [2022-04-15 12:48:40,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {1891#true} assume true; {1891#true} is VALID [2022-04-15 12:48:40,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1891#true} {1891#true} #61#return; {1891#true} is VALID [2022-04-15 12:48:40,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {1891#true} call #t~ret11 := main(); {1891#true} is VALID [2022-04-15 12:48:40,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {1891#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1891#true} is VALID [2022-04-15 12:48:40,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {1891#true} [79] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_6)) (= |v_main_#t~post6_Out_12| 0) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~y~0_In_6 v_main_~y~0_Out_12) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1891#true} is VALID [2022-04-15 12:48:40,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {1891#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[] {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:40,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:40,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {1896#(<= 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; {1897#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:40,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {1897#(<= 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; {1898#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:40,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {1898#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1898#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:40,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#(<= 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; {1897#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:40,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {1897#(<= 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; {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:40,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:40,943 INFO L272 TraceCheckUtils]: 15: Hoare triple {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1950#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:40,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {1950#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1954#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:40,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {1954#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1892#false} is VALID [2022-04-15 12:48:40,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {1892#false} assume !false; {1892#false} is VALID [2022-04-15 12:48:40,944 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-15 12:48:40,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:41,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {1892#false} assume !false; {1892#false} is VALID [2022-04-15 12:48:41,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {1954#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1892#false} is VALID [2022-04-15 12:48:41,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {1950#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1954#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:41,169 INFO L272 TraceCheckUtils]: 15: Hoare triple {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1950#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:41,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:41,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {1897#(<= 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; {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:41,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#(<= 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; {1897#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:41,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {1898#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1898#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:41,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {1897#(<= 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; {1898#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:41,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {1896#(<= 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; {1897#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:41,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:41,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {1891#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[] {1896#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:41,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {1891#true} [79] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_12| 0) (< 0 (mod (+ v_main_~x~0_Out_16 1) 4294967296)) (= (+ v_main_~y~0_Out_12 v_main_~x~0_Out_16) (+ v_main_~x~0_In_8 v_main_~y~0_In_6)) (= |v_main_#t~post6_Out_12| 0) (<= v_main_~x~0_Out_16 v_main_~x~0_In_8)) (and (= v_main_~y~0_In_6 v_main_~y~0_Out_12) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_6} OutVars{main_~y~0=v_main_~y~0_Out_12, main_#t~post5=|v_main_#t~post5_Out_12|, main_~x~0=v_main_~x~0_Out_16, main_#t~post6=|v_main_#t~post6_Out_12|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1891#true} is VALID [2022-04-15 12:48:41,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {1891#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1891#true} is VALID [2022-04-15 12:48:41,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {1891#true} call #t~ret11 := main(); {1891#true} is VALID [2022-04-15 12:48:41,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1891#true} {1891#true} #61#return; {1891#true} is VALID [2022-04-15 12:48:41,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {1891#true} assume true; {1891#true} is VALID [2022-04-15 12:48:41,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {1891#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1891#true} is VALID [2022-04-15 12:48:41,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {1891#true} call ULTIMATE.init(); {1891#true} is VALID [2022-04-15 12:48:41,176 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-15 12:48:41,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836926448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:41,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:41,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-15 12:48:41,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:41,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520027503] [2022-04-15 12:48:41,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520027503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:41,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:41,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:48:41,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64499358] [2022-04-15 12:48:41,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:41,219 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-15 12:48:41,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:41,220 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-15 12:48:41,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:41,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:48:41,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:41,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:48:41,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:48:41,239 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-15 12:48:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:41,585 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 12:48:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:48:41,585 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-15 12:48:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:41,586 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-15 12:48:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 12:48:41,586 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-15 12:48:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 12:48:41,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-15 12:48:41,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:41,633 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:48:41,633 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:48:41,634 INFO L912 BasicCegarLoop]: 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-15 12:48:41,634 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:41,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 30 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:48:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:48:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2022-04-15 12:48:41,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:41,659 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-15 12:48:41,660 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-15 12:48:41,660 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-15 12:48:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:41,662 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 12:48:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-15 12:48:41,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:41,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:41,662 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-15 12:48:41,662 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-15 12:48:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:41,663 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 12:48:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-15 12:48:41,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:41,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:41,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:41,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:41,663 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-15 12:48:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-15 12:48:41,664 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2022-04-15 12:48:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:41,664 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-15 12:48:41,664 INFO L479 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-15 12:48:41,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-15 12:48:41,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 12:48:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:48:41,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:41,706 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:41,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:41,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 12:48:41,906 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash -676577280, now seen corresponding path program 5 times [2022-04-15 12:48:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:41,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452457160] [2022-04-15 12:48:42,044 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:42,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1629884576, now seen corresponding path program 1 times [2022-04-15 12:48:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:42,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346656747] [2022-04-15 12:48:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:42,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:42,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {2216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2205#true} is VALID [2022-04-15 12:48:42,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {2205#true} assume true; {2205#true} is VALID [2022-04-15 12:48:42,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2205#true} {2205#true} #61#return; {2205#true} is VALID [2022-04-15 12:48:42,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {2205#true} call ULTIMATE.init(); {2216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:42,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2205#true} is VALID [2022-04-15 12:48:42,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {2205#true} assume true; {2205#true} is VALID [2022-04-15 12:48:42,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2205#true} {2205#true} #61#return; {2205#true} is VALID [2022-04-15 12:48:42,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {2205#true} call #t~ret11 := main(); {2205#true} is VALID [2022-04-15 12:48:42,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {2205#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2205#true} is VALID [2022-04-15 12:48:42,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {2205#true} [81] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_14| 0) (= |v_main_#t~post6_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_18)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2205#true} is VALID [2022-04-15 12:48:42,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#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[] {2205#true} is VALID [2022-04-15 12:48:42,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {2205#true} ~z~0 := ~y~0; {2210#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:48:42,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {2210#(= 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; {2211#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:48:42,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {2211#(= (+ (- 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; {2212#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:42,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {2212#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2213#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:42,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {2213#(<= 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; {2214#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:42,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#(<= 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; {2215#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:42,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {2215#(<= 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; {2206#false} is VALID [2022-04-15 12:48:42,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {2206#false} assume !(~y~0 % 4294967296 > 0); {2206#false} is VALID [2022-04-15 12:48:42,162 INFO L272 TraceCheckUtils]: 16: Hoare triple {2206#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2206#false} is VALID [2022-04-15 12:48:42,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {2206#false} ~cond := #in~cond; {2206#false} is VALID [2022-04-15 12:48:42,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {2206#false} assume 0 == ~cond; {2206#false} is VALID [2022-04-15 12:48:42,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {2206#false} assume !false; {2206#false} is VALID [2022-04-15 12:48:42,162 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-15 12:48:42,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:42,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346656747] [2022-04-15 12:48:42,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346656747] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:42,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848040387] [2022-04-15 12:48:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:42,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:42,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:42,163 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:42,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:48:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:42,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:48:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:42,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:42,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {2205#true} call ULTIMATE.init(); {2205#true} is VALID [2022-04-15 12:48:42,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {2205#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2205#true} is VALID [2022-04-15 12:48:42,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {2205#true} assume true; {2205#true} is VALID [2022-04-15 12:48:42,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2205#true} {2205#true} #61#return; {2205#true} is VALID [2022-04-15 12:48:42,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {2205#true} call #t~ret11 := main(); {2205#true} is VALID [2022-04-15 12:48:42,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {2205#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2205#true} is VALID [2022-04-15 12:48:42,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {2205#true} [81] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_14| 0) (= |v_main_#t~post6_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_18)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2205#true} is VALID [2022-04-15 12:48:42,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#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[] {2205#true} is VALID [2022-04-15 12:48:42,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {2205#true} ~z~0 := ~y~0; {2210#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:48:42,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {2210#(= 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; {2211#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:48:42,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {2211#(= (+ (- 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; {2212#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:42,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {2212#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2213#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:42,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {2213#(<= 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; {2214#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:42,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#(<= 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; {2215#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {2215#(<= 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; {2206#false} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {2206#false} assume !(~y~0 % 4294967296 > 0); {2206#false} is VALID [2022-04-15 12:48:42,463 INFO L272 TraceCheckUtils]: 16: Hoare triple {2206#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2206#false} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {2206#false} ~cond := #in~cond; {2206#false} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {2206#false} assume 0 == ~cond; {2206#false} is VALID [2022-04-15 12:48:42,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {2206#false} assume !false; {2206#false} is VALID [2022-04-15 12:48:42,463 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-15 12:48:42,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:42,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {2206#false} assume !false; {2206#false} is VALID [2022-04-15 12:48:42,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {2206#false} assume 0 == ~cond; {2206#false} is VALID [2022-04-15 12:48:42,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {2206#false} ~cond := #in~cond; {2206#false} is VALID [2022-04-15 12:48:42,756 INFO L272 TraceCheckUtils]: 16: Hoare triple {2206#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2206#false} is VALID [2022-04-15 12:48:42,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {2206#false} assume !(~y~0 % 4294967296 > 0); {2206#false} is VALID [2022-04-15 12:48:42,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {2215#(<= 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; {2206#false} is VALID [2022-04-15 12:48:42,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#(<= 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; {2215#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:42,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {2213#(<= 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; {2214#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:42,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {2301#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2213#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:42,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {2305#(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; {2301#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 12:48:42,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {2309#(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; {2305#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:48:42,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {2205#true} ~z~0 := ~y~0; {2309#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 12:48:42,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#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[] {2205#true} is VALID [2022-04-15 12:48:42,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {2205#true} [81] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_7 v_main_~y~0_Out_14)) (and (<= v_main_~x~0_Out_18 v_main_~x~0_In_9) (= |v_main_#t~post5_Out_14| 0) (= |v_main_#t~post6_Out_14| 0) (< 0 (mod (+ v_main_~x~0_Out_18 1) 4294967296)) (= (+ v_main_~x~0_In_9 v_main_~y~0_In_7) (+ v_main_~y~0_Out_14 v_main_~x~0_Out_18)))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_7} OutVars{main_~y~0=v_main_~y~0_Out_14, main_#t~post5=|v_main_#t~post5_Out_14|, main_~x~0=v_main_~x~0_Out_18, main_#t~post6=|v_main_#t~post6_Out_14|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2205#true} is VALID [2022-04-15 12:48:42,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {2205#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2205#true} is VALID [2022-04-15 12:48:42,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {2205#true} call #t~ret11 := main(); {2205#true} is VALID [2022-04-15 12:48:42,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2205#true} {2205#true} #61#return; {2205#true} is VALID [2022-04-15 12:48:42,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {2205#true} assume true; {2205#true} is VALID [2022-04-15 12:48:42,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {2205#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2205#true} is VALID [2022-04-15 12:48:42,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {2205#true} call ULTIMATE.init(); {2205#true} is VALID [2022-04-15 12:48:42,763 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-15 12:48:42,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848040387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:42,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:42,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-15 12:48:42,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:42,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452457160] [2022-04-15 12:48:42,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452457160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:42,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:42,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:48:42,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902794726] [2022-04-15 12:48:42,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:42,818 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:48:42,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:42,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:42,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:42,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:48:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:48:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:48:42,836 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-15 12:48:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:43,409 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 12:48:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:48:43,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:48:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2022-04-15 12:48:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2022-04-15 12:48:43,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 41 transitions. [2022-04-15 12:48:43,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:43,459 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:48:43,459 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:48:43,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:48:43,460 INFO L913 BasicCegarLoop]: 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-15 12:48:43,460 INFO L914 BasicCegarLoop]: 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-15 12:48:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:48:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:48:43,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:43,485 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-15 12:48:43,485 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-15 12:48:43,485 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-15 12:48:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:43,486 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:48:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:48:43,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:43,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:43,486 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-15 12:48:43,486 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-15 12:48:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:43,487 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:48:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:48:43,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:43,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:43,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:43,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:43,487 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-15 12:48:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 12:48:43,487 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2022-04-15 12:48:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:43,488 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 12:48:43,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:43,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 12:48:43,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:48:43,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:48:43,523 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:43,523 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:43,539 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-15 12:48:43,724 WARN L460 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-15 12:48:43,724 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1250397230, now seen corresponding path program 6 times [2022-04-15 12:48:43,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:43,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618425195] [2022-04-15 12:48:43,860 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:43,861 INFO L85 PathProgramCache]: Analyzing trace with hash -469678193, now seen corresponding path program 1 times [2022-04-15 12:48:43,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:43,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059584988] [2022-04-15 12:48:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:43,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:43,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:43,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {2549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2538#true} is VALID [2022-04-15 12:48:43,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-15 12:48:43,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2538#true} {2538#true} #61#return; {2538#true} is VALID [2022-04-15 12:48:43,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {2538#true} call ULTIMATE.init(); {2549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:43,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2538#true} is VALID [2022-04-15 12:48:43,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-15 12:48:43,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2538#true} {2538#true} #61#return; {2538#true} is VALID [2022-04-15 12:48:43,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {2538#true} call #t~ret11 := main(); {2538#true} is VALID [2022-04-15 12:48:43,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {2538#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2538#true} is VALID [2022-04-15 12:48:43,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {2538#true} [83] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_8)) (= |v_main_#t~post6_Out_16| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2538#true} is VALID [2022-04-15 12:48:43,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {2538#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[] {2538#true} is VALID [2022-04-15 12:48:43,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {2538#true} ~z~0 := ~y~0; {2543#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:48:43,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {2543#(= 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; {2544#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:48:43,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {2544#(= (+ (- 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; {2545#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:43,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {2545#(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; {2546#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:48:43,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {2546#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2546#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:48:43,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(<= 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; {2547#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:43,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {2547#(<= 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; {2548#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:43,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2539#false} is VALID [2022-04-15 12:48:43,970 INFO L272 TraceCheckUtils]: 16: Hoare triple {2539#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2539#false} is VALID [2022-04-15 12:48:43,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {2539#false} ~cond := #in~cond; {2539#false} is VALID [2022-04-15 12:48:43,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {2539#false} assume 0 == ~cond; {2539#false} is VALID [2022-04-15 12:48:43,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {2539#false} assume !false; {2539#false} is VALID [2022-04-15 12:48:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:43,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:43,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059584988] [2022-04-15 12:48:43,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059584988] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:43,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894891211] [2022-04-15 12:48:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:43,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:43,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:43,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:43,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:48:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:44,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:48:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:44,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:44,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {2538#true} call ULTIMATE.init(); {2538#true} is VALID [2022-04-15 12:48:44,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {2538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2538#true} is VALID [2022-04-15 12:48:44,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-15 12:48:44,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2538#true} {2538#true} #61#return; {2538#true} is VALID [2022-04-15 12:48:44,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {2538#true} call #t~ret11 := main(); {2538#true} is VALID [2022-04-15 12:48:44,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {2538#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2538#true} is VALID [2022-04-15 12:48:44,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {2538#true} [83] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_8)) (= |v_main_#t~post6_Out_16| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2538#true} is VALID [2022-04-15 12:48:44,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {2538#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[] {2538#true} is VALID [2022-04-15 12:48:44,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {2538#true} ~z~0 := ~y~0; {2543#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:48:44,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {2543#(= 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; {2544#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:48:44,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {2544#(= (+ (- 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; {2545#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:44,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {2545#(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; {2546#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:48:44,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {2546#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2546#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:48:44,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(<= 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; {2547#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:44,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {2547#(<= 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; {2548#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:44,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2539#false} is VALID [2022-04-15 12:48:44,316 INFO L272 TraceCheckUtils]: 16: Hoare triple {2539#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2539#false} is VALID [2022-04-15 12:48:44,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {2539#false} ~cond := #in~cond; {2539#false} is VALID [2022-04-15 12:48:44,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {2539#false} assume 0 == ~cond; {2539#false} is VALID [2022-04-15 12:48:44,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {2539#false} assume !false; {2539#false} is VALID [2022-04-15 12:48:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:44,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:44,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {2539#false} assume !false; {2539#false} is VALID [2022-04-15 12:48:44,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {2539#false} assume 0 == ~cond; {2539#false} is VALID [2022-04-15 12:48:44,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {2539#false} ~cond := #in~cond; {2539#false} is VALID [2022-04-15 12:48:44,588 INFO L272 TraceCheckUtils]: 16: Hoare triple {2539#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2539#false} is VALID [2022-04-15 12:48:44,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2539#false} is VALID [2022-04-15 12:48:44,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {2547#(<= 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; {2548#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:44,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(<= 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; {2547#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:44,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {2546#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2546#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:48:44,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {2634#(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; {2546#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:48:44,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {2638#(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; {2634#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:48:44,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {2642#(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; {2638#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} is VALID [2022-04-15 12:48:44,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {2538#true} ~z~0 := ~y~0; {2642#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:48:44,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {2538#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[] {2538#true} is VALID [2022-04-15 12:48:44,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {2538#true} [83] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (and (= |v_main_#t~post5_Out_16| 0) (< 0 (mod (+ v_main_~x~0_Out_20 1) 4294967296)) (= (+ v_main_~y~0_Out_16 v_main_~x~0_Out_20) (+ v_main_~x~0_In_10 v_main_~y~0_In_8)) (= |v_main_#t~post6_Out_16| 0) (<= v_main_~x~0_Out_20 v_main_~x~0_In_10))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_8} OutVars{main_~y~0=v_main_~y~0_Out_16, main_#t~post5=|v_main_#t~post5_Out_16|, main_~x~0=v_main_~x~0_Out_20, main_#t~post6=|v_main_#t~post6_Out_16|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2538#true} is VALID [2022-04-15 12:48:44,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {2538#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2538#true} is VALID [2022-04-15 12:48:44,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {2538#true} call #t~ret11 := main(); {2538#true} is VALID [2022-04-15 12:48:44,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2538#true} {2538#true} #61#return; {2538#true} is VALID [2022-04-15 12:48:44,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-15 12:48:44,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {2538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2538#true} is VALID [2022-04-15 12:48:44,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {2538#true} call ULTIMATE.init(); {2538#true} is VALID [2022-04-15 12:48:44,596 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-15 12:48:44,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894891211] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:44,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:44,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-15 12:48:44,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:44,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618425195] [2022-04-15 12:48:44,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618425195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:44,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:44,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:48:44,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812941396] [2022-04-15 12:48:44,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:44,693 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-15 12:48:44,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:44,693 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-15 12:48:44,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:44,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:48:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:48:44,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:48:44,717 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-15 12:48:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:45,335 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:48:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:48:45,336 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-15 12:48:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:45,336 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-15 12:48:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2022-04-15 12:48:45,338 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-15 12:48:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2022-04-15 12:48:45,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 31 transitions. [2022-04-15 12:48:45,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:45,378 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:48:45,379 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:48:45,379 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:48:45,379 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:45,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 56 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:48:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:48:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 12:48:45,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:45,409 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-15 12:48:45,409 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-15 12:48:45,409 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-15 12:48:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:45,409 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:48:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:48:45,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:45,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:45,410 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-15 12:48:45,410 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-15 12:48:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:45,410 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 12:48:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:48:45,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:45,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:45,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:45,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:45,410 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-15 12:48:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 12:48:45,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2022-04-15 12:48:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:45,411 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 12:48:45,411 INFO L479 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-15 12:48:45,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 12:48:45,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 12:48:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:48:45,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:45,459 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:45,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:45,659 WARN L460 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-15 12:48:45,659 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 7 times [2022-04-15 12:48:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:45,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1927307888] [2022-04-15 12:48:45,764 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:45,765 INFO L85 PathProgramCache]: Analyzing trace with hash 363359358, now seen corresponding path program 1 times [2022-04-15 12:48:45,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:45,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102801636] [2022-04-15 12:48:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:45,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:45,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {2862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2851#true} is VALID [2022-04-15 12:48:45,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {2851#true} assume true; {2851#true} is VALID [2022-04-15 12:48:45,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2851#true} {2851#true} #61#return; {2851#true} is VALID [2022-04-15 12:48:45,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {2851#true} call ULTIMATE.init(); {2862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:45,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {2862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2851#true} is VALID [2022-04-15 12:48:45,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {2851#true} assume true; {2851#true} is VALID [2022-04-15 12:48:45,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2851#true} {2851#true} #61#return; {2851#true} is VALID [2022-04-15 12:48:45,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {2851#true} call #t~ret11 := main(); {2851#true} is VALID [2022-04-15 12:48:45,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {2851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2851#true} is VALID [2022-04-15 12:48:45,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {2851#true} [85] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_22) (+ v_main_~x~0_In_11 v_main_~y~0_In_9)))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2851#true} is VALID [2022-04-15 12:48:45,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {2851#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[] {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:45,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:45,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {2856#(<= 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; {2857#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:45,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {2857#(<= 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; {2858#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:45,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {2858#(<= 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; {2859#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:45,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {2859#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2859#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:45,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {2859#(<= 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; {2858#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:45,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {2858#(<= 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; {2857#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:45,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {2857#(<= 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; {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:45,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:45,877 INFO L272 TraceCheckUtils]: 17: Hoare triple {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:48:45,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {2860#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2861#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:45,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {2861#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2852#false} is VALID [2022-04-15 12:48:45,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#false} assume !false; {2852#false} is VALID [2022-04-15 12:48:45,878 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-15 12:48:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:45,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102801636] [2022-04-15 12:48:45,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102801636] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:45,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638854022] [2022-04-15 12:48:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:45,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:45,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:45,880 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:45,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:48:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:45,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:48:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:45,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:46,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {2851#true} call ULTIMATE.init(); {2851#true} is VALID [2022-04-15 12:48:46,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {2851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2851#true} is VALID [2022-04-15 12:48:46,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {2851#true} assume true; {2851#true} is VALID [2022-04-15 12:48:46,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2851#true} {2851#true} #61#return; {2851#true} is VALID [2022-04-15 12:48:46,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {2851#true} call #t~ret11 := main(); {2851#true} is VALID [2022-04-15 12:48:46,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {2851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2851#true} is VALID [2022-04-15 12:48:46,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {2851#true} [85] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_22) (+ v_main_~x~0_In_11 v_main_~y~0_In_9)))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2851#true} is VALID [2022-04-15 12:48:46,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {2851#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[] {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:46,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:46,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {2856#(<= 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; {2857#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:46,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {2857#(<= 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; {2858#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:46,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {2858#(<= 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; {2859#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:46,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {2859#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2859#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:46,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {2859#(<= 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; {2858#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:46,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {2858#(<= 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; {2857#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:46,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {2857#(<= 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; {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:46,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:46,149 INFO L272 TraceCheckUtils]: 17: Hoare triple {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:46,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {2917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:46,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2852#false} is VALID [2022-04-15 12:48:46,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#false} assume !false; {2852#false} is VALID [2022-04-15 12:48:46,150 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-15 12:48:46,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:46,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {2852#false} assume !false; {2852#false} is VALID [2022-04-15 12:48:46,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {2921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2852#false} is VALID [2022-04-15 12:48:46,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {2917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:46,360 INFO L272 TraceCheckUtils]: 17: Hoare triple {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:46,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:46,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {2857#(<= 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; {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:46,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {2858#(<= 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; {2857#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:46,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {2859#(<= 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; {2858#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:46,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {2859#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2859#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:46,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {2858#(<= 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; {2859#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:46,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {2857#(<= 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; {2858#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:46,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {2856#(<= 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; {2857#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:46,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:46,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {2851#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[] {2856#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:46,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {2851#true} [85] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_11 v_main_~x~0_Out_22)) (and (= |v_main_#t~post5_Out_18| 0) (= |v_main_#t~post6_Out_18| 0) (< 0 (mod (+ v_main_~x~0_Out_22 1) 4294967296)) (<= v_main_~x~0_Out_22 v_main_~x~0_In_11) (= (+ v_main_~y~0_Out_18 v_main_~x~0_Out_22) (+ v_main_~x~0_In_11 v_main_~y~0_In_9)))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_9} OutVars{main_~y~0=v_main_~y~0_Out_18, main_#t~post5=|v_main_#t~post5_Out_18|, main_~x~0=v_main_~x~0_Out_22, main_#t~post6=|v_main_#t~post6_Out_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2851#true} is VALID [2022-04-15 12:48:46,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {2851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2851#true} is VALID [2022-04-15 12:48:46,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {2851#true} call #t~ret11 := main(); {2851#true} is VALID [2022-04-15 12:48:46,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2851#true} {2851#true} #61#return; {2851#true} is VALID [2022-04-15 12:48:46,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {2851#true} assume true; {2851#true} is VALID [2022-04-15 12:48:46,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {2851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2851#true} is VALID [2022-04-15 12:48:46,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {2851#true} call ULTIMATE.init(); {2851#true} is VALID [2022-04-15 12:48:46,387 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-15 12:48:46,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638854022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:46,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:46,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-15 12:48:46,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:46,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1927307888] [2022-04-15 12:48:46,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1927307888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:46,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:46,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:48:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567041452] [2022-04-15 12:48:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:46,467 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-15 12:48:46,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:46,468 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-15 12:48:46,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:46,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:48:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:46,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:48:46,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:48:46,491 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-15 12:48:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:47,078 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-15 12:48:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:48:47,079 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-15 12:48:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:47,079 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-15 12:48:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-15 12:48:47,080 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-15 12:48:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-15 12:48:47,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-15 12:48:47,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:47,139 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:48:47,139 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:48:47,140 INFO L912 BasicCegarLoop]: 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-15 12:48:47,140 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:47,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 50 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:48:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:48:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2022-04-15 12:48:47,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:47,175 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-15 12:48:47,175 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-15 12:48:47,176 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-15 12:48:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:47,176 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 12:48:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 12:48:47,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:47,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:47,177 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-15 12:48:47,177 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-15 12:48:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:47,177 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 12:48:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 12:48:47,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:47,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:47,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:47,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:47,177 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-15 12:48:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-15 12:48:47,178 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2022-04-15 12:48:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:47,178 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-15 12:48:47,178 INFO L479 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-15 12:48:47,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-15 12:48:47,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 12:48:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:48:47,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:47,236 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:47,252 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-15 12:48:47,444 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 12:48:47,444 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:47,445 INFO L85 PathProgramCache]: Analyzing trace with hash 144737870, now seen corresponding path program 8 times [2022-04-15 12:48:47,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:47,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1959151030] [2022-04-15 12:48:47,569 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash 407768559, now seen corresponding path program 1 times [2022-04-15 12:48:47,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:47,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518712232] [2022-04-15 12:48:47,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:47,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:47,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {3226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3213#true} is VALID [2022-04-15 12:48:47,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {3213#true} assume true; {3213#true} is VALID [2022-04-15 12:48:47,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3213#true} {3213#true} #61#return; {3213#true} is VALID [2022-04-15 12:48:47,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {3213#true} call ULTIMATE.init(); {3226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:47,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {3226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3213#true} is VALID [2022-04-15 12:48:47,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {3213#true} assume true; {3213#true} is VALID [2022-04-15 12:48:47,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3213#true} {3213#true} #61#return; {3213#true} is VALID [2022-04-15 12:48:47,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {3213#true} call #t~ret11 := main(); {3213#true} is VALID [2022-04-15 12:48:47,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {3213#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3213#true} is VALID [2022-04-15 12:48:47,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {3213#true} [87] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_10)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3213#true} is VALID [2022-04-15 12:48:47,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {3213#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[] {3213#true} is VALID [2022-04-15 12:48:47,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {3213#true} ~z~0 := ~y~0; {3218#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:48:47,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {3218#(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; {3219#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:48:47,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {3219#(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; {3220#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:47,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {3220#(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; {3221#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:48:47,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {3221#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {3222#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:47,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {3222#(<= 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; {3223#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:47,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {3223#(<= 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; {3224#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:47,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {3224#(<= 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; {3225#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:47,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {3225#(<= 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; {3214#false} is VALID [2022-04-15 12:48:47,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {3214#false} assume !(~y~0 % 4294967296 > 0); {3214#false} is VALID [2022-04-15 12:48:47,709 INFO L272 TraceCheckUtils]: 18: Hoare triple {3214#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3214#false} is VALID [2022-04-15 12:48:47,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {3214#false} ~cond := #in~cond; {3214#false} is VALID [2022-04-15 12:48:47,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {3214#false} assume 0 == ~cond; {3214#false} is VALID [2022-04-15 12:48:47,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {3214#false} assume !false; {3214#false} is VALID [2022-04-15 12:48:47,709 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-15 12:48:47,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:47,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518712232] [2022-04-15 12:48:47,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518712232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:47,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765728978] [2022-04-15 12:48:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:47,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:47,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:47,710 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:47,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:48:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:47,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:48:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:47,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:48,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {3213#true} call ULTIMATE.init(); {3213#true} is VALID [2022-04-15 12:48:48,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {3213#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3213#true} is VALID [2022-04-15 12:48:48,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {3213#true} assume true; {3213#true} is VALID [2022-04-15 12:48:48,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3213#true} {3213#true} #61#return; {3213#true} is VALID [2022-04-15 12:48:48,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {3213#true} call #t~ret11 := main(); {3213#true} is VALID [2022-04-15 12:48:48,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {3213#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3213#true} is VALID [2022-04-15 12:48:48,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {3213#true} [87] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_10)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3213#true} is VALID [2022-04-15 12:48:48,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {3213#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[] {3213#true} is VALID [2022-04-15 12:48:48,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {3213#true} ~z~0 := ~y~0; {3218#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:48:48,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {3218#(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; {3219#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:48:48,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {3219#(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; {3220#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:48,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {3220#(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; {3221#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:48:48,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {3221#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {3222#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:48,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {3222#(<= 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; {3223#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:48,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {3223#(<= 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; {3224#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:48,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {3224#(<= 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; {3225#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:48,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {3225#(<= 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; {3214#false} is VALID [2022-04-15 12:48:48,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {3214#false} assume !(~y~0 % 4294967296 > 0); {3214#false} is VALID [2022-04-15 12:48:48,047 INFO L272 TraceCheckUtils]: 18: Hoare triple {3214#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3214#false} is VALID [2022-04-15 12:48:48,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {3214#false} ~cond := #in~cond; {3214#false} is VALID [2022-04-15 12:48:48,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {3214#false} assume 0 == ~cond; {3214#false} is VALID [2022-04-15 12:48:48,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {3214#false} assume !false; {3214#false} is VALID [2022-04-15 12:48:48,047 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-15 12:48:48,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:48,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {3214#false} assume !false; {3214#false} is VALID [2022-04-15 12:48:48,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {3214#false} assume 0 == ~cond; {3214#false} is VALID [2022-04-15 12:48:48,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {3214#false} ~cond := #in~cond; {3214#false} is VALID [2022-04-15 12:48:48,414 INFO L272 TraceCheckUtils]: 18: Hoare triple {3214#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3214#false} is VALID [2022-04-15 12:48:48,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {3214#false} assume !(~y~0 % 4294967296 > 0); {3214#false} is VALID [2022-04-15 12:48:48,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {3225#(<= 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; {3214#false} is VALID [2022-04-15 12:48:48,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {3224#(<= 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; {3225#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:48,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {3223#(<= 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; {3224#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:48,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {3222#(<= 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; {3223#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:48,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {3320#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3222#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:48,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {3324#(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; {3320#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:48:48,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {3328#(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; {3324#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:48:48,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {3332#(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; {3328#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:48:48,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {3213#true} ~z~0 := ~y~0; {3332#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:48:48,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {3213#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[] {3213#true} is VALID [2022-04-15 12:48:48,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {3213#true} [87] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_20| 0) (< 0 (mod (+ v_main_~x~0_Out_24 1) 4294967296)) (= |v_main_#t~post6_Out_20| 0) (= (+ v_main_~y~0_Out_20 v_main_~x~0_Out_24) (+ v_main_~x~0_In_12 v_main_~y~0_In_10)) (<= v_main_~x~0_Out_24 v_main_~x~0_In_12)) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= v_main_~x~0_In_12 v_main_~x~0_Out_24))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_10} OutVars{main_~y~0=v_main_~y~0_Out_20, main_#t~post5=|v_main_#t~post5_Out_20|, main_~x~0=v_main_~x~0_Out_24, main_#t~post6=|v_main_#t~post6_Out_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3213#true} is VALID [2022-04-15 12:48:48,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {3213#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3213#true} is VALID [2022-04-15 12:48:48,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {3213#true} call #t~ret11 := main(); {3213#true} is VALID [2022-04-15 12:48:48,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3213#true} {3213#true} #61#return; {3213#true} is VALID [2022-04-15 12:48:48,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {3213#true} assume true; {3213#true} is VALID [2022-04-15 12:48:48,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {3213#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3213#true} is VALID [2022-04-15 12:48:48,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {3213#true} call ULTIMATE.init(); {3213#true} is VALID [2022-04-15 12:48:48,424 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-15 12:48:48,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765728978] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:48,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:48,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-15 12:48:48,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:48,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1959151030] [2022-04-15 12:48:48,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1959151030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:48,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:48,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:48:48,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532840990] [2022-04-15 12:48:48,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:48,533 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-15 12:48:48,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:48,533 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-15 12:48:48,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:48,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:48:48,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:48,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:48:48,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:48:48,560 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-15 12:48:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:49,582 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 12:48:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:48:49,582 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-15 12:48:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:49,582 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-15 12:48:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2022-04-15 12:48:49,583 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-15 12:48:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2022-04-15 12:48:49,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 45 transitions. [2022-04-15 12:48:49,652 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-15 12:48:49,653 INFO L225 Difference]: With dead ends: 45 [2022-04-15 12:48:49,653 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:48:49,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:48:49,654 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:49,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 63 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:48:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:48:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 12:48:49,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:49,689 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-15 12:48:49,689 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-15 12:48:49,689 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-15 12:48:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:49,689 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:48:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:48:49,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:49,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:49,690 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-15 12:48:49,690 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-15 12:48:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:49,690 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 12:48:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:48:49,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:49,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:49,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:49,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:49,690 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-15 12:48:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 12:48:49,691 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2022-04-15 12:48:49,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:49,691 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 12:48:49,691 INFO L479 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-15 12:48:49,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 12:48:49,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:48:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:48:49,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:49,755 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:49,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:49,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 12:48:49,956 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash -405165152, now seen corresponding path program 9 times [2022-04-15 12:48:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:49,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661252178] [2022-04-15 12:48:50,078 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash -264118944, now seen corresponding path program 1 times [2022-04-15 12:48:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:50,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662137137] [2022-04-15 12:48:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:50,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:50,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {3607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3594#true} is VALID [2022-04-15 12:48:50,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {3594#true} assume true; {3594#true} is VALID [2022-04-15 12:48:50,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3594#true} {3594#true} #61#return; {3594#true} is VALID [2022-04-15 12:48:50,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {3594#true} call ULTIMATE.init(); {3607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:50,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {3607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3594#true} is VALID [2022-04-15 12:48:50,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {3594#true} assume true; {3594#true} is VALID [2022-04-15 12:48:50,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3594#true} {3594#true} #61#return; {3594#true} is VALID [2022-04-15 12:48:50,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {3594#true} call #t~ret11 := main(); {3594#true} is VALID [2022-04-15 12:48:50,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {3594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3594#true} is VALID [2022-04-15 12:48:50,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {3594#true} [89] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) (and (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= |v_main_#t~post6_Out_22| 0) (= |v_main_#t~post5_Out_22| 0) (= (+ v_main_~y~0_Out_22 v_main_~x~0_Out_26) (+ v_main_~x~0_In_13 v_main_~y~0_In_11)))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3594#true} is VALID [2022-04-15 12:48:50,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {3594#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[] {3594#true} is VALID [2022-04-15 12:48:50,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {3594#true} ~z~0 := ~y~0; {3599#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:48:50,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {3599#(= 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; {3600#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:48:50,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {3600#(= (+ (- 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; {3601#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:50,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {3601#(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; {3602#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:48:50,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {3602#(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; {3603#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:48:50,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {3603#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3603#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:48:50,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {3603#(<= 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; {3604#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:48:50,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {3604#(<= 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; {3605#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:50,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {3605#(<= 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; {3606#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:50,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {3606#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3595#false} is VALID [2022-04-15 12:48:50,211 INFO L272 TraceCheckUtils]: 18: Hoare triple {3595#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3595#false} is VALID [2022-04-15 12:48:50,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {3595#false} ~cond := #in~cond; {3595#false} is VALID [2022-04-15 12:48:50,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {3595#false} assume 0 == ~cond; {3595#false} is VALID [2022-04-15 12:48:50,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {3595#false} assume !false; {3595#false} is VALID [2022-04-15 12:48:50,211 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-15 12:48:50,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:50,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662137137] [2022-04-15 12:48:50,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662137137] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:50,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554557183] [2022-04-15 12:48:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:50,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:50,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:50,213 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:50,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:48:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:50,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:48:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:50,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:50,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {3594#true} call ULTIMATE.init(); {3594#true} is VALID [2022-04-15 12:48:50,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {3594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3594#true} is VALID [2022-04-15 12:48:50,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {3594#true} assume true; {3594#true} is VALID [2022-04-15 12:48:50,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3594#true} {3594#true} #61#return; {3594#true} is VALID [2022-04-15 12:48:50,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {3594#true} call #t~ret11 := main(); {3594#true} is VALID [2022-04-15 12:48:50,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {3594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3594#true} is VALID [2022-04-15 12:48:50,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {3594#true} [89] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) (and (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= |v_main_#t~post6_Out_22| 0) (= |v_main_#t~post5_Out_22| 0) (= (+ v_main_~y~0_Out_22 v_main_~x~0_Out_26) (+ v_main_~x~0_In_13 v_main_~y~0_In_11)))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3594#true} is VALID [2022-04-15 12:48:50,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {3594#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[] {3594#true} is VALID [2022-04-15 12:48:50,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {3594#true} ~z~0 := ~y~0; {3599#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:48:50,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {3599#(= 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; {3600#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:48:50,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {3600#(= (+ (- 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; {3601#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:50,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {3601#(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; {3602#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:48:50,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {3602#(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; {3603#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:48:50,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {3603#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3603#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:48:50,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {3603#(<= 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; {3604#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:48:50,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {3604#(<= 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; {3605#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:50,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {3605#(<= 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; {3606#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:50,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {3606#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3595#false} is VALID [2022-04-15 12:48:50,635 INFO L272 TraceCheckUtils]: 18: Hoare triple {3595#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3595#false} is VALID [2022-04-15 12:48:50,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {3595#false} ~cond := #in~cond; {3595#false} is VALID [2022-04-15 12:48:50,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {3595#false} assume 0 == ~cond; {3595#false} is VALID [2022-04-15 12:48:50,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {3595#false} assume !false; {3595#false} is VALID [2022-04-15 12:48:50,635 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-15 12:48:50,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:50,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {3595#false} assume !false; {3595#false} is VALID [2022-04-15 12:48:50,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {3595#false} assume 0 == ~cond; {3595#false} is VALID [2022-04-15 12:48:50,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {3595#false} ~cond := #in~cond; {3595#false} is VALID [2022-04-15 12:48:50,964 INFO L272 TraceCheckUtils]: 18: Hoare triple {3595#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3595#false} is VALID [2022-04-15 12:48:50,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {3606#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3595#false} is VALID [2022-04-15 12:48:50,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {3605#(<= 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; {3606#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:50,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {3604#(<= 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; {3605#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:50,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {3603#(<= 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; {3604#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:48:50,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {3603#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3603#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:48:50,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {3701#(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; {3603#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:48:50,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {3705#(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; {3701#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:48:50,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {3709#(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; {3705#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:48:50,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {3713#(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; {3709#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:48:50,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {3594#true} ~z~0 := ~y~0; {3713#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 12:48:50,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {3594#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[] {3594#true} is VALID [2022-04-15 12:48:50,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {3594#true} [89] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) (and (< 0 (mod (+ v_main_~x~0_Out_26 1) 4294967296)) (<= v_main_~x~0_Out_26 v_main_~x~0_In_13) (= |v_main_#t~post6_Out_22| 0) (= |v_main_#t~post5_Out_22| 0) (= (+ v_main_~y~0_Out_22 v_main_~x~0_Out_26) (+ v_main_~x~0_In_13 v_main_~y~0_In_11)))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_11} OutVars{main_~y~0=v_main_~y~0_Out_22, main_#t~post5=|v_main_#t~post5_Out_22|, main_~x~0=v_main_~x~0_Out_26, main_#t~post6=|v_main_#t~post6_Out_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3594#true} is VALID [2022-04-15 12:48:50,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {3594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3594#true} is VALID [2022-04-15 12:48:50,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {3594#true} call #t~ret11 := main(); {3594#true} is VALID [2022-04-15 12:48:50,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3594#true} {3594#true} #61#return; {3594#true} is VALID [2022-04-15 12:48:50,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {3594#true} assume true; {3594#true} is VALID [2022-04-15 12:48:50,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {3594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3594#true} is VALID [2022-04-15 12:48:50,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {3594#true} call ULTIMATE.init(); {3594#true} is VALID [2022-04-15 12:48:50,976 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-15 12:48:50,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554557183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:50,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:50,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-15 12:48:51,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:51,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661252178] [2022-04-15 12:48:51,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661252178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:51,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:51,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:48:51,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40947073] [2022-04-15 12:48:51,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:51,147 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-15 12:48:51,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:51,147 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-15 12:48:51,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:51,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:48:51,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:51,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:48:51,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:48:51,193 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-15 12:48:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:52,665 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 12:48:52,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:48:52,665 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-15 12:48:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:52,665 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-15 12:48:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. [2022-04-15 12:48:52,666 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-15 12:48:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. [2022-04-15 12:48:52,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 34 transitions. [2022-04-15 12:48:52,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:52,753 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:48:52,753 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:48:52,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:48:52,753 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:52,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 71 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:48:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:48:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:48:52,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:52,793 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-15 12:48:52,793 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-15 12:48:52,793 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-15 12:48:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:52,794 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:48:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:48:52,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:52,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:52,794 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-15 12:48:52,794 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-15 12:48:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:52,794 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:48:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:48:52,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:52,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:52,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:52,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:52,795 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-15 12:48:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 12:48:52,795 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-04-15 12:48:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:52,795 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 12:48:52,795 INFO L479 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-15 12:48:52,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 12:48:52,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:48:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:48:52,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:52,905 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:52,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:53,105 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 12:48:53,105 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:53,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:53,106 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 10 times [2022-04-15 12:48:53,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:53,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [713200315] [2022-04-15 12:48:53,226 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2122293453, now seen corresponding path program 1 times [2022-04-15 12:48:53,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:53,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278024712] [2022-04-15 12:48:53,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:53,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:53,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {3959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3947#true} is VALID [2022-04-15 12:48:53,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {3947#true} assume true; {3947#true} is VALID [2022-04-15 12:48:53,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3947#true} {3947#true} #61#return; {3947#true} is VALID [2022-04-15 12:48:53,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {3947#true} call ULTIMATE.init(); {3959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:53,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {3959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3947#true} is VALID [2022-04-15 12:48:53,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {3947#true} assume true; {3947#true} is VALID [2022-04-15 12:48:53,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3947#true} {3947#true} #61#return; {3947#true} is VALID [2022-04-15 12:48:53,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {3947#true} call #t~ret11 := main(); {3947#true} is VALID [2022-04-15 12:48:53,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {3947#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3947#true} is VALID [2022-04-15 12:48:53,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {3947#true} [91] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post6_Out_24| 0) (= (+ v_main_~x~0_In_14 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_28)))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3947#true} is VALID [2022-04-15 12:48:53,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {3947#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[] {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {3952#(<= 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; {3953#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:53,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {3953#(<= 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; {3954#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {3954#(<= 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; {3955#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {3955#(<= 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; {3956#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {3956#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3956#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {3956#(<= 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; {3955#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {3955#(<= 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; {3954#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {3954#(<= 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; {3953#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:53,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {3953#(<= 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; {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,371 INFO L272 TraceCheckUtils]: 19: Hoare triple {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:48:53,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {3957#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3958#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:53,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {3958#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3948#false} is VALID [2022-04-15 12:48:53,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {3948#false} assume !false; {3948#false} is VALID [2022-04-15 12:48:53,372 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-15 12:48:53,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:53,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278024712] [2022-04-15 12:48:53,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278024712] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:53,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364265710] [2022-04-15 12:48:53,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:53,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:53,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:53,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:53,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:48:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:53,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:48:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:53,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:53,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {3947#true} call ULTIMATE.init(); {3947#true} is VALID [2022-04-15 12:48:53,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {3947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3947#true} is VALID [2022-04-15 12:48:53,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {3947#true} assume true; {3947#true} is VALID [2022-04-15 12:48:53,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3947#true} {3947#true} #61#return; {3947#true} is VALID [2022-04-15 12:48:53,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {3947#true} call #t~ret11 := main(); {3947#true} is VALID [2022-04-15 12:48:53,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {3947#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3947#true} is VALID [2022-04-15 12:48:53,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {3947#true} [91] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post6_Out_24| 0) (= (+ v_main_~x~0_In_14 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_28)))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3947#true} is VALID [2022-04-15 12:48:53,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {3947#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[] {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {3952#(<= 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; {3953#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:53,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {3953#(<= 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; {3954#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {3954#(<= 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; {3955#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {3955#(<= 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; {3956#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {3956#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3956#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {3956#(<= 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; {3955#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {3955#(<= 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; {3954#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {3954#(<= 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; {3953#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:53,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {3953#(<= 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; {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,651 INFO L272 TraceCheckUtils]: 19: Hoare triple {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4020#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:53,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {4020#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4024#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:53,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {4024#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3948#false} is VALID [2022-04-15 12:48:53,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {3948#false} assume !false; {3948#false} is VALID [2022-04-15 12:48:53,653 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-15 12:48:53,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:53,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {3948#false} assume !false; {3948#false} is VALID [2022-04-15 12:48:53,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {4024#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3948#false} is VALID [2022-04-15 12:48:53,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {4020#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4024#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:48:53,906 INFO L272 TraceCheckUtils]: 19: Hoare triple {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4020#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:53,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {3953#(<= 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; {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {3954#(<= 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; {3953#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:53,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {3955#(<= 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; {3954#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {3956#(<= 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; {3955#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {3956#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3956#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {3955#(<= 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; {3956#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {3954#(<= 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; {3955#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {3953#(<= 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; {3954#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:53,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {3952#(<= 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; {3953#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:48:53,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {3947#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[] {3952#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:48:53,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {3947#true} [91] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (and (= |v_main_#t~post5_Out_24| 0) (<= v_main_~x~0_Out_28 v_main_~x~0_In_14) (< 0 (mod (+ v_main_~x~0_Out_28 1) 4294967296)) (= |v_main_#t~post6_Out_24| 0) (= (+ v_main_~x~0_In_14 v_main_~y~0_In_12) (+ v_main_~y~0_Out_24 v_main_~x~0_Out_28)))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_12} OutVars{main_~y~0=v_main_~y~0_Out_24, main_#t~post5=|v_main_#t~post5_Out_24|, main_~x~0=v_main_~x~0_Out_28, main_#t~post6=|v_main_#t~post6_Out_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3947#true} is VALID [2022-04-15 12:48:53,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {3947#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3947#true} is VALID [2022-04-15 12:48:53,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {3947#true} call #t~ret11 := main(); {3947#true} is VALID [2022-04-15 12:48:53,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3947#true} {3947#true} #61#return; {3947#true} is VALID [2022-04-15 12:48:53,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {3947#true} assume true; {3947#true} is VALID [2022-04-15 12:48:53,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {3947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3947#true} is VALID [2022-04-15 12:48:53,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {3947#true} call ULTIMATE.init(); {3947#true} is VALID [2022-04-15 12:48:53,919 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-15 12:48:53,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364265710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:53,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:53,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-15 12:48:54,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:54,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [713200315] [2022-04-15 12:48:54,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [713200315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:54,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:54,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:48:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110529427] [2022-04-15 12:48:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:54,085 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-15 12:48:54,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:54,085 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-15 12:48:54,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:54,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:48:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:48:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:48:54,119 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-15 12:48:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:55,174 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-15 12:48:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:48:55,175 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-15 12:48:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:55,175 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-15 12:48:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-15 12:48:55,176 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-15 12:48:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-15 12:48:55,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 49 transitions. [2022-04-15 12:48:55,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:55,271 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:48:55,271 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:48:55,272 INFO L912 BasicCegarLoop]: 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-15 12:48:55,272 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:55,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 45 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:48:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:48:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-04-15 12:48:55,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:55,350 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-15 12:48:55,350 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-15 12:48:55,350 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-15 12:48:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:55,351 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 12:48:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 12:48:55,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:55,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:55,351 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-15 12:48:55,351 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-15 12:48:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:55,352 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 12:48:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 12:48:55,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:55,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:55,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:55,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:55,352 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-15 12:48:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-15 12:48:55,353 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2022-04-15 12:48:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:55,353 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-15 12:48:55,353 INFO L479 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-15 12:48:55,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-15 12:48:55,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 12:48:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:48:55,525 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:55,525 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:55,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 12:48:55,725 WARN L460 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-15 12:48:55,726 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1712811712, now seen corresponding path program 11 times [2022-04-15 12:48:55,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:55,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [417151582] [2022-04-15 12:48:55,820 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:55,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2113557376, now seen corresponding path program 1 times [2022-04-15 12:48:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:55,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241980328] [2022-04-15 12:48:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:56,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4357#true} is VALID [2022-04-15 12:48:56,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-15 12:48:56,006 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4357#true} {4357#true} #61#return; {4357#true} is VALID [2022-04-15 12:48:56,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {4357#true} call ULTIMATE.init(); {4372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:56,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4357#true} is VALID [2022-04-15 12:48:56,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-15 12:48:56,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4357#true} {4357#true} #61#return; {4357#true} is VALID [2022-04-15 12:48:56,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {4357#true} call #t~ret11 := main(); {4357#true} is VALID [2022-04-15 12:48:56,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {4357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4357#true} is VALID [2022-04-15 12:48:56,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {4357#true} [93] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15) (= |v_main_#t~post5_Out_26| 0) (= (+ v_main_~x~0_In_15 v_main_~y~0_In_13) (+ v_main_~y~0_Out_26 v_main_~x~0_Out_30))) (and (= v_main_~y~0_In_13 v_main_~y~0_Out_26) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4357#true} is VALID [2022-04-15 12:48:56,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {4357#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[] {4357#true} is VALID [2022-04-15 12:48:56,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {4357#true} ~z~0 := ~y~0; {4362#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:48:56,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {4362#(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; {4363#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:48:56,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {4363#(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; {4364#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:56,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {4364#(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; {4365#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:48:56,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {4365#(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; {4366#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:48:56,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {4366#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4367#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:56,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {4367#(<= 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; {4368#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:56,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {4368#(<= 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; {4369#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:56,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {4369#(<= 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; {4370#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:56,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {4370#(<= 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; {4371#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:56,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {4371#(<= 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; {4358#false} is VALID [2022-04-15 12:48:56,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {4358#false} assume !(~y~0 % 4294967296 > 0); {4358#false} is VALID [2022-04-15 12:48:56,017 INFO L272 TraceCheckUtils]: 20: Hoare triple {4358#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4358#false} is VALID [2022-04-15 12:48:56,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {4358#false} ~cond := #in~cond; {4358#false} is VALID [2022-04-15 12:48:56,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {4358#false} assume 0 == ~cond; {4358#false} is VALID [2022-04-15 12:48:56,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {4358#false} assume !false; {4358#false} is VALID [2022-04-15 12:48:56,017 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-15 12:48:56,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:56,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241980328] [2022-04-15 12:48:56,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241980328] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:56,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212442708] [2022-04-15 12:48:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:56,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:56,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:56,019 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:56,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:48:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:56,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:48:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:56,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:56,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {4357#true} call ULTIMATE.init(); {4357#true} is VALID [2022-04-15 12:48:56,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4357#true} is VALID [2022-04-15 12:48:56,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-15 12:48:56,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4357#true} {4357#true} #61#return; {4357#true} is VALID [2022-04-15 12:48:56,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {4357#true} call #t~ret11 := main(); {4357#true} is VALID [2022-04-15 12:48:56,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {4357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4357#true} is VALID [2022-04-15 12:48:56,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {4357#true} [93] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15) (= |v_main_#t~post5_Out_26| 0) (= (+ v_main_~x~0_In_15 v_main_~y~0_In_13) (+ v_main_~y~0_Out_26 v_main_~x~0_Out_30))) (and (= v_main_~y~0_In_13 v_main_~y~0_Out_26) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4357#true} is VALID [2022-04-15 12:48:56,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {4357#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[] {4357#true} is VALID [2022-04-15 12:48:56,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {4357#true} ~z~0 := ~y~0; {4362#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:48:56,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {4362#(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; {4363#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:48:56,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {4363#(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; {4364#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:56,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {4364#(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; {4365#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:48:56,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {4365#(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; {4366#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:48:56,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {4366#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4367#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:56,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {4367#(<= 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; {4368#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:56,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {4368#(<= 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; {4369#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:56,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {4369#(<= 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; {4370#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:56,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {4370#(<= 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; {4371#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:56,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {4371#(<= 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; {4358#false} is VALID [2022-04-15 12:48:56,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {4358#false} assume !(~y~0 % 4294967296 > 0); {4358#false} is VALID [2022-04-15 12:48:56,371 INFO L272 TraceCheckUtils]: 20: Hoare triple {4358#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4358#false} is VALID [2022-04-15 12:48:56,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {4358#false} ~cond := #in~cond; {4358#false} is VALID [2022-04-15 12:48:56,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {4358#false} assume 0 == ~cond; {4358#false} is VALID [2022-04-15 12:48:56,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {4358#false} assume !false; {4358#false} is VALID [2022-04-15 12:48:56,371 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-15 12:48:56,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:56,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {4358#false} assume !false; {4358#false} is VALID [2022-04-15 12:48:56,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {4358#false} assume 0 == ~cond; {4358#false} is VALID [2022-04-15 12:48:56,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {4358#false} ~cond := #in~cond; {4358#false} is VALID [2022-04-15 12:48:56,807 INFO L272 TraceCheckUtils]: 20: Hoare triple {4358#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4358#false} is VALID [2022-04-15 12:48:56,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {4358#false} assume !(~y~0 % 4294967296 > 0); {4358#false} is VALID [2022-04-15 12:48:56,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {4371#(<= 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; {4358#false} is VALID [2022-04-15 12:48:56,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {4370#(<= 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; {4371#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:48:56,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {4369#(<= 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; {4370#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:48:56,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {4368#(<= 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; {4369#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:56,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {4367#(<= 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; {4368#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:56,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {4475#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4367#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:48:56,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {4479#(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; {4475#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:48:56,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {4483#(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; {4479#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:48:56,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {4487#(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; {4483#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:48:56,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {4491#(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; {4487#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:48:56,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {4357#true} ~z~0 := ~y~0; {4491#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:48:56,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {4357#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[] {4357#true} is VALID [2022-04-15 12:48:56,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {4357#true} [93] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_26| 0) (< 0 (mod (+ v_main_~x~0_Out_30 1) 4294967296)) (<= v_main_~x~0_Out_30 v_main_~x~0_In_15) (= |v_main_#t~post5_Out_26| 0) (= (+ v_main_~x~0_In_15 v_main_~y~0_In_13) (+ v_main_~y~0_Out_26 v_main_~x~0_Out_30))) (and (= v_main_~y~0_In_13 v_main_~y~0_Out_26) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_13} OutVars{main_~y~0=v_main_~y~0_Out_26, main_#t~post5=|v_main_#t~post5_Out_26|, main_~x~0=v_main_~x~0_Out_30, main_#t~post6=|v_main_#t~post6_Out_26|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4357#true} is VALID [2022-04-15 12:48:56,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {4357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4357#true} is VALID [2022-04-15 12:48:56,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {4357#true} call #t~ret11 := main(); {4357#true} is VALID [2022-04-15 12:48:56,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4357#true} {4357#true} #61#return; {4357#true} is VALID [2022-04-15 12:48:56,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-15 12:48:56,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4357#true} is VALID [2022-04-15 12:48:56,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {4357#true} call ULTIMATE.init(); {4357#true} is VALID [2022-04-15 12:48:56,823 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-15 12:48:56,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212442708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:56,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:56,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-15 12:48:57,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:57,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [417151582] [2022-04-15 12:48:57,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [417151582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:57,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:57,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:48:57,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448755274] [2022-04-15 12:48:57,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:57,030 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-15 12:48:57,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:57,031 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-15 12:48:57,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:57,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:48:57,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:57,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:48:57,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:48:57,061 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-15 12:48:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:59,041 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-04-15 12:48:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:48:59,041 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-15 12:48:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:59,042 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-15 12:48:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2022-04-15 12:48:59,042 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-15 12:48:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2022-04-15 12:48:59,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 49 transitions. [2022-04-15 12:48:59,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:59,168 INFO L225 Difference]: With dead ends: 51 [2022-04-15 12:48:59,168 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:48:59,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=240, Invalid=1482, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:48:59,169 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:59,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 83 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:48:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:48:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 12:48:59,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:59,233 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-15 12:48:59,233 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-15 12:48:59,233 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-15 12:48:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:59,234 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:48:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:48:59,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:59,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:59,234 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-15 12:48:59,234 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-15 12:48:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:59,235 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:48:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:48:59,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:59,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:59,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:59,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:59,235 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-15 12:48:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 12:48:59,236 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2022-04-15 12:48:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:59,236 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 12:48:59,236 INFO L479 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-15 12:48:59,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 12:48:59,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:48:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:48:59,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:59,388 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:59,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:59,588 WARN L460 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-15 12:48:59,588 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:59,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1642818962, now seen corresponding path program 12 times [2022-04-15 12:48:59,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:59,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802931910] [2022-04-15 12:48:59,682 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1786804911, now seen corresponding path program 1 times [2022-04-15 12:48:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505612078] [2022-04-15 12:48:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:59,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {4801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4786#true} is VALID [2022-04-15 12:48:59,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {4786#true} assume true; {4786#true} is VALID [2022-04-15 12:48:59,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4786#true} {4786#true} #61#return; {4786#true} is VALID [2022-04-15 12:48:59,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {4786#true} call ULTIMATE.init(); {4801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:59,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {4801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4786#true} is VALID [2022-04-15 12:48:59,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {4786#true} assume true; {4786#true} is VALID [2022-04-15 12:48:59,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4786#true} {4786#true} #61#return; {4786#true} is VALID [2022-04-15 12:48:59,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {4786#true} call #t~ret11 := main(); {4786#true} is VALID [2022-04-15 12:48:59,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {4786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4786#true} is VALID [2022-04-15 12:48:59,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {4786#true} [95] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (= (+ v_main_~y~0_Out_28 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_14)) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post5_Out_28| 0)) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_14 v_main_~y~0_Out_28))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4786#true} is VALID [2022-04-15 12:48:59,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {4786#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[] {4786#true} is VALID [2022-04-15 12:48:59,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {4786#true} ~z~0 := ~y~0; {4791#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:48:59,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {4791#(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; {4792#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:48:59,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {4792#(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; {4793#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:48:59,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {4793#(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; {4794#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:48:59,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {4794#(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; {4795#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:48:59,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {4795#(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; {4796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:48:59,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {4796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:48:59,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {4796#(<= 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; {4797#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:48:59,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {4797#(<= 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; {4798#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:48:59,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {4798#(<= 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; {4799#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:48:59,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {4799#(<= 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; {4800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:48:59,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {4800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4787#false} is VALID [2022-04-15 12:48:59,901 INFO L272 TraceCheckUtils]: 20: Hoare triple {4787#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4787#false} is VALID [2022-04-15 12:48:59,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {4787#false} ~cond := #in~cond; {4787#false} is VALID [2022-04-15 12:48:59,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {4787#false} assume 0 == ~cond; {4787#false} is VALID [2022-04-15 12:48:59,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {4787#false} assume !false; {4787#false} is VALID [2022-04-15 12:48:59,901 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-15 12:48:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:59,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505612078] [2022-04-15 12:48:59,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505612078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:59,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167563874] [2022-04-15 12:48:59,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:59,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:59,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:59,902 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:59,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:48:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:59,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:48:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:59,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:00,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {4786#true} call ULTIMATE.init(); {4786#true} is VALID [2022-04-15 12:49:00,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {4786#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4786#true} is VALID [2022-04-15 12:49:00,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {4786#true} assume true; {4786#true} is VALID [2022-04-15 12:49:00,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4786#true} {4786#true} #61#return; {4786#true} is VALID [2022-04-15 12:49:00,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {4786#true} call #t~ret11 := main(); {4786#true} is VALID [2022-04-15 12:49:00,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {4786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4786#true} is VALID [2022-04-15 12:49:00,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {4786#true} [95] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (= (+ v_main_~y~0_Out_28 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_14)) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post5_Out_28| 0)) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_14 v_main_~y~0_Out_28))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4786#true} is VALID [2022-04-15 12:49:00,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {4786#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[] {4786#true} is VALID [2022-04-15 12:49:00,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {4786#true} ~z~0 := ~y~0; {4791#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:49:00,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {4791#(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; {4792#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:00,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {4792#(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; {4793#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:49:00,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {4793#(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; {4794#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:49:00,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {4794#(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; {4795#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:49:00,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {4795#(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; {4796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:49:00,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {4796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:49:00,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {4796#(<= 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; {4797#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:49:00,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {4797#(<= 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; {4798#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:49:00,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {4798#(<= 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; {4799#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:00,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {4799#(<= 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; {4800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:00,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {4800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4787#false} is VALID [2022-04-15 12:49:00,342 INFO L272 TraceCheckUtils]: 20: Hoare triple {4787#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4787#false} is VALID [2022-04-15 12:49:00,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {4787#false} ~cond := #in~cond; {4787#false} is VALID [2022-04-15 12:49:00,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {4787#false} assume 0 == ~cond; {4787#false} is VALID [2022-04-15 12:49:00,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {4787#false} assume !false; {4787#false} is VALID [2022-04-15 12:49:00,342 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-15 12:49:00,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:00,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {4787#false} assume !false; {4787#false} is VALID [2022-04-15 12:49:00,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {4787#false} assume 0 == ~cond; {4787#false} is VALID [2022-04-15 12:49:00,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {4787#false} ~cond := #in~cond; {4787#false} is VALID [2022-04-15 12:49:00,731 INFO L272 TraceCheckUtils]: 20: Hoare triple {4787#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4787#false} is VALID [2022-04-15 12:49:00,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {4800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4787#false} is VALID [2022-04-15 12:49:00,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {4799#(<= 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; {4800#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:00,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {4798#(<= 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; {4799#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:00,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {4797#(<= 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; {4798#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:49:00,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {4796#(<= 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; {4797#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:49:00,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {4796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:49:00,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {4904#(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; {4796#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:49:00,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {4908#(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; {4904#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:49:00,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {4912#(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; {4908#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-15 12:49:00,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {4916#(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; {4912#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:49:00,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {4920#(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; {4916#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 12:49:00,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {4786#true} ~z~0 := ~y~0; {4920#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:49:00,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {4786#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[] {4786#true} is VALID [2022-04-15 12:49:00,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {4786#true} [95] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_28| 0) (= (+ v_main_~y~0_Out_28 v_main_~x~0_Out_32) (+ v_main_~x~0_In_16 v_main_~y~0_In_14)) (<= v_main_~x~0_Out_32 v_main_~x~0_In_16) (< 0 (mod (+ v_main_~x~0_Out_32 1) 4294967296)) (= |v_main_#t~post5_Out_28| 0)) (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_14 v_main_~y~0_Out_28))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_14} OutVars{main_~y~0=v_main_~y~0_Out_28, main_#t~post5=|v_main_#t~post5_Out_28|, main_~x~0=v_main_~x~0_Out_32, main_#t~post6=|v_main_#t~post6_Out_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4786#true} is VALID [2022-04-15 12:49:00,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {4786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4786#true} is VALID [2022-04-15 12:49:00,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {4786#true} call #t~ret11 := main(); {4786#true} is VALID [2022-04-15 12:49:00,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4786#true} {4786#true} #61#return; {4786#true} is VALID [2022-04-15 12:49:00,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {4786#true} assume true; {4786#true} is VALID [2022-04-15 12:49:00,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {4786#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4786#true} is VALID [2022-04-15 12:49:00,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {4786#true} call ULTIMATE.init(); {4786#true} is VALID [2022-04-15 12:49:00,746 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-15 12:49:00,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167563874] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:00,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:00,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-15 12:49:01,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:01,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802931910] [2022-04-15 12:49:01,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802931910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:01,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:01,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:49:01,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750670982] [2022-04-15 12:49:01,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:01,094 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-15 12:49:01,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:01,094 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-15 12:49:01,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:01,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:49:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:49:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:49:01,140 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-15 12:49:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:04,204 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:49:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:49:04,204 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-15 12:49:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:04,204 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-15 12:49:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 37 transitions. [2022-04-15 12:49:04,205 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-15 12:49:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 37 transitions. [2022-04-15 12:49:04,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 37 transitions. [2022-04-15 12:49:04,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:04,371 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:49:04,371 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:49:04,372 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:49:04,372 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:04,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 81 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:49:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:49:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 12:49:04,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:04,438 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-15 12:49:04,438 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-15 12:49:04,438 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-15 12:49:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:04,441 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 12:49:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 12:49:04,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:04,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:04,442 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-15 12:49:04,442 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-15 12:49:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:04,442 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 12:49:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 12:49:04,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:04,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:04,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:04,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:04,443 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-15 12:49:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-15 12:49:04,443 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-04-15 12:49:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:04,443 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-15 12:49:04,443 INFO L479 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-15 12:49:04,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-15 12:49:04,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 12:49:04,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:49:04,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:04,614 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:04,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:49:04,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 12:49:04,815 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:04,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:04,816 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 13 times [2022-04-15 12:49:04,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:04,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1697186884] [2022-04-15 12:49:04,939 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:04,941 INFO L85 PathProgramCache]: Analyzing trace with hash 202751326, now seen corresponding path program 1 times [2022-04-15 12:49:04,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:04,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452507529] [2022-04-15 12:49:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:05,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {5192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5179#true} is VALID [2022-04-15 12:49:05,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {5179#true} assume true; {5179#true} is VALID [2022-04-15 12:49:05,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5179#true} {5179#true} #61#return; {5179#true} is VALID [2022-04-15 12:49:05,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {5179#true} call ULTIMATE.init(); {5192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:05,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {5192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5179#true} is VALID [2022-04-15 12:49:05,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {5179#true} assume true; {5179#true} is VALID [2022-04-15 12:49:05,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5179#true} {5179#true} #61#return; {5179#true} is VALID [2022-04-15 12:49:05,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {5179#true} call #t~ret11 := main(); {5179#true} is VALID [2022-04-15 12:49:05,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {5179#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5179#true} is VALID [2022-04-15 12:49:05,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {5179#true} [97] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_15 v_main_~y~0_Out_30) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)) (and (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_34) (+ v_main_~x~0_In_17 v_main_~y~0_In_15)) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5179#true} is VALID [2022-04-15 12:49:05,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {5179#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[] {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {5184#(<= 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; {5185#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:05,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {5185#(<= 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; {5186#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {5186#(<= 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; {5187#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {5187#(<= 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; {5188#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {5188#(<= 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; {5189#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:05,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {5189#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {5189#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:05,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {5189#(<= 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; {5188#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {5188#(<= 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; {5187#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {5187#(<= 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; {5186#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {5186#(<= 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; {5185#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:05,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {5185#(<= 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; {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,136 INFO L272 TraceCheckUtils]: 21: Hoare triple {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5190#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:49:05,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {5190#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5191#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:49:05,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {5191#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5180#false} is VALID [2022-04-15 12:49:05,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {5180#false} assume !false; {5180#false} is VALID [2022-04-15 12:49:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:05,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:05,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452507529] [2022-04-15 12:49:05,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452507529] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:05,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321849543] [2022-04-15 12:49:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:05,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:05,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:05,138 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:05,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:49:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:05,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:49:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:05,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:05,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {5179#true} call ULTIMATE.init(); {5179#true} is VALID [2022-04-15 12:49:05,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {5179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5179#true} is VALID [2022-04-15 12:49:05,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {5179#true} assume true; {5179#true} is VALID [2022-04-15 12:49:05,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5179#true} {5179#true} #61#return; {5179#true} is VALID [2022-04-15 12:49:05,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {5179#true} call #t~ret11 := main(); {5179#true} is VALID [2022-04-15 12:49:05,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {5179#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5179#true} is VALID [2022-04-15 12:49:05,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {5179#true} [97] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_15 v_main_~y~0_Out_30) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)) (and (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_34) (+ v_main_~x~0_In_17 v_main_~y~0_In_15)) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5179#true} is VALID [2022-04-15 12:49:05,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {5179#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[] {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {5184#(<= 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; {5185#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:05,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {5185#(<= 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; {5186#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {5186#(<= 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; {5187#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {5187#(<= 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; {5188#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {5188#(<= 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; {5189#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:05,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {5189#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {5189#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:05,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {5189#(<= 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; {5188#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {5188#(<= 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; {5187#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {5187#(<= 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; {5186#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {5186#(<= 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; {5185#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:05,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {5185#(<= 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; {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,439 INFO L272 TraceCheckUtils]: 21: Hoare triple {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5259#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:49:05,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {5259#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5263#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:49:05,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {5263#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5180#false} is VALID [2022-04-15 12:49:05,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {5180#false} assume !false; {5180#false} is VALID [2022-04-15 12:49:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:05,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:05,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {5180#false} assume !false; {5180#false} is VALID [2022-04-15 12:49:05,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {5263#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5180#false} is VALID [2022-04-15 12:49:05,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {5259#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5263#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:49:05,696 INFO L272 TraceCheckUtils]: 21: Hoare triple {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5259#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:49:05,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {5185#(<= 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; {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {5186#(<= 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; {5185#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:05,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {5187#(<= 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; {5186#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {5188#(<= 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; {5187#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {5189#(<= 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; {5188#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {5189#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {5189#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:05,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {5188#(<= 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; {5189#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:05,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {5187#(<= 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; {5188#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {5186#(<= 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; {5187#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {5185#(<= 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; {5186#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:05,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {5184#(<= 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; {5185#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:05,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {5179#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[] {5184#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:05,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {5179#true} [97] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_15 v_main_~y~0_Out_30) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)) (and (= |v_main_#t~post6_Out_30| 0) (= |v_main_#t~post5_Out_30| 0) (= (+ v_main_~y~0_Out_30 v_main_~x~0_Out_34) (+ v_main_~x~0_In_17 v_main_~y~0_In_15)) (< 0 (mod (+ v_main_~x~0_Out_34 1) 4294967296)) (<= v_main_~x~0_Out_34 v_main_~x~0_In_17))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_15} OutVars{main_~y~0=v_main_~y~0_Out_30, main_#t~post5=|v_main_#t~post5_Out_30|, main_~x~0=v_main_~x~0_Out_34, main_#t~post6=|v_main_#t~post6_Out_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5179#true} is VALID [2022-04-15 12:49:05,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {5179#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5179#true} is VALID [2022-04-15 12:49:05,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {5179#true} call #t~ret11 := main(); {5179#true} is VALID [2022-04-15 12:49:05,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5179#true} {5179#true} #61#return; {5179#true} is VALID [2022-04-15 12:49:05,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {5179#true} assume true; {5179#true} is VALID [2022-04-15 12:49:05,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {5179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5179#true} is VALID [2022-04-15 12:49:05,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {5179#true} call ULTIMATE.init(); {5179#true} is VALID [2022-04-15 12:49:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:05,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321849543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:05,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:05,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2022-04-15 12:49:06,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:06,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1697186884] [2022-04-15 12:49:06,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1697186884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:06,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:06,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:49:06,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634696432] [2022-04-15 12:49:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:06,070 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-15 12:49:06,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:06,070 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-15 12:49:06,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:06,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:49:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:06,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:49:06,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:49:06,113 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-15 12:49:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:07,957 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-15 12:49:07,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:49:07,957 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-15 12:49:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:07,958 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-15 12:49:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-15 12:49:07,958 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-15 12:49:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-15 12:49:07,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 55 transitions. [2022-04-15 12:49:08,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:08,140 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:49:08,140 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:49:08,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:49:08,141 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:08,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 40 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:49:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:49:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-04-15 12:49:08,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:08,218 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-15 12:49:08,218 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-15 12:49:08,218 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-15 12:49:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:08,218 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-15 12:49:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-15 12:49:08,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:08,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:08,219 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-15 12:49:08,219 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-15 12:49:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:08,219 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-15 12:49:08,220 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-15 12:49:08,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:08,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:08,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:08,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:08,220 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-15 12:49:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-15 12:49:08,220 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2022-04-15 12:49:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:08,220 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-15 12:49:08,221 INFO L479 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-15 12:49:08,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-15 12:49:08,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 12:49:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:49:08,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:08,584 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:08,600 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-15 12:49:08,784 WARN L460 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-15 12:49:08,785 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:08,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:08,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1392182130, now seen corresponding path program 14 times [2022-04-15 12:49:08,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:08,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101929096] [2022-04-15 12:49:08,909 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash -481773297, now seen corresponding path program 1 times [2022-04-15 12:49:08,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:08,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666738763] [2022-04-15 12:49:08,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:09,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {5654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5637#true} is VALID [2022-04-15 12:49:09,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 12:49:09,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5637#true} {5637#true} #61#return; {5637#true} is VALID [2022-04-15 12:49:09,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:09,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {5654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5637#true} is VALID [2022-04-15 12:49:09,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 12:49:09,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5637#true} {5637#true} #61#return; {5637#true} is VALID [2022-04-15 12:49:09,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {5637#true} call #t~ret11 := main(); {5637#true} is VALID [2022-04-15 12:49:09,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {5637#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5637#true} is VALID [2022-04-15 12:49:09,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {5637#true} [99] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_16 v_main_~y~0_Out_32)) (and (= |v_main_#t~post5_Out_32| 0) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (= |v_main_#t~post6_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296)) (= (+ v_main_~x~0_In_18 v_main_~y~0_In_16) (+ v_main_~y~0_Out_32 v_main_~x~0_Out_36)))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5637#true} is VALID [2022-04-15 12:49:09,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {5637#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[] {5637#true} is VALID [2022-04-15 12:49:09,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {5637#true} ~z~0 := ~y~0; {5642#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:49:09,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {5642#(= 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; {5643#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:49:09,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {5643#(= (+ (- 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; {5644#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:49:09,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {5644#(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; {5645#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:49:09,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {5645#(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; {5646#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:49:09,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {5646#(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; {5647#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:49:09,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {5647#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5648#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:09,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {5648#(<= 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; {5649#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:09,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {5649#(<= 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; {5650#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:09,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {5650#(<= 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; {5651#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:09,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {5651#(<= 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; {5652#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:49:09,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {5652#(<= 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; {5653#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:49:09,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {5653#(<= 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; {5638#false} is VALID [2022-04-15 12:49:09,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {5638#false} assume !(~y~0 % 4294967296 > 0); {5638#false} is VALID [2022-04-15 12:49:09,159 INFO L272 TraceCheckUtils]: 22: Hoare triple {5638#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5638#false} is VALID [2022-04-15 12:49:09,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-15 12:49:09,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-15 12:49:09,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-15 12:49:09,160 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-15 12:49:09,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:09,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666738763] [2022-04-15 12:49:09,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666738763] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:09,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252903951] [2022-04-15 12:49:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:09,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:09,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:09,161 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:09,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:49:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:09,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:49:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:09,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:09,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-15 12:49:09,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5637#true} is VALID [2022-04-15 12:49:09,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 12:49:09,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5637#true} {5637#true} #61#return; {5637#true} is VALID [2022-04-15 12:49:09,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {5637#true} call #t~ret11 := main(); {5637#true} is VALID [2022-04-15 12:49:09,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {5637#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5637#true} is VALID [2022-04-15 12:49:09,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {5637#true} [99] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_16 v_main_~y~0_Out_32)) (and (= |v_main_#t~post5_Out_32| 0) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (= |v_main_#t~post6_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296)) (= (+ v_main_~x~0_In_18 v_main_~y~0_In_16) (+ v_main_~y~0_Out_32 v_main_~x~0_Out_36)))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5637#true} is VALID [2022-04-15 12:49:09,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {5637#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[] {5637#true} is VALID [2022-04-15 12:49:09,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {5637#true} ~z~0 := ~y~0; {5642#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:49:09,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {5642#(= 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; {5643#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:49:09,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {5643#(= (+ (- 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; {5644#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:49:09,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {5644#(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; {5645#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:49:09,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {5645#(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; {5646#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:49:09,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {5646#(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; {5647#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:49:09,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {5647#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5648#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:09,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {5648#(<= 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; {5649#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:09,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {5649#(<= 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; {5650#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:09,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {5650#(<= 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; {5651#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:09,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {5651#(<= 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; {5652#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:49:09,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {5652#(<= 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; {5653#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:49:09,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {5653#(<= 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; {5638#false} is VALID [2022-04-15 12:49:09,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {5638#false} assume !(~y~0 % 4294967296 > 0); {5638#false} is VALID [2022-04-15 12:49:09,537 INFO L272 TraceCheckUtils]: 22: Hoare triple {5638#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5638#false} is VALID [2022-04-15 12:49:09,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-15 12:49:09,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-15 12:49:09,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-15 12:49:09,538 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-15 12:49:09,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:09,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-15 12:49:09,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-15 12:49:09,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-15 12:49:09,998 INFO L272 TraceCheckUtils]: 22: Hoare triple {5638#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5638#false} is VALID [2022-04-15 12:49:09,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {5638#false} assume !(~y~0 % 4294967296 > 0); {5638#false} is VALID [2022-04-15 12:49:09,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {5653#(<= 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; {5638#false} is VALID [2022-04-15 12:49:10,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {5652#(<= 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; {5653#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:49:10,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {5651#(<= 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; {5652#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:49:10,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {5650#(<= 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; {5651#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:10,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {5649#(<= 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; {5650#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:10,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {5648#(<= 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; {5649#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:10,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {5766#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5648#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:10,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {5770#(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; {5766#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:10,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {5774#(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; {5770#(or (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:49:10,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {5778#(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; {5774#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:10,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {5782#(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; {5778#(or (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:49:10,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {5786#(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; {5782#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:10,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {5637#true} ~z~0 := ~y~0; {5786#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:49:10,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {5637#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[] {5637#true} is VALID [2022-04-15 12:49:10,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {5637#true} [99] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_16 v_main_~y~0_Out_32)) (and (= |v_main_#t~post5_Out_32| 0) (<= v_main_~x~0_Out_36 v_main_~x~0_In_18) (= |v_main_#t~post6_Out_32| 0) (< 0 (mod (+ v_main_~x~0_Out_36 1) 4294967296)) (= (+ v_main_~x~0_In_18 v_main_~y~0_In_16) (+ v_main_~y~0_Out_32 v_main_~x~0_Out_36)))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_16} OutVars{main_~y~0=v_main_~y~0_Out_32, main_#t~post5=|v_main_#t~post5_Out_32|, main_~x~0=v_main_~x~0_Out_36, main_#t~post6=|v_main_#t~post6_Out_32|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5637#true} is VALID [2022-04-15 12:49:10,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {5637#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5637#true} is VALID [2022-04-15 12:49:10,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {5637#true} call #t~ret11 := main(); {5637#true} is VALID [2022-04-15 12:49:10,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5637#true} {5637#true} #61#return; {5637#true} is VALID [2022-04-15 12:49:10,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-15 12:49:10,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5637#true} is VALID [2022-04-15 12:49:10,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-15 12:49:10,019 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-15 12:49:10,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252903951] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:10,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:10,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 21 [2022-04-15 12:49:10,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:10,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101929096] [2022-04-15 12:49:10,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101929096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:10,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:10,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:49:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216392793] [2022-04-15 12:49:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:10,446 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-15 12:49:10,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:10,446 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-15 12:49:10,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:10,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:49:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:49:10,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:49:10,525 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-15 12:49:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:13,997 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-15 12:49:13,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:49:13,997 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-15 12:49:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:13,998 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-15 12:49:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 53 transitions. [2022-04-15 12:49:13,998 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-15 12:49:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 53 transitions. [2022-04-15 12:49:13,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 53 transitions. [2022-04-15 12:49:14,131 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-15 12:49:14,132 INFO L225 Difference]: With dead ends: 57 [2022-04-15 12:49:14,132 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:49:14,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=311, Invalid=2139, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 12:49:14,133 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:14,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 78 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:49:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:49:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 12:49:14,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:14,202 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-15 12:49:14,202 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-15 12:49:14,202 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-15 12:49:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:14,203 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 12:49:14,203 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 12:49:14,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:14,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:14,203 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-15 12:49:14,203 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-15 12:49:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:14,203 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 12:49:14,203 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 12:49:14,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:14,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:14,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:14,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:14,204 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-15 12:49:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-15 12:49:14,204 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2022-04-15 12:49:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:14,204 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-15 12:49:14,204 INFO L479 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-15 12:49:14,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-15 12:49:14,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 12:49:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:49:14,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:14,436 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:14,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:49:14,636 WARN L460 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-15 12:49:14,636 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 43269344, now seen corresponding path program 15 times [2022-04-15 12:49:14,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:14,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1743983853] [2022-04-15 12:49:14,765 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash -844668864, now seen corresponding path program 1 times [2022-04-15 12:49:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:14,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961959641] [2022-04-15 12:49:14,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:15,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {6131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6114#true} is VALID [2022-04-15 12:49:15,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {6114#true} assume true; {6114#true} is VALID [2022-04-15 12:49:15,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6114#true} {6114#true} #61#return; {6114#true} is VALID [2022-04-15 12:49:15,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {6114#true} call ULTIMATE.init(); {6131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:15,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {6131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6114#true} is VALID [2022-04-15 12:49:15,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {6114#true} assume true; {6114#true} is VALID [2022-04-15 12:49:15,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6114#true} {6114#true} #61#return; {6114#true} is VALID [2022-04-15 12:49:15,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {6114#true} call #t~ret11 := main(); {6114#true} is VALID [2022-04-15 12:49:15,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {6114#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6114#true} is VALID [2022-04-15 12:49:15,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {6114#true} [101] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_38) (+ v_main_~x~0_In_19 v_main_~y~0_In_17)) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_34| 0) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19) (= |v_main_#t~post5_Out_34| 0)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_17 v_main_~y~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6114#true} is VALID [2022-04-15 12:49:15,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {6114#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[] {6114#true} is VALID [2022-04-15 12:49:15,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {6114#true} ~z~0 := ~y~0; {6119#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:49:15,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {6119#(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; {6120#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:15,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {6120#(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; {6121#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:49:15,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {6121#(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; {6122#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:49:15,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {6122#(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; {6123#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:49:15,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {6123#(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; {6124#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:49:15,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {6124#(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; {6125#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:15,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {6125#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6125#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:15,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {6125#(<= 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; {6126#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:49:15,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {6126#(<= 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; {6127#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:49:15,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {6127#(<= 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; {6128#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:49:15,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {6128#(<= 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; {6129#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:15,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {6129#(<= 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; {6130#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:15,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {6130#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {6115#false} is VALID [2022-04-15 12:49:15,081 INFO L272 TraceCheckUtils]: 22: Hoare triple {6115#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6115#false} is VALID [2022-04-15 12:49:15,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {6115#false} ~cond := #in~cond; {6115#false} is VALID [2022-04-15 12:49:15,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {6115#false} assume 0 == ~cond; {6115#false} is VALID [2022-04-15 12:49:15,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {6115#false} assume !false; {6115#false} is VALID [2022-04-15 12:49:15,082 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-15 12:49:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:15,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961959641] [2022-04-15 12:49:15,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961959641] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:15,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468256417] [2022-04-15 12:49:15,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:15,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:15,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:15,083 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:15,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:49:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:15,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:49:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:15,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:15,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {6114#true} call ULTIMATE.init(); {6114#true} is VALID [2022-04-15 12:49:15,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {6114#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6114#true} is VALID [2022-04-15 12:49:15,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {6114#true} assume true; {6114#true} is VALID [2022-04-15 12:49:15,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6114#true} {6114#true} #61#return; {6114#true} is VALID [2022-04-15 12:49:15,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {6114#true} call #t~ret11 := main(); {6114#true} is VALID [2022-04-15 12:49:15,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {6114#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6114#true} is VALID [2022-04-15 12:49:15,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {6114#true} [101] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_38) (+ v_main_~x~0_In_19 v_main_~y~0_In_17)) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_34| 0) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19) (= |v_main_#t~post5_Out_34| 0)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_17 v_main_~y~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6114#true} is VALID [2022-04-15 12:49:15,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {6114#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[] {6114#true} is VALID [2022-04-15 12:49:15,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {6114#true} ~z~0 := ~y~0; {6119#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:49:15,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {6119#(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; {6120#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:15,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {6120#(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; {6121#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:49:15,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {6121#(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; {6122#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:49:15,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {6122#(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; {6123#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:49:15,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {6123#(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; {6124#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:49:15,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {6124#(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; {6125#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:15,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {6125#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6125#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:15,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {6125#(<= 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; {6126#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:49:15,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {6126#(<= 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; {6127#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:49:15,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {6127#(<= 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; {6128#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:49:15,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {6128#(<= 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; {6129#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:15,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {6129#(<= 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; {6130#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:15,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {6130#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {6115#false} is VALID [2022-04-15 12:49:15,486 INFO L272 TraceCheckUtils]: 22: Hoare triple {6115#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6115#false} is VALID [2022-04-15 12:49:15,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {6115#false} ~cond := #in~cond; {6115#false} is VALID [2022-04-15 12:49:15,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {6115#false} assume 0 == ~cond; {6115#false} is VALID [2022-04-15 12:49:15,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {6115#false} assume !false; {6115#false} is VALID [2022-04-15 12:49:15,486 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-15 12:49:15,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:16,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {6115#false} assume !false; {6115#false} is VALID [2022-04-15 12:49:16,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {6115#false} assume 0 == ~cond; {6115#false} is VALID [2022-04-15 12:49:16,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {6115#false} ~cond := #in~cond; {6115#false} is VALID [2022-04-15 12:49:16,011 INFO L272 TraceCheckUtils]: 22: Hoare triple {6115#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6115#false} is VALID [2022-04-15 12:49:16,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {6130#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {6115#false} is VALID [2022-04-15 12:49:16,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {6129#(<= 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; {6130#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:16,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {6128#(<= 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; {6129#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:16,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {6127#(<= 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; {6128#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:49:16,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {6126#(<= 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; {6127#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:49:16,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {6125#(<= 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; {6126#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:49:16,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {6125#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6125#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:16,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {6243#(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; {6125#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:16,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {6247#(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; {6243#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:16,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {6251#(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; {6247#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:16,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {6255#(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; {6251#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:16,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {6259#(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; {6255#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:16,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {6263#(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; {6259#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:16,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {6114#true} ~z~0 := ~y~0; {6263#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:49:16,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {6114#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[] {6114#true} is VALID [2022-04-15 12:49:16,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {6114#true} [101] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_34 v_main_~x~0_Out_38) (+ v_main_~x~0_In_19 v_main_~y~0_In_17)) (< 0 (mod (+ v_main_~x~0_Out_38 1) 4294967296)) (= |v_main_#t~post6_Out_34| 0) (<= v_main_~x~0_Out_38 v_main_~x~0_In_19) (= |v_main_#t~post5_Out_34| 0)) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_17 v_main_~y~0_Out_34))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_17} OutVars{main_~y~0=v_main_~y~0_Out_34, main_#t~post5=|v_main_#t~post5_Out_34|, main_~x~0=v_main_~x~0_Out_38, main_#t~post6=|v_main_#t~post6_Out_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6114#true} is VALID [2022-04-15 12:49:16,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {6114#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6114#true} is VALID [2022-04-15 12:49:16,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {6114#true} call #t~ret11 := main(); {6114#true} is VALID [2022-04-15 12:49:16,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6114#true} {6114#true} #61#return; {6114#true} is VALID [2022-04-15 12:49:16,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {6114#true} assume true; {6114#true} is VALID [2022-04-15 12:49:16,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {6114#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6114#true} is VALID [2022-04-15 12:49:16,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {6114#true} call ULTIMATE.init(); {6114#true} is VALID [2022-04-15 12:49:16,033 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-15 12:49:16,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468256417] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:16,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:16,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 21 [2022-04-15 12:49:16,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:16,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1743983853] [2022-04-15 12:49:16,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1743983853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:16,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:16,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:49:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858436599] [2022-04-15 12:49:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:16,902 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-15 12:49:16,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:16,903 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-15 12:49:16,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:16,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:49:16,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:16,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:49:16,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:49:16,973 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-15 12:49:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:23,749 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 12:49:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:49:23,749 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-15 12:49:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:23,750 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-15 12:49:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-15 12:49:23,750 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-15 12:49:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-15 12:49:23,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 40 transitions. [2022-04-15 12:49:23,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:23,943 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:49:23,943 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:49:23,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=311, Invalid=1759, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:49:23,944 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:23,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 96 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 12:49:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:49:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:49:24,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:24,028 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-15 12:49:24,028 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-15 12:49:24,028 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-15 12:49:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:24,029 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:49:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:49:24,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:24,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:24,029 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-15 12:49:24,029 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-15 12:49:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:24,030 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:49:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:49:24,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:24,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:24,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:24,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:24,030 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-15 12:49:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 12:49:24,030 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2022-04-15 12:49:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:24,031 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 12:49:24,031 INFO L479 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-15 12:49:24,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 12:49:24,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:49:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:49:24,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:24,312 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:24,330 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-15 12:49:24,513 WARN L460 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-15 12:49:24,513 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 16 times [2022-04-15 12:49:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:24,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1241512843] [2022-04-15 12:49:24,633 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash -775382547, now seen corresponding path program 1 times [2022-04-15 12:49:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:24,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585457603] [2022-04-15 12:49:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:24,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:24,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {6561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6547#true} is VALID [2022-04-15 12:49:24,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-04-15 12:49:24,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6547#true} {6547#true} #61#return; {6547#true} is VALID [2022-04-15 12:49:24,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {6547#true} call ULTIMATE.init(); {6561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:24,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {6561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6547#true} is VALID [2022-04-15 12:49:24,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-04-15 12:49:24,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6547#true} {6547#true} #61#return; {6547#true} is VALID [2022-04-15 12:49:24,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {6547#true} call #t~ret11 := main(); {6547#true} is VALID [2022-04-15 12:49:24,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {6547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6547#true} is VALID [2022-04-15 12:49:24,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {6547#true} [103] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_18 v_main_~y~0_Out_36)) (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~x~0_In_20 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_40)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_36| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6547#true} is VALID [2022-04-15 12:49:24,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {6547#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[] {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:24,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:24,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:24,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:24,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:24,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:24,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {6556#(<= 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; {6557#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:24,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {6557#(<= 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; {6558#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:24,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {6558#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6558#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:24,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {6558#(<= 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; {6557#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:24,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {6557#(<= 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; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:24,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {6556#(<= 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; {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:24,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {6555#(<= 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; {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:24,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {6554#(<= 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; {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:24,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {6553#(<= 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; {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:24,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:24,901 INFO L272 TraceCheckUtils]: 23: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6559#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:49:24,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {6559#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6560#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:49:24,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {6560#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6548#false} is VALID [2022-04-15 12:49:24,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {6548#false} assume !false; {6548#false} is VALID [2022-04-15 12:49:24,902 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-15 12:49:24,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:24,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585457603] [2022-04-15 12:49:24,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585457603] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:24,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731677817] [2022-04-15 12:49:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:24,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:24,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:24,903 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:24,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:49:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:24,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:49:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:24,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:25,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {6547#true} call ULTIMATE.init(); {6547#true} is VALID [2022-04-15 12:49:25,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {6547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6547#true} is VALID [2022-04-15 12:49:25,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-04-15 12:49:25,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6547#true} {6547#true} #61#return; {6547#true} is VALID [2022-04-15 12:49:25,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {6547#true} call #t~ret11 := main(); {6547#true} is VALID [2022-04-15 12:49:25,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {6547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6547#true} is VALID [2022-04-15 12:49:25,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {6547#true} [103] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_18 v_main_~y~0_Out_36)) (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~x~0_In_20 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_40)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_36| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6547#true} is VALID [2022-04-15 12:49:25,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {6547#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[] {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:25,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:25,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:25,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {6556#(<= 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; {6557#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:25,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {6557#(<= 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; {6558#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {6558#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6558#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {6558#(<= 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; {6557#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:25,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {6557#(<= 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; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {6556#(<= 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; {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {6555#(<= 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; {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {6554#(<= 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; {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:25,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {6553#(<= 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; {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:25,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:25,241 INFO L272 TraceCheckUtils]: 23: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6634#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:49:25,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {6634#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6638#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:49:25,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {6638#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6548#false} is VALID [2022-04-15 12:49:25,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {6548#false} assume !false; {6548#false} is VALID [2022-04-15 12:49:25,242 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-15 12:49:25,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:25,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {6548#false} assume !false; {6548#false} is VALID [2022-04-15 12:49:25,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {6638#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6548#false} is VALID [2022-04-15 12:49:25,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {6634#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6638#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:49:25,529 INFO L272 TraceCheckUtils]: 23: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6634#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:49:25,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:25,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {6553#(<= 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; {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:25,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {6554#(<= 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; {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:25,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {6555#(<= 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; {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {6556#(<= 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; {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {6557#(<= 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; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {6558#(<= 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; {6557#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:25,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {6558#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6558#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {6557#(<= 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; {6558#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {6556#(<= 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; {6557#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:49:25,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6556#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6555#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6554#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:25,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6553#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:49:25,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:25,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {6547#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[] {6552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:49:25,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {6547#true} [103] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_20 v_main_~x~0_Out_40) (= v_main_~y~0_In_18 v_main_~y~0_Out_36)) (and (= |v_main_#t~post5_Out_36| 0) (= (+ v_main_~x~0_In_20 v_main_~y~0_In_18) (+ v_main_~y~0_Out_36 v_main_~x~0_Out_40)) (< 0 (mod (+ v_main_~x~0_Out_40 1) 4294967296)) (= |v_main_#t~post6_Out_36| 0) (<= v_main_~x~0_Out_40 v_main_~x~0_In_20))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_18} OutVars{main_~y~0=v_main_~y~0_Out_36, main_#t~post5=|v_main_#t~post5_Out_36|, main_~x~0=v_main_~x~0_Out_40, main_#t~post6=|v_main_#t~post6_Out_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6547#true} is VALID [2022-04-15 12:49:25,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {6547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6547#true} is VALID [2022-04-15 12:49:25,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {6547#true} call #t~ret11 := main(); {6547#true} is VALID [2022-04-15 12:49:25,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6547#true} {6547#true} #61#return; {6547#true} is VALID [2022-04-15 12:49:25,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {6547#true} assume true; {6547#true} is VALID [2022-04-15 12:49:25,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {6547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6547#true} is VALID [2022-04-15 12:49:25,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {6547#true} call ULTIMATE.init(); {6547#true} is VALID [2022-04-15 12:49:25,560 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-15 12:49:25,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731677817] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:25,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:25,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2022-04-15 12:49:26,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:26,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1241512843] [2022-04-15 12:49:26,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1241512843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:26,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:26,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:49:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665291316] [2022-04-15 12:49:26,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:26,338 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-15 12:49:26,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:26,338 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-15 12:49:26,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:26,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:49:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:26,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:49:26,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:49:26,432 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-15 12:49:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:29,891 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-15 12:49:29,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:49:29,891 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-15 12:49:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:29,891 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-15 12:49:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2022-04-15 12:49:29,892 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-15 12:49:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2022-04-15 12:49:29,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 61 transitions. [2022-04-15 12:49:30,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:30,090 INFO L225 Difference]: With dead ends: 58 [2022-04-15 12:49:30,090 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:49:30,090 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:49:30,091 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 50 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:30,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 35 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:49:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:49:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2022-04-15 12:49:30,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:30,191 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-15 12:49:30,191 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-15 12:49:30,191 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-15 12:49:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:30,191 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-15 12:49:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-15 12:49:30,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:30,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:30,192 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-15 12:49:30,192 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-15 12:49:30,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:30,192 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-15 12:49:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-15 12:49:30,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:30,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:30,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:30,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:30,193 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-15 12:49:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-15 12:49:30,193 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-04-15 12:49:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:30,193 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-15 12:49:30,194 INFO L479 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-15 12:49:30,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-15 12:49:30,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 12:49:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:49:30,620 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:30,620 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:30,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:49:30,820 WARN L460 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-15 12:49:30,820 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash -263990656, now seen corresponding path program 17 times [2022-04-15 12:49:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:30,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [118725580] [2022-04-15 12:49:30,912 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:30,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1885970848, now seen corresponding path program 1 times [2022-04-15 12:49:30,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:30,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462760468] [2022-04-15 12:49:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:31,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {7072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7053#true} is VALID [2022-04-15 12:49:31,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {7053#true} assume true; {7053#true} is VALID [2022-04-15 12:49:31,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7053#true} {7053#true} #61#return; {7053#true} is VALID [2022-04-15 12:49:31,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {7053#true} call ULTIMATE.init(); {7072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:31,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {7072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7053#true} is VALID [2022-04-15 12:49:31,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {7053#true} assume true; {7053#true} is VALID [2022-04-15 12:49:31,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7053#true} {7053#true} #61#return; {7053#true} is VALID [2022-04-15 12:49:31,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {7053#true} call #t~ret11 := main(); {7053#true} is VALID [2022-04-15 12:49:31,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {7053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7053#true} is VALID [2022-04-15 12:49:31,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {7053#true} [105] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_38| 0) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_42) (+ v_main_~x~0_In_21 v_main_~y~0_In_19)) (= |v_main_#t~post6_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296))) (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7053#true} is VALID [2022-04-15 12:49:31,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {7053#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[] {7053#true} is VALID [2022-04-15 12:49:31,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {7053#true} ~z~0 := ~y~0; {7058#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:49:31,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {7058#(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; {7059#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:31,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {7059#(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; {7060#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:49:31,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {7060#(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; {7061#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:49:31,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {7061#(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; {7062#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:49:31,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {7062#(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; {7063#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:49:31,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {7063#(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; {7064#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:49:31,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {7064#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {7065#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:31,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {7065#(<= 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; {7066#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:31,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {7066#(<= 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; {7067#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:31,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {7067#(<= 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; {7068#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:31,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {7068#(<= 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; {7069#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:31,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {7069#(<= 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; {7070#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:49:31,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {7070#(<= 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; {7071#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:49:31,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {7071#(<= 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; {7054#false} is VALID [2022-04-15 12:49:31,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {7054#false} assume !(~y~0 % 4294967296 > 0); {7054#false} is VALID [2022-04-15 12:49:31,290 INFO L272 TraceCheckUtils]: 24: Hoare triple {7054#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7054#false} is VALID [2022-04-15 12:49:31,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {7054#false} ~cond := #in~cond; {7054#false} is VALID [2022-04-15 12:49:31,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {7054#false} assume 0 == ~cond; {7054#false} is VALID [2022-04-15 12:49:31,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {7054#false} assume !false; {7054#false} is VALID [2022-04-15 12:49:31,291 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-15 12:49:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:31,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462760468] [2022-04-15 12:49:31,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462760468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:31,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137457271] [2022-04-15 12:49:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:31,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:31,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:31,293 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:31,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:49:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:31,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:49:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:31,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:31,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {7053#true} call ULTIMATE.init(); {7053#true} is VALID [2022-04-15 12:49:31,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {7053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7053#true} is VALID [2022-04-15 12:49:31,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {7053#true} assume true; {7053#true} is VALID [2022-04-15 12:49:31,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7053#true} {7053#true} #61#return; {7053#true} is VALID [2022-04-15 12:49:31,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {7053#true} call #t~ret11 := main(); {7053#true} is VALID [2022-04-15 12:49:31,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {7053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7053#true} is VALID [2022-04-15 12:49:31,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {7053#true} [105] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_38| 0) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_42) (+ v_main_~x~0_In_21 v_main_~y~0_In_19)) (= |v_main_#t~post6_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296))) (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7053#true} is VALID [2022-04-15 12:49:31,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {7053#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[] {7053#true} is VALID [2022-04-15 12:49:31,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {7053#true} ~z~0 := ~y~0; {7058#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:49:31,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {7058#(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; {7059#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:31,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {7059#(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; {7060#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:49:31,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {7060#(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; {7061#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:49:31,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {7061#(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; {7062#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:49:31,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {7062#(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; {7063#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:49:31,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {7063#(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; {7064#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:49:31,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {7064#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {7065#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:31,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {7065#(<= 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; {7066#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:31,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {7066#(<= 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; {7067#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:31,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {7067#(<= 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; {7068#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:31,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {7068#(<= 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; {7069#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:31,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {7069#(<= 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; {7070#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:49:31,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {7070#(<= 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; {7071#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:49:31,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {7071#(<= 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; {7054#false} is VALID [2022-04-15 12:49:31,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {7054#false} assume !(~y~0 % 4294967296 > 0); {7054#false} is VALID [2022-04-15 12:49:31,708 INFO L272 TraceCheckUtils]: 24: Hoare triple {7054#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7054#false} is VALID [2022-04-15 12:49:31,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {7054#false} ~cond := #in~cond; {7054#false} is VALID [2022-04-15 12:49:31,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {7054#false} assume 0 == ~cond; {7054#false} is VALID [2022-04-15 12:49:31,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {7054#false} assume !false; {7054#false} is VALID [2022-04-15 12:49:31,708 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-15 12:49:31,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:32,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {7054#false} assume !false; {7054#false} is VALID [2022-04-15 12:49:32,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {7054#false} assume 0 == ~cond; {7054#false} is VALID [2022-04-15 12:49:32,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {7054#false} ~cond := #in~cond; {7054#false} is VALID [2022-04-15 12:49:32,408 INFO L272 TraceCheckUtils]: 24: Hoare triple {7054#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7054#false} is VALID [2022-04-15 12:49:32,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {7054#false} assume !(~y~0 % 4294967296 > 0); {7054#false} is VALID [2022-04-15 12:49:32,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {7071#(<= 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; {7054#false} is VALID [2022-04-15 12:49:32,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {7070#(<= 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; {7071#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:49:32,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {7069#(<= 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; {7070#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:49:32,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {7068#(<= 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; {7069#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:32,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {7067#(<= 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; {7068#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:32,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {7066#(<= 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; {7067#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:32,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {7065#(<= 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; {7066#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:49:32,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {7193#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {7065#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:32,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {7197#(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; {7193#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:32,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {7201#(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; {7197#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:32,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {7205#(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; {7201#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:32,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {7209#(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; {7205#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:32,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {7213#(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; {7209#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:32,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {7217#(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; {7213#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 12:49:32,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {7053#true} ~z~0 := ~y~0; {7217#(or (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:49:32,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {7053#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[] {7053#true} is VALID [2022-04-15 12:49:32,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {7053#true} [105] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_38| 0) (<= v_main_~x~0_Out_42 v_main_~x~0_In_21) (= (+ v_main_~y~0_Out_38 v_main_~x~0_Out_42) (+ v_main_~x~0_In_21 v_main_~y~0_In_19)) (= |v_main_#t~post6_Out_38| 0) (< 0 (mod (+ v_main_~x~0_Out_42 1) 4294967296))) (and (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_19} OutVars{main_~y~0=v_main_~y~0_Out_38, main_#t~post5=|v_main_#t~post5_Out_38|, main_~x~0=v_main_~x~0_Out_42, main_#t~post6=|v_main_#t~post6_Out_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7053#true} is VALID [2022-04-15 12:49:32,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {7053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7053#true} is VALID [2022-04-15 12:49:32,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {7053#true} call #t~ret11 := main(); {7053#true} is VALID [2022-04-15 12:49:32,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7053#true} {7053#true} #61#return; {7053#true} is VALID [2022-04-15 12:49:32,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {7053#true} assume true; {7053#true} is VALID [2022-04-15 12:49:32,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {7053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7053#true} is VALID [2022-04-15 12:49:32,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {7053#true} call ULTIMATE.init(); {7053#true} is VALID [2022-04-15 12:49:32,448 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-15 12:49:32,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137457271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:32,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:32,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-04-15 12:49:33,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:33,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [118725580] [2022-04-15 12:49:33,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [118725580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:33,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:33,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:49:33,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888244937] [2022-04-15 12:49:33,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:33,730 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-15 12:49:33,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:33,730 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-15 12:49:33,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:33,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:49:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:33,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:49:33,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:49:33,834 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-15 12:49:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:42,042 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-04-15 12:49:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:49:42,042 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-15 12:49:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:42,043 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-15 12:49:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 57 transitions. [2022-04-15 12:49:42,043 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-15 12:49:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 57 transitions. [2022-04-15 12:49:42,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 57 transitions. [2022-04-15 12:49:42,328 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-15 12:49:42,328 INFO L225 Difference]: With dead ends: 63 [2022-04-15 12:49:42,328 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:49:42,329 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=390, Invalid=2916, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:49:42,329 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:42,330 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 98 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 12:49:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:49:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:49:42,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:42,418 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-15 12:49:42,418 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-15 12:49:42,418 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-15 12:49:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:42,419 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:49:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:49:42,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:42,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:42,419 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-15 12:49:42,419 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-15 12:49:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:42,420 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:49:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:49:42,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:42,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:42,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:42,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:42,420 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-15 12:49:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-15 12:49:42,420 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2022-04-15 12:49:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:42,421 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-15 12:49:42,421 INFO L479 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-15 12:49:42,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-15 12:49:42,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:49:42,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:49:42,868 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:42,868 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:42,884 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-15 12:49:43,068 WARN L460 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-15 12:49:43,069 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:43,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash -685840210, now seen corresponding path program 18 times [2022-04-15 12:49:43,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:43,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [276802925] [2022-04-15 12:49:43,192 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash 785671631, now seen corresponding path program 1 times [2022-04-15 12:49:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:43,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290412170] [2022-04-15 12:49:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:43,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:43,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {7597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7578#true} is VALID [2022-04-15 12:49:43,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {7578#true} assume true; {7578#true} is VALID [2022-04-15 12:49:43,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7578#true} {7578#true} #61#return; {7578#true} is VALID [2022-04-15 12:49:43,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {7578#true} call ULTIMATE.init(); {7597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:43,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {7597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7578#true} is VALID [2022-04-15 12:49:43,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {7578#true} assume true; {7578#true} is VALID [2022-04-15 12:49:43,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7578#true} {7578#true} #61#return; {7578#true} is VALID [2022-04-15 12:49:43,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {7578#true} call #t~ret11 := main(); {7578#true} is VALID [2022-04-15 12:49:43,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {7578#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7578#true} is VALID [2022-04-15 12:49:43,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {7578#true} [107] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_40| 0) (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= |v_main_#t~post6_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_44))) (and (= v_main_~x~0_In_22 v_main_~x~0_Out_44) (= v_main_~y~0_In_20 v_main_~y~0_Out_40))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7578#true} is VALID [2022-04-15 12:49:43,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {7578#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[] {7578#true} is VALID [2022-04-15 12:49:43,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {7578#true} ~z~0 := ~y~0; {7583#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:49:43,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {7583#(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; {7584#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:43,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {7584#(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; {7585#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:49:43,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {7585#(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; {7586#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:49:43,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {7586#(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; {7587#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:49:43,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {7587#(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; {7588#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:49:43,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {7588#(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; {7589#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:49:43,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {7589#(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; {7590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:49:43,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {7590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {7590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:49:43,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {7590#(<= 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; {7591#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:43,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {7591#(<= 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; {7592#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:49:43,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {7592#(<= 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; {7593#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:49:43,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {7593#(<= 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; {7594#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:49:43,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {7594#(<= 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; {7595#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:43,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {7595#(<= 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; {7596#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:43,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {7596#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7579#false} is VALID [2022-04-15 12:49:43,656 INFO L272 TraceCheckUtils]: 24: Hoare triple {7579#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7579#false} is VALID [2022-04-15 12:49:43,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {7579#false} ~cond := #in~cond; {7579#false} is VALID [2022-04-15 12:49:43,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {7579#false} assume 0 == ~cond; {7579#false} is VALID [2022-04-15 12:49:43,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {7579#false} assume !false; {7579#false} is VALID [2022-04-15 12:49:43,656 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-15 12:49:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:43,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290412170] [2022-04-15 12:49:43,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290412170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:43,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957127697] [2022-04-15 12:49:43,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:43,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:43,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:43,657 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:43,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:49:43,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:49:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:43,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:44,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {7578#true} call ULTIMATE.init(); {7578#true} is VALID [2022-04-15 12:49:44,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {7578#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7578#true} is VALID [2022-04-15 12:49:44,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {7578#true} assume true; {7578#true} is VALID [2022-04-15 12:49:44,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7578#true} {7578#true} #61#return; {7578#true} is VALID [2022-04-15 12:49:44,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {7578#true} call #t~ret11 := main(); {7578#true} is VALID [2022-04-15 12:49:44,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {7578#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7578#true} is VALID [2022-04-15 12:49:44,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {7578#true} [107] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_40| 0) (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= |v_main_#t~post6_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_44))) (and (= v_main_~x~0_In_22 v_main_~x~0_Out_44) (= v_main_~y~0_In_20 v_main_~y~0_Out_40))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7578#true} is VALID [2022-04-15 12:49:44,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {7578#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[] {7578#true} is VALID [2022-04-15 12:49:44,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {7578#true} ~z~0 := ~y~0; {7583#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:49:44,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {7583#(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; {7584#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:49:44,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {7584#(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; {7585#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:49:44,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {7585#(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; {7586#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:49:44,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {7586#(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; {7587#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:49:44,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {7587#(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; {7588#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:49:44,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {7588#(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; {7589#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:49:44,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {7589#(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; {7590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:49:44,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {7590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {7590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:49:44,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {7590#(<= 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; {7591#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:44,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {7591#(<= 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; {7592#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:49:44,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {7592#(<= 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; {7593#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:49:44,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {7593#(<= 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; {7594#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:49:44,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {7594#(<= 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; {7595#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:44,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {7595#(<= 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; {7596#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:44,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {7596#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7579#false} is VALID [2022-04-15 12:49:44,130 INFO L272 TraceCheckUtils]: 24: Hoare triple {7579#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7579#false} is VALID [2022-04-15 12:49:44,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {7579#false} ~cond := #in~cond; {7579#false} is VALID [2022-04-15 12:49:44,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {7579#false} assume 0 == ~cond; {7579#false} is VALID [2022-04-15 12:49:44,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {7579#false} assume !false; {7579#false} is VALID [2022-04-15 12:49:44,130 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-15 12:49:44,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:44,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {7579#false} assume !false; {7579#false} is VALID [2022-04-15 12:49:44,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {7579#false} assume 0 == ~cond; {7579#false} is VALID [2022-04-15 12:49:44,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {7579#false} ~cond := #in~cond; {7579#false} is VALID [2022-04-15 12:49:44,877 INFO L272 TraceCheckUtils]: 24: Hoare triple {7579#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7579#false} is VALID [2022-04-15 12:49:44,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {7596#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7579#false} is VALID [2022-04-15 12:49:44,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {7595#(<= 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; {7596#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:49:44,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {7594#(<= 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; {7595#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:49:44,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {7593#(<= 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; {7594#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:49:44,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {7592#(<= 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; {7593#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:49:44,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {7591#(<= 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; {7592#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:49:44,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {7590#(<= 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; {7591#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:49:44,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {7590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {7590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:49:44,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {7718#(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; {7590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:49:44,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {7722#(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; {7718#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:49:44,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {7726#(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; {7722#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:49:44,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {7730#(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; {7726#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:49:44,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {7734#(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; {7730#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:49:44,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {7738#(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; {7734#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 12:49:44,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {7742#(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; {7738#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:49:44,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {7578#true} ~z~0 := ~y~0; {7742#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:49:44,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {7578#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[] {7578#true} is VALID [2022-04-15 12:49:44,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {7578#true} [107] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_40| 0) (<= v_main_~x~0_Out_44 v_main_~x~0_In_22) (= |v_main_#t~post6_Out_40| 0) (< 0 (mod (+ v_main_~x~0_Out_44 1) 4294967296)) (= (+ v_main_~x~0_In_22 v_main_~y~0_In_20) (+ v_main_~y~0_Out_40 v_main_~x~0_Out_44))) (and (= v_main_~x~0_In_22 v_main_~x~0_Out_44) (= v_main_~y~0_In_20 v_main_~y~0_Out_40))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_20} OutVars{main_~y~0=v_main_~y~0_Out_40, main_#t~post5=|v_main_#t~post5_Out_40|, main_~x~0=v_main_~x~0_Out_44, main_#t~post6=|v_main_#t~post6_Out_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7578#true} is VALID [2022-04-15 12:49:44,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {7578#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7578#true} is VALID [2022-04-15 12:49:44,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {7578#true} call #t~ret11 := main(); {7578#true} is VALID [2022-04-15 12:49:44,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7578#true} {7578#true} #61#return; {7578#true} is VALID [2022-04-15 12:49:44,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {7578#true} assume true; {7578#true} is VALID [2022-04-15 12:49:44,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {7578#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7578#true} is VALID [2022-04-15 12:49:44,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {7578#true} call ULTIMATE.init(); {7578#true} is VALID [2022-04-15 12:49:44,914 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-15 12:49:44,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957127697] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:44,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:44,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-04-15 12:49:47,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:47,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [276802925] [2022-04-15 12:49:47,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [276802925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:47,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:47,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:49:47,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436727760] [2022-04-15 12:49:47,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:47,350 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-15 12:49:47,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:47,351 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-15 12:49:47,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:47,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:49:47,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:47,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:49:47,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:49:47,571 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-15 12:50:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:02,255 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:50:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:50:02,255 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-15 12:50:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:02,255 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-15 12:50:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2022-04-15 12:50:02,256 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-15 12:50:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2022-04-15 12:50:02,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 43 transitions. [2022-04-15 12:50:02,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:02,688 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:50:02,688 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:50:02,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=396, Invalid=2360, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 12:50:02,689 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:02,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 96 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 12:50:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:50:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 12:50:02,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:02,790 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-15 12:50:02,790 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-15 12:50:02,790 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-15 12:50:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:02,791 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 12:50:02,791 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 12:50:02,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:02,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:02,791 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-15 12:50:02,791 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-15 12:50:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:02,792 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 12:50:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 12:50:02,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:02,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:02,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:02,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:02,792 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-15 12:50:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-15 12:50:02,792 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2022-04-15 12:50:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:02,792 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-15 12:50:02,793 INFO L479 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-15 12:50:02,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-15 12:50:03,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 12:50:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:50:03,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:03,337 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:03,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 12:50:03,553 WARN L460 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-15 12:50:03,553 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:03,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 19 times [2022-04-15 12:50:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:03,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [985023293] [2022-04-15 12:50:03,692 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1328895550, now seen corresponding path program 1 times [2022-04-15 12:50:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:03,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035066981] [2022-04-15 12:50:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:04,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:04,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {8066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8051#true} is VALID [2022-04-15 12:50:04,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {8051#true} assume true; {8051#true} is VALID [2022-04-15 12:50:04,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8051#true} {8051#true} #61#return; {8051#true} is VALID [2022-04-15 12:50:04,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {8051#true} call ULTIMATE.init(); {8066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:04,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {8066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8051#true} is VALID [2022-04-15 12:50:04,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {8051#true} assume true; {8051#true} is VALID [2022-04-15 12:50:04,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8051#true} {8051#true} #61#return; {8051#true} is VALID [2022-04-15 12:50:04,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {8051#true} call #t~ret11 := main(); {8051#true} is VALID [2022-04-15 12:50:04,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {8051#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8051#true} is VALID [2022-04-15 12:50:04,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {8051#true} [109] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= (+ v_main_~x~0_In_23 v_main_~y~0_In_21) (+ v_main_~y~0_Out_42 v_main_~x~0_Out_46)) (= |v_main_#t~post6_Out_42| 0) (= |v_main_#t~post5_Out_42| 0) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23)) (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_23 v_main_~x~0_Out_46))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8051#true} is VALID [2022-04-15 12:50:04,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {8051#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[] {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {8056#(<= 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; {8057#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:50:04,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {8057#(<= 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; {8058#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {8058#(<= 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; {8059#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {8059#(<= 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; {8060#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {8060#(<= 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; {8061#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:50:04,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {8061#(<= 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; {8062#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {8062#(<= 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; {8063#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {8063#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8063#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {8063#(<= 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; {8062#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {8062#(<= 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; {8061#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:50:04,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {8061#(<= 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; {8060#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {8060#(<= 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; {8059#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {8059#(<= 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; {8058#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {8058#(<= 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; {8057#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:50:04,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {8057#(<= 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; {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,104 INFO L272 TraceCheckUtils]: 25: Hoare triple {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:50:04,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {8064#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8065#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:50:04,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {8065#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8052#false} is VALID [2022-04-15 12:50:04,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {8052#false} assume !false; {8052#false} is VALID [2022-04-15 12:50:04,105 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-15 12:50:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:04,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035066981] [2022-04-15 12:50:04,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035066981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:04,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938266766] [2022-04-15 12:50:04,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:04,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:04,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:50:04,106 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:50:04,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:50:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:04,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:50:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:04,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:50:04,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {8051#true} call ULTIMATE.init(); {8051#true} is VALID [2022-04-15 12:50:04,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {8051#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8051#true} is VALID [2022-04-15 12:50:04,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {8051#true} assume true; {8051#true} is VALID [2022-04-15 12:50:04,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8051#true} {8051#true} #61#return; {8051#true} is VALID [2022-04-15 12:50:04,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {8051#true} call #t~ret11 := main(); {8051#true} is VALID [2022-04-15 12:50:04,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {8051#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8051#true} is VALID [2022-04-15 12:50:04,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {8051#true} [109] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= (+ v_main_~x~0_In_23 v_main_~y~0_In_21) (+ v_main_~y~0_Out_42 v_main_~x~0_Out_46)) (= |v_main_#t~post6_Out_42| 0) (= |v_main_#t~post5_Out_42| 0) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23)) (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_23 v_main_~x~0_Out_46))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8051#true} is VALID [2022-04-15 12:50:04,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {8051#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[] {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {8056#(<= 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; {8057#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:50:04,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {8057#(<= 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; {8058#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {8058#(<= 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; {8059#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {8059#(<= 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; {8060#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {8060#(<= 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; {8061#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:50:04,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {8061#(<= 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; {8062#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {8062#(<= 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; {8063#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {8063#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8063#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {8063#(<= 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; {8062#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {8062#(<= 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; {8061#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:50:04,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {8061#(<= 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; {8060#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {8060#(<= 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; {8059#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {8059#(<= 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; {8058#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {8058#(<= 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; {8057#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:50:04,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {8057#(<= 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; {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,523 INFO L272 TraceCheckUtils]: 25: Hoare triple {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:50:04,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {8145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:50:04,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {8149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8052#false} is VALID [2022-04-15 12:50:04,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {8052#false} assume !false; {8052#false} is VALID [2022-04-15 12:50:04,524 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-15 12:50:04,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:50:04,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {8052#false} assume !false; {8052#false} is VALID [2022-04-15 12:50:04,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {8149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8052#false} is VALID [2022-04-15 12:50:04,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {8145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:50:04,829 INFO L272 TraceCheckUtils]: 25: Hoare triple {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:50:04,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {8057#(<= 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; {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {8058#(<= 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; {8057#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:50:04,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {8059#(<= 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; {8058#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {8060#(<= 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; {8059#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {8061#(<= 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; {8060#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {8062#(<= 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; {8061#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:50:04,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {8063#(<= 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; {8062#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {8063#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8063#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {8062#(<= 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; {8063#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {8061#(<= 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; {8062#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {8060#(<= 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; {8061#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:50:04,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {8059#(<= 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; {8060#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {8058#(<= 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; {8059#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {8057#(<= 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; {8058#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:04,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {8056#(<= 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; {8057#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:50:04,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {8051#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[] {8056#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:50:04,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {8051#true} [109] L16-2-->L16-3_primed: Formula: (or (and (< 0 (mod (+ v_main_~x~0_Out_46 1) 4294967296)) (= (+ v_main_~x~0_In_23 v_main_~y~0_In_21) (+ v_main_~y~0_Out_42 v_main_~x~0_Out_46)) (= |v_main_#t~post6_Out_42| 0) (= |v_main_#t~post5_Out_42| 0) (<= v_main_~x~0_Out_46 v_main_~x~0_In_23)) (and (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_23 v_main_~x~0_Out_46))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_21} OutVars{main_~y~0=v_main_~y~0_Out_42, main_#t~post5=|v_main_#t~post5_Out_42|, main_~x~0=v_main_~x~0_Out_46, main_#t~post6=|v_main_#t~post6_Out_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8051#true} is VALID [2022-04-15 12:50:04,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {8051#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8051#true} is VALID [2022-04-15 12:50:04,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {8051#true} call #t~ret11 := main(); {8051#true} is VALID [2022-04-15 12:50:04,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8051#true} {8051#true} #61#return; {8051#true} is VALID [2022-04-15 12:50:04,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {8051#true} assume true; {8051#true} is VALID [2022-04-15 12:50:04,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {8051#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8051#true} is VALID [2022-04-15 12:50:04,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {8051#true} call ULTIMATE.init(); {8051#true} is VALID [2022-04-15 12:50:04,872 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-15 12:50:04,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938266766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:50:04,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:50:04,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2022-04-15 12:50:07,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:07,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [985023293] [2022-04-15 12:50:07,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [985023293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:07,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:07,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:50:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266751646] [2022-04-15 12:50:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:07,071 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-15 12:50:07,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:07,071 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-15 12:50:07,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:07,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:50:07,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:07,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:50:07,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:50:07,251 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-15 12:50:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:15,444 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-15 12:50:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:50:15,444 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-15 12:50:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:15,444 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-15 12:50:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2022-04-15 12:50:15,445 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-15 12:50:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2022-04-15 12:50:15,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 67 transitions. [2022-04-15 12:50:15,693 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-15 12:50:15,694 INFO L225 Difference]: With dead ends: 64 [2022-04-15 12:50:15,694 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:50:15,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=344, Invalid=1138, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:50:15,695 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:15,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 45 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 12:50:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:50:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2022-04-15 12:50:15,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:15,812 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-15 12:50:15,812 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-15 12:50:15,812 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-15 12:50:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:15,813 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-15 12:50:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-15 12:50:15,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:15,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:15,813 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-15 12:50:15,813 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-15 12:50:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:15,814 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-15 12:50:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-15 12:50:15,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:15,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:15,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:15,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:15,814 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-15 12:50:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 12:50:15,815 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2022-04-15 12:50:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:15,815 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 12:50:15,815 INFO L479 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-15 12:50:15,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-15 12:50:16,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 12:50:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:50:16,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:16,633 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:16,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:50:16,833 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 12:50:16,833 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:16,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash -858602802, now seen corresponding path program 20 times [2022-04-15 12:50:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:16,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [156736619] [2022-04-15 12:50:16,965 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash 636099631, now seen corresponding path program 1 times [2022-04-15 12:50:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:16,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493837618] [2022-04-15 12:50:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:17,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {8626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8605#true} is VALID [2022-04-15 12:50:17,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {8605#true} assume true; {8605#true} is VALID [2022-04-15 12:50:17,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8605#true} {8605#true} #61#return; {8605#true} is VALID [2022-04-15 12:50:17,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {8605#true} call ULTIMATE.init(); {8626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:17,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {8626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8605#true} is VALID [2022-04-15 12:50:17,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {8605#true} assume true; {8605#true} is VALID [2022-04-15 12:50:17,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8605#true} {8605#true} #61#return; {8605#true} is VALID [2022-04-15 12:50:17,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {8605#true} call #t~ret11 := main(); {8605#true} is VALID [2022-04-15 12:50:17,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {8605#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8605#true} is VALID [2022-04-15 12:50:17,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {8605#true} [111] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_44| 0) (= (+ v_main_~x~0_In_24 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_48)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post5_Out_44| 0)) (and (= v_main_~x~0_In_24 v_main_~x~0_Out_48) (= v_main_~y~0_In_22 v_main_~y~0_Out_44))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8605#true} is VALID [2022-04-15 12:50:17,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {8605#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[] {8605#true} is VALID [2022-04-15 12:50:17,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {8605#true} ~z~0 := ~y~0; {8610#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:50:17,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {8610#(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; {8611#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:50:17,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {8611#(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; {8612#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:50:17,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {8612#(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; {8613#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:50:17,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {8613#(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; {8614#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:50:17,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {8614#(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; {8615#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:50:17,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {8615#(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; {8616#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:50:17,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {8616#(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; {8617#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:50:17,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {8617#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8618#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:17,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {8618#(<= 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; {8619#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:50:17,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {8619#(<= 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; {8620#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:17,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {8620#(<= 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; {8621#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:17,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {8621#(<= 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; {8622#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:17,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {8622#(<= 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; {8623#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:17,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {8623#(<= 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; {8624#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:50:17,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {8624#(<= 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; {8625#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:50:17,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {8625#(<= 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; {8606#false} is VALID [2022-04-15 12:50:17,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {8606#false} assume !(~y~0 % 4294967296 > 0); {8606#false} is VALID [2022-04-15 12:50:17,581 INFO L272 TraceCheckUtils]: 26: Hoare triple {8606#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8606#false} is VALID [2022-04-15 12:50:17,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {8606#false} ~cond := #in~cond; {8606#false} is VALID [2022-04-15 12:50:17,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {8606#false} assume 0 == ~cond; {8606#false} is VALID [2022-04-15 12:50:17,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {8606#false} assume !false; {8606#false} is VALID [2022-04-15 12:50:17,581 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-15 12:50:17,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:17,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493837618] [2022-04-15 12:50:17,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493837618] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:17,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515139877] [2022-04-15 12:50:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:17,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:17,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:50:17,583 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:50:17,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:50:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:17,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 12:50:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:17,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:50:18,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {8605#true} call ULTIMATE.init(); {8605#true} is VALID [2022-04-15 12:50:18,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {8605#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8605#true} is VALID [2022-04-15 12:50:18,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {8605#true} assume true; {8605#true} is VALID [2022-04-15 12:50:18,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8605#true} {8605#true} #61#return; {8605#true} is VALID [2022-04-15 12:50:18,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {8605#true} call #t~ret11 := main(); {8605#true} is VALID [2022-04-15 12:50:18,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {8605#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8605#true} is VALID [2022-04-15 12:50:18,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {8605#true} [111] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_44| 0) (= (+ v_main_~x~0_In_24 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_48)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post5_Out_44| 0)) (and (= v_main_~x~0_In_24 v_main_~x~0_Out_48) (= v_main_~y~0_In_22 v_main_~y~0_Out_44))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8605#true} is VALID [2022-04-15 12:50:18,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {8605#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[] {8605#true} is VALID [2022-04-15 12:50:18,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {8605#true} ~z~0 := ~y~0; {8610#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:50:18,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {8610#(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; {8611#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:50:18,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {8611#(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; {8612#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:50:18,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {8612#(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; {8613#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:50:18,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {8613#(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; {8614#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:50:18,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {8614#(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; {8615#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:50:18,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {8615#(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; {8616#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:50:18,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {8616#(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; {8617#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:50:18,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {8617#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8618#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:18,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {8618#(<= 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; {8619#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:50:18,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {8619#(<= 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; {8620#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:18,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {8620#(<= 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; {8621#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:18,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {8621#(<= 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; {8622#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:18,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {8622#(<= 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; {8623#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:18,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {8623#(<= 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; {8624#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:50:18,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {8624#(<= 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; {8625#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:50:18,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {8625#(<= 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; {8606#false} is VALID [2022-04-15 12:50:18,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {8606#false} assume !(~y~0 % 4294967296 > 0); {8606#false} is VALID [2022-04-15 12:50:18,077 INFO L272 TraceCheckUtils]: 26: Hoare triple {8606#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8606#false} is VALID [2022-04-15 12:50:18,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {8606#false} ~cond := #in~cond; {8606#false} is VALID [2022-04-15 12:50:18,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {8606#false} assume 0 == ~cond; {8606#false} is VALID [2022-04-15 12:50:18,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {8606#false} assume !false; {8606#false} is VALID [2022-04-15 12:50:18,077 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-15 12:50:18,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:50:18,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {8606#false} assume !false; {8606#false} is VALID [2022-04-15 12:50:18,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {8606#false} assume 0 == ~cond; {8606#false} is VALID [2022-04-15 12:50:18,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {8606#false} ~cond := #in~cond; {8606#false} is VALID [2022-04-15 12:50:18,981 INFO L272 TraceCheckUtils]: 26: Hoare triple {8606#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8606#false} is VALID [2022-04-15 12:50:18,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {8606#false} assume !(~y~0 % 4294967296 > 0); {8606#false} is VALID [2022-04-15 12:50:18,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {8625#(<= 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; {8606#false} is VALID [2022-04-15 12:50:18,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {8624#(<= 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; {8625#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:50:18,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {8623#(<= 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; {8624#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:50:18,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {8622#(<= 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; {8623#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:18,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {8621#(<= 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; {8622#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:18,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {8620#(<= 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; {8621#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:19,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {8619#(<= 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; {8620#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:19,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {8618#(<= 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; {8619#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:50:19,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {8756#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8618#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:19,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {8760#(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; {8756#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:19,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {8764#(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; {8760#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:19,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {8768#(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; {8764#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:19,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {8772#(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; {8768#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:19,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {8776#(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; {8772#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:19,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {8780#(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; {8776#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:19,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {8784#(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; {8780#(or (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:50:19,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {8605#true} ~z~0 := ~y~0; {8784#(or (< 0 (mod (+ main_~z~0 4294967289) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:19,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {8605#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[] {8605#true} is VALID [2022-04-15 12:50:19,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {8605#true} [111] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_44| 0) (= (+ v_main_~x~0_In_24 v_main_~y~0_In_22) (+ v_main_~y~0_Out_44 v_main_~x~0_Out_48)) (<= v_main_~x~0_Out_48 v_main_~x~0_In_24) (< 0 (mod (+ v_main_~x~0_Out_48 1) 4294967296)) (= |v_main_#t~post5_Out_44| 0)) (and (= v_main_~x~0_In_24 v_main_~x~0_Out_48) (= v_main_~y~0_In_22 v_main_~y~0_Out_44))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_22} OutVars{main_~y~0=v_main_~y~0_Out_44, main_#t~post5=|v_main_#t~post5_Out_44|, main_~x~0=v_main_~x~0_Out_48, main_#t~post6=|v_main_#t~post6_Out_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8605#true} is VALID [2022-04-15 12:50:19,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {8605#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8605#true} is VALID [2022-04-15 12:50:19,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {8605#true} call #t~ret11 := main(); {8605#true} is VALID [2022-04-15 12:50:19,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8605#true} {8605#true} #61#return; {8605#true} is VALID [2022-04-15 12:50:19,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {8605#true} assume true; {8605#true} is VALID [2022-04-15 12:50:19,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {8605#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8605#true} is VALID [2022-04-15 12:50:19,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {8605#true} call ULTIMATE.init(); {8605#true} is VALID [2022-04-15 12:50:19,025 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-15 12:50:19,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515139877] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:50:19,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:50:19,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 27 [2022-04-15 12:50:22,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:22,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [156736619] [2022-04-15 12:50:22,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [156736619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:22,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:22,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:50:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678165010] [2022-04-15 12:50:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:22,388 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-15 12:50:22,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:22,388 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-15 12:50:22,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:22,515 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:50:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:22,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:50:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:50:22,516 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-15 12:50:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:41,983 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-04-15 12:50:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:50:41,983 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-15 12:50:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:41,984 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-15 12:50:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2022-04-15 12:50:41,984 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-15 12:50:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2022-04-15 12:50:41,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 61 transitions. [2022-04-15 12:50:42,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:42,457 INFO L225 Difference]: With dead ends: 69 [2022-04-15 12:50:42,457 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:50:42,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=477, Invalid=3813, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:50:42,459 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:42,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 103 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 12:50:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:50:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 12:50:42,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:42,579 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-15 12:50:42,579 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-15 12:50:42,579 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-15 12:50:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:42,579 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 12:50:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 12:50:42,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:42,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:42,580 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-15 12:50:42,580 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-15 12:50:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:42,580 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 12:50:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 12:50:42,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:42,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:42,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:42,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:42,581 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-15 12:50:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-04-15 12:50:42,581 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36 [2022-04-15 12:50:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:42,581 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-04-15 12:50:42,581 INFO L479 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-15 12:50:42,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2022-04-15 12:50:43,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:43,646 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 12:50:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:50:43,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:43,646 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:43,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-15 12:50:43,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 12:50:43,847 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash 843169312, now seen corresponding path program 21 times [2022-04-15 12:50:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:43,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [616187417] [2022-04-15 12:50:43,981 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1499769632, now seen corresponding path program 1 times [2022-04-15 12:50:43,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:43,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959218324] [2022-04-15 12:50:43,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:44,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:44,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {9199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9178#true} is VALID [2022-04-15 12:50:44,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {9178#true} assume true; {9178#true} is VALID [2022-04-15 12:50:44,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9178#true} {9178#true} #61#return; {9178#true} is VALID [2022-04-15 12:50:44,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {9178#true} call ULTIMATE.init(); {9199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:44,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {9199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9178#true} is VALID [2022-04-15 12:50:44,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {9178#true} assume true; {9178#true} is VALID [2022-04-15 12:50:44,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9178#true} {9178#true} #61#return; {9178#true} is VALID [2022-04-15 12:50:44,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {9178#true} call #t~ret11 := main(); {9178#true} is VALID [2022-04-15 12:50:44,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {9178#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9178#true} is VALID [2022-04-15 12:50:44,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {9178#true} [113] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_23 v_main_~y~0_Out_46) (= v_main_~x~0_In_25 v_main_~x~0_Out_50)) (and (= |v_main_#t~post5_Out_46| 0) (= |v_main_#t~post6_Out_46| 0) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_23) (+ v_main_~y~0_Out_46 v_main_~x~0_Out_50)))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9178#true} is VALID [2022-04-15 12:50:44,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {9178#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[] {9178#true} is VALID [2022-04-15 12:50:44,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {9178#true} ~z~0 := ~y~0; {9183#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:50:44,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {9183#(= 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; {9184#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:50:44,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {9184#(= (+ (- 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; {9185#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:50:44,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {9185#(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; {9186#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:50:44,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {9186#(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; {9187#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:50:44,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {9187#(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; {9188#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:50:44,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {9188#(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; {9189#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:50:44,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {9189#(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; {9190#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:50:44,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {9190#(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; {9191#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:44,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {9191#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9191#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:44,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {9191#(<= 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; {9192#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:50:44,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {9192#(<= 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; {9193#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:50:44,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {9193#(<= 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; {9194#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:50:44,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {9194#(<= 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; {9195#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:50:44,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {9195#(<= 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; {9196#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:50:44,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {9196#(<= 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; {9197#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:50:44,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {9197#(<= 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; {9198#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:50:44,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {9198#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9179#false} is VALID [2022-04-15 12:50:44,588 INFO L272 TraceCheckUtils]: 26: Hoare triple {9179#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9179#false} is VALID [2022-04-15 12:50:44,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {9179#false} ~cond := #in~cond; {9179#false} is VALID [2022-04-15 12:50:44,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {9179#false} assume 0 == ~cond; {9179#false} is VALID [2022-04-15 12:50:44,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {9179#false} assume !false; {9179#false} is VALID [2022-04-15 12:50:44,589 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-15 12:50:44,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:44,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959218324] [2022-04-15 12:50:44,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959218324] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:44,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029117792] [2022-04-15 12:50:44,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:44,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:44,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:50:44,590 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:50:44,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:50:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:44,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:50:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:44,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:50:45,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {9178#true} call ULTIMATE.init(); {9178#true} is VALID [2022-04-15 12:50:45,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {9178#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9178#true} is VALID [2022-04-15 12:50:45,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {9178#true} assume true; {9178#true} is VALID [2022-04-15 12:50:45,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9178#true} {9178#true} #61#return; {9178#true} is VALID [2022-04-15 12:50:45,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {9178#true} call #t~ret11 := main(); {9178#true} is VALID [2022-04-15 12:50:45,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {9178#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9178#true} is VALID [2022-04-15 12:50:45,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {9178#true} [113] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_23 v_main_~y~0_Out_46) (= v_main_~x~0_In_25 v_main_~x~0_Out_50)) (and (= |v_main_#t~post5_Out_46| 0) (= |v_main_#t~post6_Out_46| 0) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_23) (+ v_main_~y~0_Out_46 v_main_~x~0_Out_50)))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9178#true} is VALID [2022-04-15 12:50:45,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {9178#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[] {9178#true} is VALID [2022-04-15 12:50:45,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {9178#true} ~z~0 := ~y~0; {9183#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:50:45,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {9183#(= 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; {9184#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:50:45,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {9184#(= (+ (- 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; {9185#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:50:45,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {9185#(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; {9186#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:50:45,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {9186#(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; {9187#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:50:45,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {9187#(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; {9188#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:50:45,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {9188#(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; {9189#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:50:45,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {9189#(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; {9190#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:50:45,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {9190#(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; {9191#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:45,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {9191#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9191#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:45,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {9191#(<= 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; {9192#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:50:45,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {9192#(<= 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; {9193#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:50:45,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {9193#(<= 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; {9194#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:50:45,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {9194#(<= 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; {9195#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:50:45,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {9195#(<= 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; {9196#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:50:45,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {9196#(<= 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; {9197#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:50:45,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {9197#(<= 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; {9198#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:50:45,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {9198#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9179#false} is VALID [2022-04-15 12:50:45,119 INFO L272 TraceCheckUtils]: 26: Hoare triple {9179#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9179#false} is VALID [2022-04-15 12:50:45,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {9179#false} ~cond := #in~cond; {9179#false} is VALID [2022-04-15 12:50:45,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {9179#false} assume 0 == ~cond; {9179#false} is VALID [2022-04-15 12:50:45,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {9179#false} assume !false; {9179#false} is VALID [2022-04-15 12:50:45,120 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-15 12:50:45,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:50:46,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {9179#false} assume !false; {9179#false} is VALID [2022-04-15 12:50:46,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {9179#false} assume 0 == ~cond; {9179#false} is VALID [2022-04-15 12:50:46,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {9179#false} ~cond := #in~cond; {9179#false} is VALID [2022-04-15 12:50:46,143 INFO L272 TraceCheckUtils]: 26: Hoare triple {9179#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9179#false} is VALID [2022-04-15 12:50:46,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {9198#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9179#false} is VALID [2022-04-15 12:50:46,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {9197#(<= 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; {9198#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:50:46,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {9196#(<= 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; {9197#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:50:46,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {9195#(<= 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; {9196#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:50:46,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {9194#(<= 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; {9195#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:50:46,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {9193#(<= 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; {9194#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:50:46,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {9192#(<= 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; {9193#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:50:46,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {9191#(<= 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; {9192#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:50:46,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {9191#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9191#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:46,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {9329#(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; {9191#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:50:46,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {9333#(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; {9329#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:50:46,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {9337#(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; {9333#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))))} is VALID [2022-04-15 12:50:46,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {9341#(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; {9337#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:50:46,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {9345#(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; {9341#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 12:50:46,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {9349#(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; {9345#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:50:46,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {9353#(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; {9349#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:50:46,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {9357#(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; {9353#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:50:46,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {9178#true} ~z~0 := ~y~0; {9357#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 12:50:46,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {9178#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[] {9178#true} is VALID [2022-04-15 12:50:46,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {9178#true} [113] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_23 v_main_~y~0_Out_46) (= v_main_~x~0_In_25 v_main_~x~0_Out_50)) (and (= |v_main_#t~post5_Out_46| 0) (= |v_main_#t~post6_Out_46| 0) (<= v_main_~x~0_Out_50 v_main_~x~0_In_25) (< 0 (mod (+ v_main_~x~0_Out_50 1) 4294967296)) (= (+ v_main_~x~0_In_25 v_main_~y~0_In_23) (+ v_main_~y~0_Out_46 v_main_~x~0_Out_50)))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_23} OutVars{main_~y~0=v_main_~y~0_Out_46, main_#t~post5=|v_main_#t~post5_Out_46|, main_~x~0=v_main_~x~0_Out_50, main_#t~post6=|v_main_#t~post6_Out_46|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9178#true} is VALID [2022-04-15 12:50:46,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {9178#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9178#true} is VALID [2022-04-15 12:50:46,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {9178#true} call #t~ret11 := main(); {9178#true} is VALID [2022-04-15 12:50:46,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9178#true} {9178#true} #61#return; {9178#true} is VALID [2022-04-15 12:50:46,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {9178#true} assume true; {9178#true} is VALID [2022-04-15 12:50:46,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {9178#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9178#true} is VALID [2022-04-15 12:50:46,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {9178#true} call ULTIMATE.init(); {9178#true} is VALID [2022-04-15 12:50:46,191 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-15 12:50:46,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029117792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:50:46,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:50:46,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 27 [2022-04-15 12:50:51,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:51,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [616187417] [2022-04-15 12:50:51,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [616187417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:51,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:51,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:50:51,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838528205] [2022-04-15 12:50:51,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:51,902 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-15 12:50:51,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:51,902 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-15 12:50:52,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:52,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:50:52,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:52,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:50:52,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1079, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:50:52,063 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-15 12:51:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:22,844 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 12:51:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:51:22,845 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-15 12:51:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:22,845 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-15 12:51:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2022-04-15 12:51:22,845 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-15 12:51:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2022-04-15 12:51:22,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 46 transitions. [2022-04-15 12:51:23,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:23,965 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:51:23,965 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:51:23,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=491, Invalid=3049, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:51:23,966 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:23,967 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 101 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-04-15 12:51:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:51:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 12:51:24,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:24,090 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-15 12:51:24,090 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-15 12:51:24,090 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-15 12:51:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:24,091 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:51:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:51:24,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:24,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:24,091 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-15 12:51:24,091 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-15 12:51:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:24,092 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:51:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:51:24,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:24,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:24,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:24,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:24,092 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-15 12:51:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-15 12:51:24,093 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37 [2022-04-15 12:51:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:24,093 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-15 12:51:24,093 INFO L479 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-15 12:51:24,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-15 12:51:24,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:51:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 12:51:24,858 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:24,858 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:24,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:51:25,058 WARN L460 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-15 12:51:25,059 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:25,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 22 times [2022-04-15 12:51:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:25,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1007928915] [2022-04-15 12:51:25,160 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash -710751475, now seen corresponding path program 1 times [2022-04-15 12:51:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:25,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95566249] [2022-04-15 12:51:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:25,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:25,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {9707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9691#true} is VALID [2022-04-15 12:51:25,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {9691#true} assume true; {9691#true} is VALID [2022-04-15 12:51:25,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9691#true} {9691#true} #61#return; {9691#true} is VALID [2022-04-15 12:51:25,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {9691#true} call ULTIMATE.init(); {9707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:25,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {9707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9691#true} is VALID [2022-04-15 12:51:25,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {9691#true} assume true; {9691#true} is VALID [2022-04-15 12:51:25,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9691#true} {9691#true} #61#return; {9691#true} is VALID [2022-04-15 12:51:25,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {9691#true} call #t~ret11 := main(); {9691#true} is VALID [2022-04-15 12:51:25,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {9691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9691#true} is VALID [2022-04-15 12:51:25,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {9691#true} [115] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_52)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9691#true} is VALID [2022-04-15 12:51:25,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {9691#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[] {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:25,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:25,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {9696#(<= 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; {9697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:25,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {9697#(<= 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; {9698#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {9698#(<= 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; {9699#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {9699#(<= 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; {9700#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {9700#(<= 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; {9701#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:51:25,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {9701#(<= 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; {9702#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {9702#(<= 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; {9703#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {9703#(<= 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; {9704#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {9704#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9704#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {9704#(<= 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; {9703#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {9703#(<= 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; {9702#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {9702#(<= 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; {9701#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:51:25,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {9701#(<= 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; {9700#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {9700#(<= 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; {9699#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {9699#(<= 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; {9698#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:25,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {9698#(<= 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; {9697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:25,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {9697#(<= 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; {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:25,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:25,722 INFO L272 TraceCheckUtils]: 27: Hoare triple {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9705#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:51:25,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {9705#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9706#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:51:25,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {9706#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9692#false} is VALID [2022-04-15 12:51:25,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {9692#false} assume !false; {9692#false} is VALID [2022-04-15 12:51:25,723 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-15 12:51:25,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:25,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95566249] [2022-04-15 12:51:25,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95566249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:51:25,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080723582] [2022-04-15 12:51:25,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:25,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:25,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:51:25,724 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:51:25,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:51:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:25,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 12:51:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:25,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:51:26,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {9691#true} call ULTIMATE.init(); {9691#true} is VALID [2022-04-15 12:51:26,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {9691#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9691#true} is VALID [2022-04-15 12:51:26,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {9691#true} assume true; {9691#true} is VALID [2022-04-15 12:51:26,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9691#true} {9691#true} #61#return; {9691#true} is VALID [2022-04-15 12:51:26,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {9691#true} call #t~ret11 := main(); {9691#true} is VALID [2022-04-15 12:51:26,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {9691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9691#true} is VALID [2022-04-15 12:51:26,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {9691#true} [115] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_52)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9691#true} is VALID [2022-04-15 12:51:26,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {9691#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[] {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:26,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:26,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {9696#(<= 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; {9697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:26,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {9697#(<= 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; {9698#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {9698#(<= 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; {9699#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {9699#(<= 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; {9700#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {9700#(<= 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; {9701#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:51:26,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {9701#(<= 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; {9702#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {9702#(<= 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; {9703#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {9703#(<= 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; {9704#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {9704#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9704#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {9704#(<= 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; {9703#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {9703#(<= 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; {9702#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {9702#(<= 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; {9701#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:51:26,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {9701#(<= 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; {9700#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {9700#(<= 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; {9699#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {9699#(<= 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; {9698#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {9698#(<= 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; {9697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:26,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {9697#(<= 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; {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:26,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:26,178 INFO L272 TraceCheckUtils]: 27: Hoare triple {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9792#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:51:26,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {9792#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9796#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:51:26,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {9796#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9692#false} is VALID [2022-04-15 12:51:26,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {9692#false} assume !false; {9692#false} is VALID [2022-04-15 12:51:26,179 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-15 12:51:26,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:51:26,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {9692#false} assume !false; {9692#false} is VALID [2022-04-15 12:51:26,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {9796#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9692#false} is VALID [2022-04-15 12:51:26,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {9792#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9796#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:51:26,517 INFO L272 TraceCheckUtils]: 27: Hoare triple {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9792#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:51:26,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:26,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {9697#(<= 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; {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:26,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {9698#(<= 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; {9697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:26,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {9699#(<= 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; {9698#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {9700#(<= 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; {9699#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {9701#(<= 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; {9700#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {9702#(<= 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; {9701#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:51:26,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {9703#(<= 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; {9702#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {9704#(<= 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; {9703#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {9704#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9704#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {9703#(<= 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; {9704#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {9702#(<= 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; {9703#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {9701#(<= 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; {9702#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {9700#(<= 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; {9701#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:51:26,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {9699#(<= 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; {9700#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {9698#(<= 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; {9699#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {9697#(<= 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; {9698#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:26,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {9696#(<= 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; {9697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:51:26,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:26,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {9691#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[] {9696#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:51:26,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {9691#true} [115] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) (and (< 0 (mod (+ v_main_~x~0_Out_52 1) 4294967296)) (<= v_main_~x~0_Out_52 v_main_~x~0_In_26) (= (+ v_main_~x~0_In_26 v_main_~y~0_In_24) (+ v_main_~y~0_Out_48 v_main_~x~0_Out_52)) (= |v_main_#t~post6_Out_48| 0) (= |v_main_#t~post5_Out_48| 0))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_24} OutVars{main_~y~0=v_main_~y~0_Out_48, main_#t~post5=|v_main_#t~post5_Out_48|, main_~x~0=v_main_~x~0_Out_52, main_#t~post6=|v_main_#t~post6_Out_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9691#true} is VALID [2022-04-15 12:51:26,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {9691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9691#true} is VALID [2022-04-15 12:51:26,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {9691#true} call #t~ret11 := main(); {9691#true} is VALID [2022-04-15 12:51:26,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9691#true} {9691#true} #61#return; {9691#true} is VALID [2022-04-15 12:51:26,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {9691#true} assume true; {9691#true} is VALID [2022-04-15 12:51:26,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {9691#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9691#true} is VALID [2022-04-15 12:51:26,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {9691#true} call ULTIMATE.init(); {9691#true} is VALID [2022-04-15 12:51:26,584 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-15 12:51:26,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080723582] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:51:26,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:51:26,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2022-04-15 12:51:31,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:31,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1007928915] [2022-04-15 12:51:31,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1007928915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:31,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:31,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:51:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568793934] [2022-04-15 12:51:31,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:31,223 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-15 12:51:31,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:31,224 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-15 12:51:31,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:31,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:51:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:31,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:51:31,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:51:31,532 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-15 12:51:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:43,956 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-04-15 12:51:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:51:43,956 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-15 12:51:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:43,956 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-15 12:51:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-15 12:51:43,957 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-15 12:51:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-15 12:51:43,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 73 transitions. [2022-04-15 12:51:44,568 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-15 12:51:44,569 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:51:44,569 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 12:51:44,570 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:51:44,570 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:44,570 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 35 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 12:51:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 12:51:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2022-04-15 12:51:44,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:44,715 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-15 12:51:44,716 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-15 12:51:44,716 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-15 12:51:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:44,716 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-15 12:51:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-15 12:51:44,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:44,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:44,717 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-15 12:51:44,717 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-15 12:51:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:44,718 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-15 12:51:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-15 12:51:44,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:44,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:44,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:44,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:44,718 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-15 12:51:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-04-15 12:51:44,718 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2022-04-15 12:51:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:44,718 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-04-15 12:51:44,719 INFO L479 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-15 12:51:44,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 44 transitions. [2022-04-15 12:51:45,938 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-15 12:51:45,939 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-15 12:51:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:51:45,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:45,939 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:45,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 12:51:46,139 WARN L460 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-15 12:51:46,140 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:46,140 INFO L85 PathProgramCache]: Analyzing trace with hash -359267392, now seen corresponding path program 23 times [2022-04-15 12:51:46,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:46,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [348653696] [2022-04-15 12:51:46,280 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:51:46,281 INFO L85 PathProgramCache]: Analyzing trace with hash -321375936, now seen corresponding path program 1 times [2022-04-15 12:51:46,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:46,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947836395] [2022-04-15 12:51:46,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:46,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:47,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:47,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {10316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10293#true} is VALID [2022-04-15 12:51:47,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {10293#true} assume true; {10293#true} is VALID [2022-04-15 12:51:47,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10293#true} {10293#true} #61#return; {10293#true} is VALID [2022-04-15 12:51:47,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {10293#true} call ULTIMATE.init(); {10316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:47,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {10316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10293#true} is VALID [2022-04-15 12:51:47,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {10293#true} assume true; {10293#true} is VALID [2022-04-15 12:51:47,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10293#true} {10293#true} #61#return; {10293#true} is VALID [2022-04-15 12:51:47,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {10293#true} call #t~ret11 := main(); {10293#true} is VALID [2022-04-15 12:51:47,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {10293#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10293#true} is VALID [2022-04-15 12:51:47,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {10293#true} [117] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_27 v_main_~x~0_Out_54)) (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (= (+ v_main_~y~0_Out_50 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_25)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= |v_main_#t~post5_Out_50| 0) (= |v_main_#t~post6_Out_50| 0))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10293#true} is VALID [2022-04-15 12:51:47,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {10293#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[] {10293#true} is VALID [2022-04-15 12:51:47,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {10293#true} ~z~0 := ~y~0; {10298#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:51:47,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {10298#(= 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; {10299#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:51:47,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {10299#(= (+ (- 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; {10300#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:51:47,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {10300#(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; {10301#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:51:47,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {10301#(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; {10302#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:51:47,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {10302#(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; {10303#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:51:47,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {10303#(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; {10304#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:51:47,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {10304#(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; {10305#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:51:47,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {10305#(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; {10306#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 12:51:47,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {10306#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {10307#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 12:51:47,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {10307#(<= 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; {10308#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:47,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {10308#(<= 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; {10309#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:51:47,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {10309#(<= 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; {10310#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:47,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {10310#(<= 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; {10311#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:47,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {10311#(<= 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; {10312#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:47,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {10312#(<= 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; {10313#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:47,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {10313#(<= 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; {10314#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:51:47,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {10314#(<= 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; {10315#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:51:47,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {10315#(<= 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; {10294#false} is VALID [2022-04-15 12:51:47,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {10294#false} assume !(~y~0 % 4294967296 > 0); {10294#false} is VALID [2022-04-15 12:51:47,161 INFO L272 TraceCheckUtils]: 28: Hoare triple {10294#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10294#false} is VALID [2022-04-15 12:51:47,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {10294#false} ~cond := #in~cond; {10294#false} is VALID [2022-04-15 12:51:47,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {10294#false} assume 0 == ~cond; {10294#false} is VALID [2022-04-15 12:51:47,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {10294#false} assume !false; {10294#false} is VALID [2022-04-15 12:51:47,162 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-15 12:51:47,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:47,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947836395] [2022-04-15 12:51:47,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947836395] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:51:47,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198944488] [2022-04-15 12:51:47,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:47,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:47,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:51:47,163 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:51:47,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:51:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:47,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 12:51:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:47,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:51:47,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {10293#true} call ULTIMATE.init(); {10293#true} is VALID [2022-04-15 12:51:47,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {10293#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10293#true} is VALID [2022-04-15 12:51:47,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {10293#true} assume true; {10293#true} is VALID [2022-04-15 12:51:47,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10293#true} {10293#true} #61#return; {10293#true} is VALID [2022-04-15 12:51:47,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {10293#true} call #t~ret11 := main(); {10293#true} is VALID [2022-04-15 12:51:47,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {10293#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10293#true} is VALID [2022-04-15 12:51:47,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {10293#true} [117] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_27 v_main_~x~0_Out_54)) (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (= (+ v_main_~y~0_Out_50 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_25)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= |v_main_#t~post5_Out_50| 0) (= |v_main_#t~post6_Out_50| 0))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10293#true} is VALID [2022-04-15 12:51:47,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {10293#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[] {10293#true} is VALID [2022-04-15 12:51:47,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {10293#true} ~z~0 := ~y~0; {10298#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:51:47,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {10298#(= 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; {10299#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:51:47,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {10299#(= (+ (- 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; {10300#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:51:47,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {10300#(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; {10301#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:51:47,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {10301#(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; {10302#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:51:47,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {10302#(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; {10303#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:51:47,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {10303#(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; {10304#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:51:47,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {10304#(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; {10305#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:51:47,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {10305#(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; {10306#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 12:51:47,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {10306#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {10307#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 12:51:47,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {10307#(<= 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; {10308#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:47,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {10308#(<= 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; {10309#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:51:47,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {10309#(<= 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; {10310#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:47,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {10310#(<= 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; {10311#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:47,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {10311#(<= 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; {10312#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:47,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {10312#(<= 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; {10313#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:47,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {10313#(<= 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; {10314#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:51:47,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {10314#(<= 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; {10315#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:51:47,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {10315#(<= 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; {10294#false} is VALID [2022-04-15 12:51:47,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {10294#false} assume !(~y~0 % 4294967296 > 0); {10294#false} is VALID [2022-04-15 12:51:47,681 INFO L272 TraceCheckUtils]: 28: Hoare triple {10294#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10294#false} is VALID [2022-04-15 12:51:47,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {10294#false} ~cond := #in~cond; {10294#false} is VALID [2022-04-15 12:51:47,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {10294#false} assume 0 == ~cond; {10294#false} is VALID [2022-04-15 12:51:47,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {10294#false} assume !false; {10294#false} is VALID [2022-04-15 12:51:47,682 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-15 12:51:47,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:51:48,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {10294#false} assume !false; {10294#false} is VALID [2022-04-15 12:51:48,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {10294#false} assume 0 == ~cond; {10294#false} is VALID [2022-04-15 12:51:48,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {10294#false} ~cond := #in~cond; {10294#false} is VALID [2022-04-15 12:51:48,925 INFO L272 TraceCheckUtils]: 28: Hoare triple {10294#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10294#false} is VALID [2022-04-15 12:51:48,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {10294#false} assume !(~y~0 % 4294967296 > 0); {10294#false} is VALID [2022-04-15 12:51:48,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {10315#(<= 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; {10294#false} is VALID [2022-04-15 12:51:48,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {10314#(<= 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; {10315#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:51:48,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {10313#(<= 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; {10314#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:51:48,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {10312#(<= 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; {10313#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:48,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {10311#(<= 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; {10312#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:48,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {10310#(<= 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; {10311#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:48,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {10309#(<= 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; {10310#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:48,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {10308#(<= 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; {10309#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:51:48,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {10307#(<= 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; {10308#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:51:48,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {10455#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} assume !(~z~0 % 4294967296 > 0); {10307#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 12:51:48,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {10459#(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; {10455#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-15 12:51:48,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {10463#(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; {10459#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:51:48,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {10467#(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; {10463#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-15 12:51:48,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {10471#(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; {10467#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:51:48,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {10475#(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; {10471#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-15 12:51:48,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {10479#(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; {10475#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-15 12:51:48,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {10483#(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; {10479#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:51:48,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {10487#(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; {10483#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-15 12:51:48,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {10293#true} ~z~0 := ~y~0; {10487#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:51:48,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {10293#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[] {10293#true} is VALID [2022-04-15 12:51:48,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {10293#true} [117] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (= v_main_~x~0_In_27 v_main_~x~0_Out_54)) (and (< 0 (mod (+ v_main_~x~0_Out_54 1) 4294967296)) (= (+ v_main_~y~0_Out_50 v_main_~x~0_Out_54) (+ v_main_~x~0_In_27 v_main_~y~0_In_25)) (<= v_main_~x~0_Out_54 v_main_~x~0_In_27) (= |v_main_#t~post5_Out_50| 0) (= |v_main_#t~post6_Out_50| 0))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_25} OutVars{main_~y~0=v_main_~y~0_Out_50, main_#t~post5=|v_main_#t~post5_Out_50|, main_~x~0=v_main_~x~0_Out_54, main_#t~post6=|v_main_#t~post6_Out_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10293#true} is VALID [2022-04-15 12:51:48,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {10293#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10293#true} is VALID [2022-04-15 12:51:48,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {10293#true} call #t~ret11 := main(); {10293#true} is VALID [2022-04-15 12:51:48,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10293#true} {10293#true} #61#return; {10293#true} is VALID [2022-04-15 12:51:48,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {10293#true} assume true; {10293#true} is VALID [2022-04-15 12:51:48,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {10293#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10293#true} is VALID [2022-04-15 12:51:48,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {10293#true} call ULTIMATE.init(); {10293#true} is VALID [2022-04-15 12:51:48,998 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-15 12:51:48,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198944488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:51:48,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:51:48,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 30 [2022-04-15 12:51:56,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:56,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [348653696] [2022-04-15 12:51:56,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [348653696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:56,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:56,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:51:56,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386230345] [2022-04-15 12:51:56,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:56,406 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-15 12:51:56,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:56,406 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-15 12:51:56,744 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-15 12:51:56,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:51:56,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:51:56,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1287, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:51:56,745 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-15 12:52:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:33,735 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-04-15 12:52:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:52:33,735 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-15 12:52:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:33,736 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-15 12:52:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2022-04-15 12:52:33,739 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-15 12:52:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2022-04-15 12:52:33,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 65 transitions. [2022-04-15 12:52:35,232 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-15 12:52:35,233 INFO L225 Difference]: With dead ends: 75 [2022-04-15 12:52:35,233 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:52:35,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=572, Invalid=4830, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 12:52:35,234 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:35,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 108 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-04-15 12:52:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:52:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 12:52:35,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:35,373 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-15 12:52:35,373 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-15 12:52:35,373 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-15 12:52:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:35,374 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:52:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:52:35,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:35,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:35,374 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-15 12:52:35,374 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-15 12:52:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:35,375 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:52:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:52:35,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:35,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:35,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:35,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:35,375 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-15 12:52:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-15 12:52:35,376 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 39 [2022-04-15 12:52:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:35,376 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-15 12:52:35,376 INFO L479 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-15 12:52:35,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-15 12:52:36,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:52:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 12:52:36,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:36,490 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:36,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:52:36,690 WARN L460 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-15 12:52:36,691 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:36,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash -416379154, now seen corresponding path program 24 times [2022-04-15 12:52:36,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:36,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670327756] [2022-04-15 12:52:36,840 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:36,841 INFO L85 PathProgramCache]: Analyzing trace with hash 878643439, now seen corresponding path program 1 times [2022-04-15 12:52:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:36,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120540631] [2022-04-15 12:52:36,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:38,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:38,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {10937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10914#true} is VALID [2022-04-15 12:52:38,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {10914#true} assume true; {10914#true} is VALID [2022-04-15 12:52:38,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10914#true} {10914#true} #61#return; {10914#true} is VALID [2022-04-15 12:52:38,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {10914#true} call ULTIMATE.init(); {10937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:38,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {10937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10914#true} is VALID [2022-04-15 12:52:38,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {10914#true} assume true; {10914#true} is VALID [2022-04-15 12:52:38,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10914#true} {10914#true} #61#return; {10914#true} is VALID [2022-04-15 12:52:38,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {10914#true} call #t~ret11 := main(); {10914#true} is VALID [2022-04-15 12:52:38,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {10914#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10914#true} is VALID [2022-04-15 12:52:38,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {10914#true} [119] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_52| 0) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_56) (+ v_main_~x~0_In_28 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= v_main_~x~0_In_28 v_main_~x~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10914#true} is VALID [2022-04-15 12:52:38,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {10914#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[] {10914#true} is VALID [2022-04-15 12:52:38,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {10914#true} ~z~0 := ~y~0; {10919#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:52:38,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {10919#(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; {10920#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:38,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {10920#(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; {10921#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:38,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {10921#(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; {10922#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:52:38,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {10922#(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; {10923#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:52:38,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {10923#(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; {10924#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:52:38,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {10924#(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; {10925#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:52:38,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {10925#(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; {10926#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:52:38,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {10926#(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; {10927#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 12:52:38,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {10927#(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; {10928#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:38,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {10928#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10928#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:38,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {10928#(<= 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; {10929#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:38,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {10929#(<= 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; {10930#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:52:38,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {10930#(<= 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; {10931#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:52:38,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {10931#(<= 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; {10932#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:52:38,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {10932#(<= 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; {10933#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:38,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {10933#(<= 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; {10934#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:38,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {10934#(<= 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; {10935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:38,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {10935#(<= 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; {10936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:38,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {10936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10915#false} is VALID [2022-04-15 12:52:38,229 INFO L272 TraceCheckUtils]: 28: Hoare triple {10915#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10915#false} is VALID [2022-04-15 12:52:38,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {10915#false} ~cond := #in~cond; {10915#false} is VALID [2022-04-15 12:52:38,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {10915#false} assume 0 == ~cond; {10915#false} is VALID [2022-04-15 12:52:38,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {10915#false} assume !false; {10915#false} is VALID [2022-04-15 12:52:38,229 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-15 12:52:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120540631] [2022-04-15 12:52:38,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120540631] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695183614] [2022-04-15 12:52:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:38,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:38,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:38,230 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:38,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:52:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:38,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 12:52:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:38,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:38,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {10914#true} call ULTIMATE.init(); {10914#true} is VALID [2022-04-15 12:52:38,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {10914#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10914#true} is VALID [2022-04-15 12:52:38,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {10914#true} assume true; {10914#true} is VALID [2022-04-15 12:52:38,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10914#true} {10914#true} #61#return; {10914#true} is VALID [2022-04-15 12:52:38,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {10914#true} call #t~ret11 := main(); {10914#true} is VALID [2022-04-15 12:52:38,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {10914#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10914#true} is VALID [2022-04-15 12:52:38,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {10914#true} [119] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_52| 0) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_56) (+ v_main_~x~0_In_28 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= v_main_~x~0_In_28 v_main_~x~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10914#true} is VALID [2022-04-15 12:52:38,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {10914#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[] {10914#true} is VALID [2022-04-15 12:52:38,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {10914#true} ~z~0 := ~y~0; {10919#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:52:38,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {10919#(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; {10920#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:52:38,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {10920#(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; {10921#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:52:38,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {10921#(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; {10922#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:52:38,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {10922#(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; {10923#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:52:38,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {10923#(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; {10924#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:52:38,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {10924#(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; {10925#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:52:38,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {10925#(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; {10926#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:52:38,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {10926#(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; {10927#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 12:52:38,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {10927#(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; {10928#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:38,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {10928#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10928#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:38,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {10928#(<= 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; {10929#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:38,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {10929#(<= 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; {10930#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:52:38,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {10930#(<= 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; {10931#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:52:38,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {10931#(<= 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; {10932#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:52:38,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {10932#(<= 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; {10933#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:38,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {10933#(<= 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; {10934#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:38,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {10934#(<= 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; {10935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:38,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {10935#(<= 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; {10936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:38,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {10936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10915#false} is VALID [2022-04-15 12:52:38,943 INFO L272 TraceCheckUtils]: 28: Hoare triple {10915#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10915#false} is VALID [2022-04-15 12:52:38,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {10915#false} ~cond := #in~cond; {10915#false} is VALID [2022-04-15 12:52:38,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {10915#false} assume 0 == ~cond; {10915#false} is VALID [2022-04-15 12:52:38,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {10915#false} assume !false; {10915#false} is VALID [2022-04-15 12:52:38,943 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-15 12:52:38,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:40,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {10915#false} assume !false; {10915#false} is VALID [2022-04-15 12:52:40,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {10915#false} assume 0 == ~cond; {10915#false} is VALID [2022-04-15 12:52:40,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {10915#false} ~cond := #in~cond; {10915#false} is VALID [2022-04-15 12:52:40,725 INFO L272 TraceCheckUtils]: 28: Hoare triple {10915#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10915#false} is VALID [2022-04-15 12:52:40,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {10936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10915#false} is VALID [2022-04-15 12:52:40,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {10935#(<= 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; {10936#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:52:40,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {10934#(<= 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; {10935#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:52:40,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {10933#(<= 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; {10934#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:52:40,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {10932#(<= 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; {10933#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:52:40,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {10931#(<= 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; {10932#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:52:40,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {10930#(<= 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; {10931#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:52:40,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {10929#(<= 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; {10930#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:52:40,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {10928#(<= 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; {10929#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:40,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {10928#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10928#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:40,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {11076#(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; {10928#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:52:40,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {11080#(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; {11076#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:52:40,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {11084#(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; {11080#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:40,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {11088#(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; {11084#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:52:40,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {11092#(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; {11088#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:52:40,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {11096#(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; {11092#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:40,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {11100#(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; {11096#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:40,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {11104#(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; {11100#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:40,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {11108#(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; {11104#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 12:52:40,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {10914#true} ~z~0 := ~y~0; {11108#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:52:40,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {10914#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[] {10914#true} is VALID [2022-04-15 12:52:40,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {10914#true} [119] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post6_Out_52| 0) (< 0 (mod (+ v_main_~x~0_Out_56 1) 4294967296)) (<= v_main_~x~0_Out_56 v_main_~x~0_In_28) (= (+ v_main_~y~0_Out_52 v_main_~x~0_Out_56) (+ v_main_~x~0_In_28 v_main_~y~0_In_26)) (= |v_main_#t~post5_Out_52| 0)) (and (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (= v_main_~x~0_In_28 v_main_~x~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_26} OutVars{main_~y~0=v_main_~y~0_Out_52, main_#t~post5=|v_main_#t~post5_Out_52|, main_~x~0=v_main_~x~0_Out_56, main_#t~post6=|v_main_#t~post6_Out_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10914#true} is VALID [2022-04-15 12:52:40,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {10914#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10914#true} is VALID [2022-04-15 12:52:40,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {10914#true} call #t~ret11 := main(); {10914#true} is VALID [2022-04-15 12:52:40,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10914#true} {10914#true} #61#return; {10914#true} is VALID [2022-04-15 12:52:40,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {10914#true} assume true; {10914#true} is VALID [2022-04-15 12:52:40,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {10914#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10914#true} is VALID [2022-04-15 12:52:40,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {10914#true} call ULTIMATE.init(); {10914#true} is VALID [2022-04-15 12:52:40,815 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-15 12:52:40,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695183614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:40,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:40,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 30 [2022-04-15 12:52:54,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:54,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670327756] [2022-04-15 12:52:54,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670327756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:54,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:54,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:52:54,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133969987] [2022-04-15 12:52:54,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:54,199 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-15 12:52:54,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:54,199 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-15 12:52:55,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:55,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:52:55,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:55,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:52:55,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:52:55,166 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-15 12:53:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:54,046 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 12:53:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:53:54,046 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-15 12:53:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:54,046 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-15 12:53:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2022-04-15 12:53:54,047 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-15 12:53:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2022-04-15 12:53:54,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 49 transitions. [2022-04-15 12:53:57,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:57,402 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:53:57,402 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 12:53:57,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=596, Invalid=3826, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:53:57,404 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:57,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 116 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2022-04-15 12:53:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 12:53:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 12:53:57,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:57,560 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-15 12:53:57,560 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-15 12:53:57,560 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-15 12:53:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:57,561 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-15 12:53:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 12:53:57,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:57,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:57,561 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-15 12:53:57,561 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-15 12:53:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:57,562 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-15 12:53:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 12:53:57,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:57,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:57,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:57,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:57,562 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-15 12:53:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-04-15 12:53:57,562 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40 [2022-04-15 12:53:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:57,562 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-04-15 12:53:57,563 INFO L479 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-15 12:53:57,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2022-04-15 12:53:58,828 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-15 12:53:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 12:53:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:53:58,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:58,828 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:58,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 12:53:59,029 WARN L460 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-15 12:53:59,029 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:59,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 25 times [2022-04-15 12:53:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:59,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [357318387] [2022-04-15 12:53:59,166 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:53:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash -807061730, now seen corresponding path program 1 times [2022-04-15 12:53:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:59,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030884879] [2022-04-15 12:53:59,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:59,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {11484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11467#true} is VALID [2022-04-15 12:53:59,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {11467#true} assume true; {11467#true} is VALID [2022-04-15 12:53:59,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11467#true} {11467#true} #61#return; {11467#true} is VALID [2022-04-15 12:53:59,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {11467#true} call ULTIMATE.init(); {11484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:59,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {11484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11467#true} is VALID [2022-04-15 12:53:59,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {11467#true} assume true; {11467#true} is VALID [2022-04-15 12:53:59,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11467#true} {11467#true} #61#return; {11467#true} is VALID [2022-04-15 12:53:59,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {11467#true} call #t~ret11 := main(); {11467#true} is VALID [2022-04-15 12:53:59,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {11467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11467#true} is VALID [2022-04-15 12:53:59,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {11467#true} [121] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_29 v_main_~x~0_Out_58)) (and (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= |v_main_#t~post5_Out_54| 0) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post6_Out_54| 0) (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_27)))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11467#true} is VALID [2022-04-15 12:53:59,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {11467#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[] {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:53:59,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:53:59,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {11472#(<= 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; {11473#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:53:59,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {11473#(<= 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; {11474#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:59,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {11474#(<= 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; {11475#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:59,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {11475#(<= 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; {11476#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:59,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {11476#(<= 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; {11477#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:59,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {11477#(<= 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; {11478#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:59,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {11478#(<= 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; {11479#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:59,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {11479#(<= 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; {11480#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:59,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {11480#(<= 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; {11481#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:53:59,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {11481#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {11481#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:53:59,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {11481#(<= 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; {11480#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:59,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {11480#(<= 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; {11479#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:59,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {11479#(<= 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; {11478#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:53:59,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {11478#(<= 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; {11477#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:53:59,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {11477#(<= 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; {11476#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {11476#(<= 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; {11475#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {11475#(<= 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; {11474#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {11474#(<= 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; {11473#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:54:00,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {11473#(<= 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; {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:00,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:00,018 INFO L272 TraceCheckUtils]: 29: Hoare triple {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11482#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:54:00,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {11482#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11483#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:54:00,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {11483#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11468#false} is VALID [2022-04-15 12:54:00,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {11468#false} assume !false; {11468#false} is VALID [2022-04-15 12:54:00,019 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-15 12:54:00,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:00,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030884879] [2022-04-15 12:54:00,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030884879] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:54:00,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379982684] [2022-04-15 12:54:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:00,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:00,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:00,020 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:54:00,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 12:54:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:00,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 12:54:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:00,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:54:00,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {11467#true} call ULTIMATE.init(); {11467#true} is VALID [2022-04-15 12:54:00,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {11467#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11467#true} is VALID [2022-04-15 12:54:00,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {11467#true} assume true; {11467#true} is VALID [2022-04-15 12:54:00,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11467#true} {11467#true} #61#return; {11467#true} is VALID [2022-04-15 12:54:00,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {11467#true} call #t~ret11 := main(); {11467#true} is VALID [2022-04-15 12:54:00,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {11467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11467#true} is VALID [2022-04-15 12:54:00,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {11467#true} [121] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_29 v_main_~x~0_Out_58)) (and (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= |v_main_#t~post5_Out_54| 0) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post6_Out_54| 0) (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_27)))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11467#true} is VALID [2022-04-15 12:54:00,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {11467#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[] {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:00,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:00,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {11472#(<= 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; {11473#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:54:00,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {11473#(<= 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; {11474#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {11474#(<= 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; {11475#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {11475#(<= 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; {11476#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {11476#(<= 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; {11477#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:54:00,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {11477#(<= 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; {11478#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {11478#(<= 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; {11479#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {11479#(<= 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; {11480#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {11480#(<= 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; {11481#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:54:00,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {11481#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {11481#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:54:00,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {11481#(<= 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; {11480#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {11480#(<= 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; {11479#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {11479#(<= 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; {11478#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {11478#(<= 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; {11477#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:54:00,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {11477#(<= 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; {11476#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {11476#(<= 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; {11475#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {11475#(<= 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; {11474#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:00,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {11474#(<= 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; {11473#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:54:00,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {11473#(<= 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; {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:00,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:00,600 INFO L272 TraceCheckUtils]: 29: Hoare triple {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:54:00,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {11575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:54:00,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {11579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11468#false} is VALID [2022-04-15 12:54:00,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {11468#false} assume !false; {11468#false} is VALID [2022-04-15 12:54:00,601 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-15 12:54:00,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:54:01,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {11468#false} assume !false; {11468#false} is VALID [2022-04-15 12:54:01,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {11579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11468#false} is VALID [2022-04-15 12:54:01,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {11575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:54:01,012 INFO L272 TraceCheckUtils]: 29: Hoare triple {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:54:01,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:01,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {11473#(<= 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; {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:01,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {11474#(<= 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; {11473#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:54:01,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {11475#(<= 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; {11474#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {11476#(<= 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; {11475#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {11477#(<= 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; {11476#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {11478#(<= 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; {11477#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:54:01,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {11479#(<= 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; {11478#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {11480#(<= 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; {11479#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {11481#(<= 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; {11480#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {11481#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {11481#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:54:01,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {11480#(<= 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; {11481#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:54:01,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {11479#(<= 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; {11480#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {11478#(<= 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; {11479#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {11477#(<= 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; {11478#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {11476#(<= 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; {11477#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:54:01,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {11475#(<= 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; {11476#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {11474#(<= 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; {11475#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {11473#(<= 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; {11474#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:01,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {11472#(<= 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; {11473#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:54:01,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:01,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {11467#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[] {11472#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:54:01,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {11467#true} [121] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (= v_main_~x~0_In_29 v_main_~x~0_Out_58)) (and (< 0 (mod (+ v_main_~x~0_Out_58 1) 4294967296)) (= |v_main_#t~post5_Out_54| 0) (<= v_main_~x~0_Out_58 v_main_~x~0_In_29) (= |v_main_#t~post6_Out_54| 0) (= (+ v_main_~y~0_Out_54 v_main_~x~0_Out_58) (+ v_main_~x~0_In_29 v_main_~y~0_In_27)))) InVars {main_~x~0=v_main_~x~0_In_29, main_~y~0=v_main_~y~0_In_27} OutVars{main_~y~0=v_main_~y~0_Out_54, main_#t~post5=|v_main_#t~post5_Out_54|, main_~x~0=v_main_~x~0_Out_58, main_#t~post6=|v_main_#t~post6_Out_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11467#true} is VALID [2022-04-15 12:54:01,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {11467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11467#true} is VALID [2022-04-15 12:54:01,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {11467#true} call #t~ret11 := main(); {11467#true} is VALID [2022-04-15 12:54:01,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11467#true} {11467#true} #61#return; {11467#true} is VALID [2022-04-15 12:54:01,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {11467#true} assume true; {11467#true} is VALID [2022-04-15 12:54:01,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {11467#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11467#true} is VALID [2022-04-15 12:54:01,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {11467#true} call ULTIMATE.init(); {11467#true} is VALID [2022-04-15 12:54:01,144 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-15 12:54:01,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379982684] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:54:01,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:54:01,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2022-04-15 12:54:10,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:10,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [357318387] [2022-04-15 12:54:10,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [357318387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:10,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:10,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:54:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238400694] [2022-04-15 12:54:10,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:10,406 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-15 12:54:10,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:10,406 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-15 12:54:10,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:10,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:54:10,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:10,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:54:10,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:54:10,686 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-15 12:54:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:37,823 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-04-15 12:54:37,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:54:37,823 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-15 12:54:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:54:37,823 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-15 12:54:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2022-04-15 12:54:37,824 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-15 12:54:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2022-04-15 12:54:37,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 79 transitions. [2022-04-15 12:54:38,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:38,766 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:54:38,767 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:54:38,767 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=515, Invalid=1647, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:54:38,767 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:54:38,768 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 30 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-04-15 12:54:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:54:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 44. [2022-04-15 12:54:38,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:54:38,950 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-15 12:54:38,950 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-15 12:54:38,950 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-15 12:54:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:38,958 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-15 12:54:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-15 12:54:38,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:38,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:38,958 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-15 12:54:38,959 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-15 12:54:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:54:38,959 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-15 12:54:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-15 12:54:38,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:54:38,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:54:38,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:54:38,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:54:38,960 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-15 12:54:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-15 12:54:38,960 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2022-04-15 12:54:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:54:38,960 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-15 12:54:38,960 INFO L479 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-15 12:54:38,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 47 transitions. [2022-04-15 12:54:41,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 12:54:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:54:41,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:54:41,203 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:54:41,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 12:54:41,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-15 12:54:41,404 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:54:41,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:54:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash 395434254, now seen corresponding path program 26 times [2022-04-15 12:54:41,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:41,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [454893806] [2022-04-15 12:54:41,547 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:54:41,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2095827121, now seen corresponding path program 1 times [2022-04-15 12:54:41,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:54:41,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142299113] [2022-04-15 12:54:41,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:41,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:54:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:43,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:54:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:43,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {12142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12117#true} is VALID [2022-04-15 12:54:43,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {12117#true} assume true; {12117#true} is VALID [2022-04-15 12:54:43,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12117#true} {12117#true} #61#return; {12117#true} is VALID [2022-04-15 12:54:43,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {12117#true} call ULTIMATE.init(); {12142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:54:43,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {12142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12117#true} is VALID [2022-04-15 12:54:43,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {12117#true} assume true; {12117#true} is VALID [2022-04-15 12:54:43,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12117#true} {12117#true} #61#return; {12117#true} is VALID [2022-04-15 12:54:43,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {12117#true} call #t~ret11 := main(); {12117#true} is VALID [2022-04-15 12:54:43,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {12117#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12117#true} is VALID [2022-04-15 12:54:43,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {12117#true} [123] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= (+ v_main_~x~0_In_30 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_60)) (= |v_main_#t~post6_Out_56| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30)) (and (= v_main_~x~0_In_30 v_main_~x~0_Out_60) (= v_main_~y~0_In_28 v_main_~y~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12117#true} is VALID [2022-04-15 12:54:43,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {12117#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[] {12117#true} is VALID [2022-04-15 12:54:43,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {12117#true} ~z~0 := ~y~0; {12122#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:54:43,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {12122#(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; {12123#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:54:43,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {12123#(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; {12124#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:54:43,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {12124#(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; {12125#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:54:43,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {12125#(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; {12126#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:54:43,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {12126#(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; {12127#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:54:43,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {12127#(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; {12128#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:54:43,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {12128#(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; {12129#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:54:43,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {12129#(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; {12130#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 12:54:43,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {12130#(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; {12131#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 12:54:43,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {12131#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !(~z~0 % 4294967296 > 0); {12132#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {12132#(<= 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; {12133#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 12:54:43,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {12133#(<= 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; {12134#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {12134#(<= 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; {12135#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:54:43,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {12135#(<= 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; {12136#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {12136#(<= 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; {12137#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {12137#(<= 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; {12138#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {12138#(<= 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; {12139#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {12139#(<= 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; {12140#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:54:43,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {12140#(<= 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; {12141#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:54:43,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {12141#(<= 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; {12118#false} is VALID [2022-04-15 12:54:43,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {12118#false} assume !(~y~0 % 4294967296 > 0); {12118#false} is VALID [2022-04-15 12:54:43,159 INFO L272 TraceCheckUtils]: 30: Hoare triple {12118#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12118#false} is VALID [2022-04-15 12:54:43,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {12118#false} ~cond := #in~cond; {12118#false} is VALID [2022-04-15 12:54:43,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {12118#false} assume 0 == ~cond; {12118#false} is VALID [2022-04-15 12:54:43,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {12118#false} assume !false; {12118#false} is VALID [2022-04-15 12:54:43,159 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-15 12:54:43,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:54:43,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142299113] [2022-04-15 12:54:43,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142299113] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:54:43,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167234461] [2022-04-15 12:54:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:54:43,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:54:43,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:54:43,161 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:54:43,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 12:54:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:43,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 12:54:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:54:43,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:54:43,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {12117#true} call ULTIMATE.init(); {12117#true} is VALID [2022-04-15 12:54:43,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {12117#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12117#true} is VALID [2022-04-15 12:54:43,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {12117#true} assume true; {12117#true} is VALID [2022-04-15 12:54:43,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12117#true} {12117#true} #61#return; {12117#true} is VALID [2022-04-15 12:54:43,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {12117#true} call #t~ret11 := main(); {12117#true} is VALID [2022-04-15 12:54:43,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {12117#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12117#true} is VALID [2022-04-15 12:54:43,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {12117#true} [123] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= (+ v_main_~x~0_In_30 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_60)) (= |v_main_#t~post6_Out_56| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30)) (and (= v_main_~x~0_In_30 v_main_~x~0_Out_60) (= v_main_~y~0_In_28 v_main_~y~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12117#true} is VALID [2022-04-15 12:54:43,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {12117#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[] {12117#true} is VALID [2022-04-15 12:54:43,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {12117#true} ~z~0 := ~y~0; {12122#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:54:43,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {12122#(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; {12123#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:54:43,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {12123#(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; {12124#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:54:43,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {12124#(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; {12125#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:54:43,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {12125#(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; {12126#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:54:43,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {12126#(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; {12127#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:54:43,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {12127#(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; {12128#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:54:43,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {12128#(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; {12129#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:54:43,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {12129#(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; {12130#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 12:54:43,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {12130#(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; {12131#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 12:54:43,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {12131#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !(~z~0 % 4294967296 > 0); {12132#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {12132#(<= 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; {12133#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 12:54:43,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {12133#(<= 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; {12134#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {12134#(<= 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; {12135#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:54:43,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {12135#(<= 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; {12136#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {12136#(<= 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; {12137#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {12137#(<= 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; {12138#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {12138#(<= 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; {12139#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:43,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {12139#(<= 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; {12140#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:54:43,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {12140#(<= 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; {12141#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:54:43,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {12141#(<= 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; {12118#false} is VALID [2022-04-15 12:54:43,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {12118#false} assume !(~y~0 % 4294967296 > 0); {12118#false} is VALID [2022-04-15 12:54:43,791 INFO L272 TraceCheckUtils]: 30: Hoare triple {12118#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12118#false} is VALID [2022-04-15 12:54:43,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {12118#false} ~cond := #in~cond; {12118#false} is VALID [2022-04-15 12:54:43,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {12118#false} assume 0 == ~cond; {12118#false} is VALID [2022-04-15 12:54:43,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {12118#false} assume !false; {12118#false} is VALID [2022-04-15 12:54:43,791 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-15 12:54:43,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:54:46,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {12118#false} assume !false; {12118#false} is VALID [2022-04-15 12:54:46,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {12118#false} assume 0 == ~cond; {12118#false} is VALID [2022-04-15 12:54:46,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {12118#false} ~cond := #in~cond; {12118#false} is VALID [2022-04-15 12:54:46,118 INFO L272 TraceCheckUtils]: 30: Hoare triple {12118#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12118#false} is VALID [2022-04-15 12:54:46,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {12118#false} assume !(~y~0 % 4294967296 > 0); {12118#false} is VALID [2022-04-15 12:54:46,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {12141#(<= 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; {12118#false} is VALID [2022-04-15 12:54:46,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {12140#(<= 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; {12141#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:54:46,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {12139#(<= 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; {12140#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:54:46,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {12138#(<= 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; {12139#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:46,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {12137#(<= 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; {12138#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:46,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {12136#(<= 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; {12137#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:46,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {12135#(<= 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; {12136#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:46,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {12134#(<= 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; {12135#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:54:46,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {12133#(<= 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; {12134#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:46,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {12132#(<= 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; {12133#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 12:54:46,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {12290#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {12132#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:54:46,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {12294#(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; {12290#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:46,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {12298#(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; {12294#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 12:54:46,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {12302#(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; {12298#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:46,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {12306#(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; {12302#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 12:54:46,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {12310#(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; {12306#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:46,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {12314#(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; {12310#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 12:54:46,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {12318#(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; {12314#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:54:46,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {12322#(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; {12318#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-15 12:54:46,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {12326#(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; {12322#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-15 12:54:46,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {12117#true} ~z~0 := ~y~0; {12326#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-15 12:54:46,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {12117#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[] {12117#true} is VALID [2022-04-15 12:54:46,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {12117#true} [123] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post5_Out_56| 0) (< 0 (mod (+ v_main_~x~0_Out_60 1) 4294967296)) (= (+ v_main_~x~0_In_30 v_main_~y~0_In_28) (+ v_main_~y~0_Out_56 v_main_~x~0_Out_60)) (= |v_main_#t~post6_Out_56| 0) (<= v_main_~x~0_Out_60 v_main_~x~0_In_30)) (and (= v_main_~x~0_In_30 v_main_~x~0_Out_60) (= v_main_~y~0_In_28 v_main_~y~0_Out_56))) InVars {main_~x~0=v_main_~x~0_In_30, main_~y~0=v_main_~y~0_In_28} OutVars{main_~y~0=v_main_~y~0_Out_56, main_#t~post5=|v_main_#t~post5_Out_56|, main_~x~0=v_main_~x~0_Out_60, main_#t~post6=|v_main_#t~post6_Out_56|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12117#true} is VALID [2022-04-15 12:54:46,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {12117#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12117#true} is VALID [2022-04-15 12:54:46,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {12117#true} call #t~ret11 := main(); {12117#true} is VALID [2022-04-15 12:54:46,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12117#true} {12117#true} #61#return; {12117#true} is VALID [2022-04-15 12:54:46,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {12117#true} assume true; {12117#true} is VALID [2022-04-15 12:54:46,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {12117#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12117#true} is VALID [2022-04-15 12:54:46,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {12117#true} call ULTIMATE.init(); {12117#true} is VALID [2022-04-15 12:54:46,252 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-15 12:54:46,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167234461] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:54:46,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:54:46,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 33 [2022-04-15 12:55:02,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:55:02,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [454893806] [2022-04-15 12:55:02,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [454893806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:02,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:02,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:55:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926018742] [2022-04-15 12:55:02,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:55:02,537 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-15 12:55:02,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:55:02,537 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-15 12:55:03,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:03,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:55:03,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:03,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:55:03,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:55:03,020 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-15 12:55:31,426 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 12:56:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:16,012 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-04-15 12:56:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 12:56:16,012 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-15 12:56:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:56:16,012 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-15 12:56:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2022-04-15 12:56:16,013 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-15 12:56:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2022-04-15 12:56:16,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 69 transitions. [2022-04-15 12:56:17,201 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-15 12:56:17,201 INFO L225 Difference]: With dead ends: 81 [2022-04-15 12:56:17,202 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:56:17,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 54.4s TimeCoverageRelationStatistics Valid=675, Invalid=5967, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:56:17,203 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:56:17,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 128 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2022-04-15 12:56:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:56:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 12:56:17,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:56:17,375 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-15 12:56:17,375 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-15 12:56:17,375 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-15 12:56:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:17,376 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 12:56:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 12:56:17,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:17,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:17,376 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-15 12:56:17,376 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-15 12:56:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:56:17,377 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 12:56:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 12:56:17,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:56:17,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:56:17,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:56:17,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:56:17,377 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-15 12:56:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-15 12:56:17,377 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42 [2022-04-15 12:56:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:56:17,377 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-15 12:56:17,378 INFO L479 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-15 12:56:17,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-15 12:56:20,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 12:56:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:56:20,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:56:20,088 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:56:20,105 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-15 12:56:20,297 WARN L460 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-15 12:56:20,297 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:56:20,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:56:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1246089376, now seen corresponding path program 27 times [2022-04-15 12:56:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:20,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1920288863] [2022-04-15 12:56:20,451 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:56:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash 173522432, now seen corresponding path program 1 times [2022-04-15 12:56:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:56:20,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113070534] [2022-04-15 12:56:20,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:20,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:56:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:21,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:56:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:21,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {12811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12786#true} is VALID [2022-04-15 12:56:21,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {12786#true} assume true; {12786#true} is VALID [2022-04-15 12:56:21,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12786#true} {12786#true} #61#return; {12786#true} is VALID [2022-04-15 12:56:21,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {12786#true} call ULTIMATE.init(); {12811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:56:21,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {12811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12786#true} is VALID [2022-04-15 12:56:21,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {12786#true} assume true; {12786#true} is VALID [2022-04-15 12:56:21,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12786#true} {12786#true} #61#return; {12786#true} is VALID [2022-04-15 12:56:21,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {12786#true} call #t~ret11 := main(); {12786#true} is VALID [2022-04-15 12:56:21,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {12786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12786#true} is VALID [2022-04-15 12:56:21,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {12786#true} [125] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_31 v_main_~x~0_Out_62) (= v_main_~y~0_In_29 v_main_~y~0_Out_58)) (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= |v_main_#t~post5_Out_58| 0) (= |v_main_#t~post6_Out_58| 0))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12786#true} is VALID [2022-04-15 12:56:21,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {12786#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[] {12786#true} is VALID [2022-04-15 12:56:21,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {12786#true} ~z~0 := ~y~0; {12791#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:21,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {12791#(= 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; {12792#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:21,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {12792#(= (+ (- 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; {12793#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:21,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {12793#(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; {12794#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:21,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {12794#(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; {12795#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:56:21,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {12795#(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; {12796#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:56:21,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {12796#(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; {12797#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:56:21,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {12797#(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; {12798#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:56:21,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {12798#(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; {12799#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 12:56:21,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {12799#(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; {12800#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 12:56:21,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {12800#(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; {12801#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 12:56:21,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {12801#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !(~z~0 % 4294967296 > 0); {12801#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 12:56:21,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {12801#(<= 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; {12802#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:21,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {12802#(<= 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; {12803#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:21,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {12803#(<= 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; {12804#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:56:21,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {12804#(<= 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; {12805#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:56:21,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {12805#(<= 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; {12806#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:21,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {12806#(<= 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; {12807#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:21,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {12807#(<= 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; {12808#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:56:22,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {12808#(<= 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; {12809#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:22,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {12809#(<= 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; {12810#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:56:22,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {12810#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {12787#false} is VALID [2022-04-15 12:56:22,018 INFO L272 TraceCheckUtils]: 30: Hoare triple {12787#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12787#false} is VALID [2022-04-15 12:56:22,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {12787#false} ~cond := #in~cond; {12787#false} is VALID [2022-04-15 12:56:22,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {12787#false} assume 0 == ~cond; {12787#false} is VALID [2022-04-15 12:56:22,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {12787#false} assume !false; {12787#false} is VALID [2022-04-15 12:56:22,019 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-15 12:56:22,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:56:22,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113070534] [2022-04-15 12:56:22,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113070534] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:56:22,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272424941] [2022-04-15 12:56:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:56:22,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:56:22,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:56:22,020 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:56:22,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 12:56:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:22,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 12:56:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:56:22,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:56:22,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {12786#true} call ULTIMATE.init(); {12786#true} is VALID [2022-04-15 12:56:22,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {12786#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12786#true} is VALID [2022-04-15 12:56:22,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {12786#true} assume true; {12786#true} is VALID [2022-04-15 12:56:22,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12786#true} {12786#true} #61#return; {12786#true} is VALID [2022-04-15 12:56:22,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {12786#true} call #t~ret11 := main(); {12786#true} is VALID [2022-04-15 12:56:22,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {12786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12786#true} is VALID [2022-04-15 12:56:22,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {12786#true} [125] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_31 v_main_~x~0_Out_62) (= v_main_~y~0_In_29 v_main_~y~0_Out_58)) (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= |v_main_#t~post5_Out_58| 0) (= |v_main_#t~post6_Out_58| 0))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12786#true} is VALID [2022-04-15 12:56:22,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {12786#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[] {12786#true} is VALID [2022-04-15 12:56:22,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {12786#true} ~z~0 := ~y~0; {12791#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 12:56:22,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {12791#(= 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; {12792#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 12:56:22,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {12792#(= (+ (- 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; {12793#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:56:22,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {12793#(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; {12794#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:56:22,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {12794#(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; {12795#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:56:22,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {12795#(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; {12796#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:56:22,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {12796#(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; {12797#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:56:22,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {12797#(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; {12798#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:56:22,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {12798#(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; {12799#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 12:56:22,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {12799#(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; {12800#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 12:56:22,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {12800#(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; {12801#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 12:56:22,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {12801#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !(~z~0 % 4294967296 > 0); {12801#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 12:56:22,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {12801#(<= 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; {12802#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:22,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {12802#(<= 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; {12803#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:22,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {12803#(<= 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; {12804#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:56:22,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {12804#(<= 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; {12805#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:56:22,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {12805#(<= 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; {12806#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:22,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {12806#(<= 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; {12807#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:22,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {12807#(<= 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; {12808#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:56:22,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {12808#(<= 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; {12809#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:22,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {12809#(<= 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; {12810#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:56:22,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {12810#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {12787#false} is VALID [2022-04-15 12:56:22,884 INFO L272 TraceCheckUtils]: 30: Hoare triple {12787#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12787#false} is VALID [2022-04-15 12:56:22,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {12787#false} ~cond := #in~cond; {12787#false} is VALID [2022-04-15 12:56:22,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {12787#false} assume 0 == ~cond; {12787#false} is VALID [2022-04-15 12:56:22,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {12787#false} assume !false; {12787#false} is VALID [2022-04-15 12:56:22,885 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-15 12:56:22,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:25,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {12787#false} assume !false; {12787#false} is VALID [2022-04-15 12:56:25,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {12787#false} assume 0 == ~cond; {12787#false} is VALID [2022-04-15 12:56:25,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {12787#false} ~cond := #in~cond; {12787#false} is VALID [2022-04-15 12:56:25,420 INFO L272 TraceCheckUtils]: 30: Hoare triple {12787#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12787#false} is VALID [2022-04-15 12:56:25,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {12810#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {12787#false} is VALID [2022-04-15 12:56:25,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {12809#(<= 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; {12810#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 12:56:25,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {12808#(<= 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; {12809#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 12:56:25,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {12807#(<= 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; {12808#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 12:56:25,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {12806#(<= 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; {12807#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 12:56:25,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {12805#(<= 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; {12806#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 12:56:25,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {12804#(<= 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; {12805#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:56:25,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {12803#(<= 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; {12804#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 12:56:25,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {12802#(<= 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; {12803#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:25,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {12801#(<= 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; {12802#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:56:25,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {12801#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !(~z~0 % 4294967296 > 0); {12801#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 12:56:25,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {12959#(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; {12801#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 12:56:25,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {12963#(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; {12959#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 12:56:25,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {12967#(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; {12963#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} is VALID [2022-04-15 12:56:25,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {12971#(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; {12967#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 12:56:25,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {12975#(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; {12971#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} is VALID [2022-04-15 12:56:25,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {12979#(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; {12975#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:25,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {12983#(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; {12979#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:25,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {12987#(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; {12983#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:25,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {12991#(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; {12987#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 12:56:25,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {12995#(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; {12991#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-15 12:56:25,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {12786#true} ~z~0 := ~y~0; {12995#(or (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} is VALID [2022-04-15 12:56:25,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {12786#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[] {12786#true} is VALID [2022-04-15 12:56:25,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {12786#true} [125] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_31 v_main_~x~0_Out_62) (= v_main_~y~0_In_29 v_main_~y~0_Out_58)) (and (= (+ v_main_~y~0_Out_58 v_main_~x~0_Out_62) (+ v_main_~x~0_In_31 v_main_~y~0_In_29)) (< 0 (mod (+ v_main_~x~0_Out_62 1) 4294967296)) (<= v_main_~x~0_Out_62 v_main_~x~0_In_31) (= |v_main_#t~post5_Out_58| 0) (= |v_main_#t~post6_Out_58| 0))) InVars {main_~x~0=v_main_~x~0_In_31, main_~y~0=v_main_~y~0_In_29} OutVars{main_~y~0=v_main_~y~0_Out_58, main_#t~post5=|v_main_#t~post5_Out_58|, main_~x~0=v_main_~x~0_Out_62, main_#t~post6=|v_main_#t~post6_Out_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12786#true} is VALID [2022-04-15 12:56:25,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {12786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12786#true} is VALID [2022-04-15 12:56:25,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {12786#true} call #t~ret11 := main(); {12786#true} is VALID [2022-04-15 12:56:25,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12786#true} {12786#true} #61#return; {12786#true} is VALID [2022-04-15 12:56:25,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {12786#true} assume true; {12786#true} is VALID [2022-04-15 12:56:25,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {12786#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12786#true} is VALID [2022-04-15 12:56:25,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {12786#true} call ULTIMATE.init(); {12786#true} is VALID [2022-04-15 12:56:25,566 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-15 12:56:25,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272424941] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:25,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:25,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 33 [2022-04-15 12:56:49,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:49,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1920288863] [2022-04-15 12:56:49,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1920288863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:49,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:49,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:56:49,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393907951] [2022-04-15 12:56:49,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:49,554 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-15 12:56:49,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:49,554 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-15 12:56:50,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:50,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:56:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:56:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1658, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:56:50,075 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-15 12:58:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:35,616 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-15 12:58:35,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:58:35,616 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-15 12:58:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:35,617 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-15 12:58:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2022-04-15 12:58:35,617 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-15 12:58:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2022-04-15 12:58:35,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 52 transitions. [2022-04-15 12:58:37,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:37,628 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:58:37,628 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:58:37,628 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 72.3s TimeCoverageRelationStatistics Valid=711, Invalid=4691, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 12:58:37,629 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:37,629 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 126 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 25.1s Time] [2022-04-15 12:58:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:58:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 12:58:37,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:37,817 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-15 12:58:37,817 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-15 12:58:37,818 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-15 12:58:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:37,818 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 12:58:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:58:37,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:37,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:37,818 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-15 12:58:37,818 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-15 12:58:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:37,819 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 12:58:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:58:37,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:37,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:37,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:37,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:37,819 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-15 12:58:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-15 12:58:37,820 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 43 [2022-04-15 12:58:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:37,820 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-15 12:58:37,820 INFO L479 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-15 12:58:37,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-15 12:58:40,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:40,563 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:58:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 12:58:40,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:40,563 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:40,579 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-15 12:58:40,763 WARN L460 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-15 12:58:40,764 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 28 times [2022-04-15 12:58:40,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:40,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2111215878] [2022-04-15 12:58:40,919 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1995453485, now seen corresponding path program 1 times [2022-04-15 12:58:40,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:40,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015792527] [2022-04-15 12:58:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:40,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:42,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {13397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13379#true} is VALID [2022-04-15 12:58:42,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {13379#true} assume true; {13379#true} is VALID [2022-04-15 12:58:42,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13379#true} {13379#true} #61#return; {13379#true} is VALID [2022-04-15 12:58:42,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {13379#true} call ULTIMATE.init(); {13397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:42,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {13397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13379#true} is VALID [2022-04-15 12:58:42,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {13379#true} assume true; {13379#true} is VALID [2022-04-15 12:58:42,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13379#true} {13379#true} #61#return; {13379#true} is VALID [2022-04-15 12:58:42,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {13379#true} call #t~ret11 := main(); {13379#true} is VALID [2022-04-15 12:58:42,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {13379#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13379#true} is VALID [2022-04-15 12:58:42,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {13379#true} [127] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_32 v_main_~x~0_Out_64)) (and (= (+ v_main_~x~0_In_32 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_64)) (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= |v_main_#t~post5_Out_60| 0) (= |v_main_#t~post6_Out_60| 0))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13379#true} is VALID [2022-04-15 12:58:42,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {13379#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[] {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:42,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:42,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {13384#(<= 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; {13385#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:58:42,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {13385#(<= 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; {13386#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {13386#(<= 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; {13387#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {13387#(<= 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; {13388#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {13388#(<= 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; {13389#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:58:42,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {13389#(<= 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; {13390#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {13390#(<= 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; {13391#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {13391#(<= 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; {13392#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {13392#(<= 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; {13393#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:58:42,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {13393#(<= 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; {13394#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 12:58:42,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {13394#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {13394#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 12:58:42,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {13394#(<= 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; {13393#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:58:42,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {13393#(<= 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; {13392#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {13392#(<= 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; {13391#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {13391#(<= 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; {13390#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {13390#(<= 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; {13389#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:58:42,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {13389#(<= 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; {13388#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {13388#(<= 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; {13387#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {13387#(<= 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; {13386#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:42,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {13386#(<= 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; {13385#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:58:42,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {13385#(<= 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; {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:42,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:42,541 INFO L272 TraceCheckUtils]: 31: Hoare triple {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13395#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:58:42,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {13395#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13396#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:58:42,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {13396#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13380#false} is VALID [2022-04-15 12:58:42,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {13380#false} assume !false; {13380#false} is VALID [2022-04-15 12:58:42,542 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-15 12:58:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:42,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015792527] [2022-04-15 12:58:42,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015792527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:58:42,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558600784] [2022-04-15 12:58:42,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:42,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:58:42,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:58:42,543 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:58:42,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 12:58:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:42,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 12:58:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:42,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:58:43,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {13379#true} call ULTIMATE.init(); {13379#true} is VALID [2022-04-15 12:58:43,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {13379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13379#true} is VALID [2022-04-15 12:58:43,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {13379#true} assume true; {13379#true} is VALID [2022-04-15 12:58:43,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13379#true} {13379#true} #61#return; {13379#true} is VALID [2022-04-15 12:58:43,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {13379#true} call #t~ret11 := main(); {13379#true} is VALID [2022-04-15 12:58:43,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {13379#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13379#true} is VALID [2022-04-15 12:58:43,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {13379#true} [127] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_32 v_main_~x~0_Out_64)) (and (= (+ v_main_~x~0_In_32 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_64)) (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= |v_main_#t~post5_Out_60| 0) (= |v_main_#t~post6_Out_60| 0))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13379#true} is VALID [2022-04-15 12:58:43,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {13379#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[] {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:43,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:43,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {13384#(<= 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; {13385#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:58:43,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {13385#(<= 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; {13386#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {13386#(<= 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; {13387#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {13387#(<= 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; {13388#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {13388#(<= 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; {13389#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:58:43,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {13389#(<= 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; {13390#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {13390#(<= 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; {13391#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {13391#(<= 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; {13392#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {13392#(<= 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; {13393#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:58:43,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {13393#(<= 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; {13394#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 12:58:43,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {13394#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {13394#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 12:58:43,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {13394#(<= 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; {13393#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:58:43,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {13393#(<= 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; {13392#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {13392#(<= 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; {13391#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {13391#(<= 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; {13390#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {13390#(<= 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; {13389#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:58:43,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {13389#(<= 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; {13388#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {13388#(<= 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; {13387#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {13387#(<= 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; {13386#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {13386#(<= 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; {13385#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:58:43,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {13385#(<= 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; {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:43,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:43,355 INFO L272 TraceCheckUtils]: 31: Hoare triple {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:58:43,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {13494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:58:43,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {13498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13380#false} is VALID [2022-04-15 12:58:43,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {13380#false} assume !false; {13380#false} is VALID [2022-04-15 12:58:43,356 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-15 12:58:43,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:58:43,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {13380#false} assume !false; {13380#false} is VALID [2022-04-15 12:58:43,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {13498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13380#false} is VALID [2022-04-15 12:58:43,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {13494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:58:43,899 INFO L272 TraceCheckUtils]: 31: Hoare triple {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:58:43,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:43,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {13385#(<= 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; {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:43,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {13386#(<= 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; {13385#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:58:43,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {13387#(<= 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; {13386#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {13388#(<= 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; {13387#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {13389#(<= 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; {13388#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {13390#(<= 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; {13389#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:58:43,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {13391#(<= 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; {13390#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {13392#(<= 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; {13391#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {13393#(<= 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; {13392#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:43,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {13394#(<= 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; {13393#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:58:43,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {13394#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {13394#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 12:58:44,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {13393#(<= 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; {13394#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 12:58:44,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {13392#(<= 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; {13393#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 12:58:44,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {13391#(<= 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; {13392#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:44,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {13390#(<= 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; {13391#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:44,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {13389#(<= 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; {13390#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:44,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {13388#(<= 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; {13389#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 12:58:44,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {13387#(<= 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; {13388#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:44,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {13386#(<= 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; {13387#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:44,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {13385#(<= 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; {13386#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:58:44,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {13384#(<= 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; {13385#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 12:58:44,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:44,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {13379#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[] {13384#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 12:58:44,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {13379#true} [127] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_In_30 v_main_~y~0_Out_60) (= v_main_~x~0_In_32 v_main_~x~0_Out_64)) (and (= (+ v_main_~x~0_In_32 v_main_~y~0_In_30) (+ v_main_~y~0_Out_60 v_main_~x~0_Out_64)) (< 0 (mod (+ v_main_~x~0_Out_64 1) 4294967296)) (<= v_main_~x~0_Out_64 v_main_~x~0_In_32) (= |v_main_#t~post5_Out_60| 0) (= |v_main_#t~post6_Out_60| 0))) InVars {main_~x~0=v_main_~x~0_In_32, main_~y~0=v_main_~y~0_In_30} OutVars{main_~y~0=v_main_~y~0_Out_60, main_#t~post5=|v_main_#t~post5_Out_60|, main_~x~0=v_main_~x~0_Out_64, main_#t~post6=|v_main_#t~post6_Out_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13379#true} is VALID [2022-04-15 12:58:44,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {13379#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13379#true} is VALID [2022-04-15 12:58:44,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {13379#true} call #t~ret11 := main(); {13379#true} is VALID [2022-04-15 12:58:44,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13379#true} {13379#true} #61#return; {13379#true} is VALID [2022-04-15 12:58:44,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {13379#true} assume true; {13379#true} is VALID [2022-04-15 12:58:44,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {13379#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13379#true} is VALID [2022-04-15 12:58:44,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {13379#true} call ULTIMATE.init(); {13379#true} is VALID [2022-04-15 12:58:44,091 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-15 12:58:44,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558600784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:58:44,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:58:44,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2022-04-15 12:59:01,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:59:01,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2111215878] [2022-04-15 12:59:01,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2111215878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:59:01,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:59:01,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:59:01,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216382170] [2022-04-15 12:59:01,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:59:01,944 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-15 12:59:01,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:59:01,945 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-15 12:59:02,672 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-15 12:59:02,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:59:02,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:02,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:59:02,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:59:02,673 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-15 12:59:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:45,889 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-04-15 12:59:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:59:45,889 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-15 12:59:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:45,889 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-15 12:59:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 85 transitions. [2022-04-15 12:59:45,890 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-15 12:59:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 85 transitions. [2022-04-15 12:59:45,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 85 transitions. [2022-04-15 12:59:48,304 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-15 12:59:48,305 INFO L225 Difference]: With dead ends: 82 [2022-04-15 12:59:48,305 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 12:59:48,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=614, Invalid=1936, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:59:48,306 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 59 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:48,306 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 40 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2022-04-15 12:59:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 12:59:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2022-04-15 12:59:48,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:48,514 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-15 12:59:48,514 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-15 12:59:48,514 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-15 12:59:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:48,515 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-15 12:59:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-15 12:59:48,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:48,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:48,515 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-15 12:59:48,515 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-15 12:59:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:48,516 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-15 12:59:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-15 12:59:48,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:48,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:48,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:48,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:48,516 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-15 12:59:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 12:59:48,517 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2022-04-15 12:59:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:48,517 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 12:59:48,517 INFO L479 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-15 12:59:48,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 12:59:54,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 12:59:54,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:59:54,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:54,169 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:59:54,185 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-15 12:59:54,370 WARN L460 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-15 12:59:54,370 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:54,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1907827968, now seen corresponding path program 29 times [2022-04-15 12:59:54,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:54,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1034398193] [2022-04-15 12:59:54,514 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:59:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1122120672, now seen corresponding path program 1 times [2022-04-15 12:59:54,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:54,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178100231] [2022-04-15 12:59:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:57,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:57,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {14104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14077#true} is VALID [2022-04-15 12:59:57,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {14077#true} assume true; {14077#true} is VALID [2022-04-15 12:59:57,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14077#true} {14077#true} #61#return; {14077#true} is VALID [2022-04-15 12:59:57,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {14077#true} call ULTIMATE.init(); {14104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:57,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {14104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14077#true} is VALID [2022-04-15 12:59:57,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {14077#true} assume true; {14077#true} is VALID [2022-04-15 12:59:57,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14077#true} {14077#true} #61#return; {14077#true} is VALID [2022-04-15 12:59:57,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {14077#true} call #t~ret11 := main(); {14077#true} is VALID [2022-04-15 12:59:57,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {14077#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14077#true} is VALID [2022-04-15 12:59:57,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {14077#true} [129] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_66) (+ v_main_~x~0_In_33 v_main_~y~0_In_31)) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33)) (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14077#true} is VALID [2022-04-15 12:59:57,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {14077#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[] {14077#true} is VALID [2022-04-15 12:59:57,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {14077#true} ~z~0 := ~y~0; {14082#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:57,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {14082#(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; {14083#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:59:57,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {14083#(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; {14084#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:59:57,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {14084#(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; {14085#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:59:57,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {14085#(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; {14086#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:59:57,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {14086#(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; {14087#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:59:57,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {14087#(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; {14088#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:59:57,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {14088#(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; {14089#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:59:57,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {14089#(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; {14090#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 12:59:57,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {14090#(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; {14091#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 12:59:57,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {14091#(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; {14092#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} is VALID [2022-04-15 12:59:57,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {14092#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} assume !(~z~0 % 4294967296 > 0); {14093#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 12:59:57,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {14093#(<= 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; {14094#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:57,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {14094#(<= 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; {14095#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 12:59:57,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {14095#(<= 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; {14096#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:57,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {14096#(<= 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; {14097#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:59:57,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {14097#(<= 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; {14098#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:57,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {14098#(<= 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; {14099#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:57,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {14099#(<= 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; {14100#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:57,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {14100#(<= 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; {14101#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:57,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {14101#(<= 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; {14102#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:57,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {14102#(<= 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; {14103#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:57,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {14103#(<= 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; {14078#false} is VALID [2022-04-15 12:59:57,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {14078#false} assume !(~y~0 % 4294967296 > 0); {14078#false} is VALID [2022-04-15 12:59:57,680 INFO L272 TraceCheckUtils]: 32: Hoare triple {14078#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14078#false} is VALID [2022-04-15 12:59:57,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {14078#false} ~cond := #in~cond; {14078#false} is VALID [2022-04-15 12:59:57,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {14078#false} assume 0 == ~cond; {14078#false} is VALID [2022-04-15 12:59:57,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {14078#false} assume !false; {14078#false} is VALID [2022-04-15 12:59:57,681 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-15 12:59:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178100231] [2022-04-15 12:59:57,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178100231] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679445722] [2022-04-15 12:59:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:57,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:57,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:57,682 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-15 12:59:57,682 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-15 12:59:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:57,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 12:59:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:57,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:58,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {14077#true} call ULTIMATE.init(); {14077#true} is VALID [2022-04-15 12:59:58,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {14077#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14077#true} is VALID [2022-04-15 12:59:58,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {14077#true} assume true; {14077#true} is VALID [2022-04-15 12:59:58,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14077#true} {14077#true} #61#return; {14077#true} is VALID [2022-04-15 12:59:58,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {14077#true} call #t~ret11 := main(); {14077#true} is VALID [2022-04-15 12:59:58,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {14077#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14077#true} is VALID [2022-04-15 12:59:58,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {14077#true} [129] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_66) (+ v_main_~x~0_In_33 v_main_~y~0_In_31)) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33)) (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14077#true} is VALID [2022-04-15 12:59:58,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {14077#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[] {14077#true} is VALID [2022-04-15 12:59:58,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {14077#true} ~z~0 := ~y~0; {14082#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 12:59:58,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {14082#(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; {14083#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 12:59:58,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {14083#(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; {14084#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 12:59:58,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {14084#(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; {14085#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 12:59:58,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {14085#(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; {14086#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 12:59:58,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {14086#(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; {14087#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:59:58,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {14087#(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; {14088#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 12:59:58,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {14088#(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; {14089#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 12:59:58,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {14089#(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; {14090#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 12:59:58,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {14090#(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; {14091#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 12:59:58,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {14091#(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; {14092#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} is VALID [2022-04-15 12:59:58,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {14092#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} assume !(~z~0 % 4294967296 > 0); {14093#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 12:59:58,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {14093#(<= 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; {14094#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:58,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {14094#(<= 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; {14095#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 12:59:58,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {14095#(<= 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; {14096#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:58,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {14096#(<= 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; {14097#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 12:59:58,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {14097#(<= 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; {14098#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:58,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {14098#(<= 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; {14099#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:58,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {14099#(<= 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; {14100#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:58,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {14100#(<= 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; {14101#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 12:59:58,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {14101#(<= 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; {14102#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 12:59:58,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {14102#(<= 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; {14103#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 12:59:58,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {14103#(<= 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; {14078#false} is VALID [2022-04-15 12:59:58,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {14078#false} assume !(~y~0 % 4294967296 > 0); {14078#false} is VALID [2022-04-15 12:59:58,416 INFO L272 TraceCheckUtils]: 32: Hoare triple {14078#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14078#false} is VALID [2022-04-15 12:59:58,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {14078#false} ~cond := #in~cond; {14078#false} is VALID [2022-04-15 12:59:58,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {14078#false} assume 0 == ~cond; {14078#false} is VALID [2022-04-15 12:59:58,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {14078#false} assume !false; {14078#false} is VALID [2022-04-15 12:59:58,416 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-15 12:59:58,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:02,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {14078#false} assume !false; {14078#false} is VALID [2022-04-15 13:00:02,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {14078#false} assume 0 == ~cond; {14078#false} is VALID [2022-04-15 13:00:02,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {14078#false} ~cond := #in~cond; {14078#false} is VALID [2022-04-15 13:00:02,689 INFO L272 TraceCheckUtils]: 32: Hoare triple {14078#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14078#false} is VALID [2022-04-15 13:00:02,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {14078#false} assume !(~y~0 % 4294967296 > 0); {14078#false} is VALID [2022-04-15 13:00:02,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {14103#(<= 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; {14078#false} is VALID [2022-04-15 13:00:02,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {14102#(<= 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; {14103#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 13:00:02,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {14101#(<= 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; {14102#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 13:00:02,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {14100#(<= 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; {14101#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:02,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {14099#(<= 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; {14100#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:02,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {14098#(<= 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; {14099#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:02,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {14097#(<= 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; {14098#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:02,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {14096#(<= 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; {14097#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:00:02,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {14095#(<= 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; {14096#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:02,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {14094#(<= 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; {14095#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 13:00:02,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {14093#(<= 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; {14094#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:00:02,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {14261#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {14093#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 13:00:02,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {14265#(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; {14261#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 13:00:02,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {14269#(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; {14265#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 13:00:02,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {14273#(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; {14269#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 13:00:02,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {14277#(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; {14273#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 13:00:02,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {14281#(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; {14277#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 13:00:02,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {14285#(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; {14281#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-15 13:00:02,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {14289#(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; {14285#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 13:00:02,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {14293#(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; {14289#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-15 13:00:02,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {14297#(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; {14293#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-15 13:00:02,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {14301#(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; {14297#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-15 13:00:02,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {14077#true} ~z~0 := ~y~0; {14301#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-15 13:00:02,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {14077#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[] {14077#true} is VALID [2022-04-15 13:00:02,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {14077#true} [129] L16-2-->L16-3_primed: Formula: (or (and (= (+ v_main_~y~0_Out_62 v_main_~x~0_Out_66) (+ v_main_~x~0_In_33 v_main_~y~0_In_31)) (= |v_main_#t~post6_Out_62| 0) (= |v_main_#t~post5_Out_62| 0) (< 0 (mod (+ v_main_~x~0_Out_66 1) 4294967296)) (<= v_main_~x~0_Out_66 v_main_~x~0_In_33)) (and (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (= v_main_~x~0_In_33 v_main_~x~0_Out_66))) InVars {main_~x~0=v_main_~x~0_In_33, main_~y~0=v_main_~y~0_In_31} OutVars{main_~y~0=v_main_~y~0_Out_62, main_#t~post5=|v_main_#t~post5_Out_62|, main_~x~0=v_main_~x~0_Out_66, main_#t~post6=|v_main_#t~post6_Out_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14077#true} is VALID [2022-04-15 13:00:02,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {14077#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14077#true} is VALID [2022-04-15 13:00:02,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {14077#true} call #t~ret11 := main(); {14077#true} is VALID [2022-04-15 13:00:02,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14077#true} {14077#true} #61#return; {14077#true} is VALID [2022-04-15 13:00:02,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {14077#true} assume true; {14077#true} is VALID [2022-04-15 13:00:02,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {14077#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14077#true} is VALID [2022-04-15 13:00:02,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {14077#true} call ULTIMATE.init(); {14077#true} is VALID [2022-04-15 13:00:02,973 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-15 13:00:02,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679445722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:02,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:02,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 36 [2022-04-15 13:00:34,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:34,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1034398193] [2022-04-15 13:00:34,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1034398193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:34,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:34,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 13:00:34,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688722531] [2022-04-15 13:00:34,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:34,611 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-15 13:00:34,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:34,611 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-15 13:00:35,278 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-15 13:00:35,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 13:00:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 13:00:35,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1914, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 13:00:35,279 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-15 13:02:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:44,930 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2022-04-15 13:02:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 13:02:44,931 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-15 13:02:44,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:44,931 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-15 13:02:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2022-04-15 13:02:44,932 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-15 13:02:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2022-04-15 13:02:44,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 73 transitions. [2022-04-15 13:02:47,158 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-15 13:02:47,159 INFO L225 Difference]: With dead ends: 87 [2022-04-15 13:02:47,159 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 13:02:47,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 102.4s TimeCoverageRelationStatistics Valid=786, Invalid=7224, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 13:02:47,160 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:47,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 138 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 23.8s Time] [2022-04-15 13:02:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 13:02:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 13:02:47,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:47,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:47,365 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:47,365 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:47,366 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 13:02:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 13:02:47,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:47,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:47,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 13:02:47,366 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 13:02:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:47,367 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 13:02:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 13:02:47,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:47,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:47,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:47,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-15 13:02:47,367 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 45 [2022-04-15 13:02:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:47,368 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-15 13:02:47,368 INFO L479 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-15 13:02:47,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-15 13:02:50,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 13:02:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 13:02:50,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:50,010 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:50,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 13:02:50,210 WARN L460 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-15 13:02:50,210 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash -154434258, now seen corresponding path program 30 times [2022-04-15 13:02:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:50,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1071462876] [2022-04-15 13:02:50,344 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:02:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1040344079, now seen corresponding path program 1 times [2022-04-15 13:02:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:50,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687646360] [2022-04-15 13:02:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:52,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {14821#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14794#true} is VALID [2022-04-15 13:02:52,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {14794#true} assume true; {14794#true} is VALID [2022-04-15 13:02:52,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14794#true} {14794#true} #61#return; {14794#true} is VALID [2022-04-15 13:02:52,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {14794#true} call ULTIMATE.init(); {14821#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:52,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {14821#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14794#true} is VALID [2022-04-15 13:02:52,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {14794#true} assume true; {14794#true} is VALID [2022-04-15 13:02:52,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14794#true} {14794#true} #61#return; {14794#true} is VALID [2022-04-15 13:02:52,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {14794#true} call #t~ret11 := main(); {14794#true} is VALID [2022-04-15 13:02:52,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {14794#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14794#true} is VALID [2022-04-15 13:02:52,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {14794#true} [131] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_34 v_main_~x~0_Out_68) (= v_main_~y~0_In_32 v_main_~y~0_Out_64)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~x~0_In_34 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_68)) (= |v_main_#t~post6_Out_64| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)) (= |v_main_#t~post5_Out_64| 0))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_32} OutVars{main_~y~0=v_main_~y~0_Out_64, main_#t~post5=|v_main_#t~post5_Out_64|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14794#true} is VALID [2022-04-15 13:02:52,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {14794#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[] {14794#true} is VALID [2022-04-15 13:02:52,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {14794#true} ~z~0 := ~y~0; {14799#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:02:52,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {14799#(= 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; {14800#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:02:52,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {14800#(= (+ (- 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; {14801#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:02:52,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {14801#(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; {14802#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:02:52,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {14802#(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; {14803#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:02:52,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {14803#(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; {14804#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:02:52,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {14804#(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; {14805#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:02:52,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {14805#(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; {14806#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:02:52,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {14806#(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; {14807#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 13:02:52,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {14807#(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; {14808#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 13:02:52,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {14808#(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; {14809#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} is VALID [2022-04-15 13:02:52,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {14809#(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; {14810#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-15 13:02:52,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {14810#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14810#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-15 13:02:52,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {14810#(<= 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; {14811#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 13:02:53,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {14811#(<= 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; {14812#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:53,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {14812#(<= 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; {14813#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:53,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {14813#(<= 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; {14814#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:02:53,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {14814#(<= 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; {14815#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:02:53,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {14815#(<= 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; {14816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:02:53,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {14816#(<= 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; {14817#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:02:53,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {14817#(<= 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; {14818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:02:53,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {14818#(<= 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; {14819#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:02:53,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {14819#(<= 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; {14820#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:02:53,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {14820#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14795#false} is VALID [2022-04-15 13:02:53,069 INFO L272 TraceCheckUtils]: 32: Hoare triple {14795#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14795#false} is VALID [2022-04-15 13:02:53,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {14795#false} ~cond := #in~cond; {14795#false} is VALID [2022-04-15 13:02:53,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {14795#false} assume 0 == ~cond; {14795#false} is VALID [2022-04-15 13:02:53,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {14795#false} assume !false; {14795#false} is VALID [2022-04-15 13:02:53,069 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-15 13:02:53,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:53,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687646360] [2022-04-15 13:02:53,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687646360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:02:53,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707823194] [2022-04-15 13:02:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:53,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:53,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:53,070 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-15 13:02:53,071 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-15 13:02:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:53,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 13:02:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:53,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:02:53,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {14794#true} call ULTIMATE.init(); {14794#true} is VALID [2022-04-15 13:02:53,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {14794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14794#true} is VALID [2022-04-15 13:02:53,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {14794#true} assume true; {14794#true} is VALID [2022-04-15 13:02:53,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14794#true} {14794#true} #61#return; {14794#true} is VALID [2022-04-15 13:02:53,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {14794#true} call #t~ret11 := main(); {14794#true} is VALID [2022-04-15 13:02:53,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {14794#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14794#true} is VALID [2022-04-15 13:02:53,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {14794#true} [131] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_In_34 v_main_~x~0_Out_68) (= v_main_~y~0_In_32 v_main_~y~0_Out_64)) (and (<= v_main_~x~0_Out_68 v_main_~x~0_In_34) (= (+ v_main_~x~0_In_34 v_main_~y~0_In_32) (+ v_main_~y~0_Out_64 v_main_~x~0_Out_68)) (= |v_main_#t~post6_Out_64| 0) (< 0 (mod (+ v_main_~x~0_Out_68 1) 4294967296)) (= |v_main_#t~post5_Out_64| 0))) InVars {main_~x~0=v_main_~x~0_In_34, main_~y~0=v_main_~y~0_In_32} OutVars{main_~y~0=v_main_~y~0_Out_64, main_#t~post5=|v_main_#t~post5_Out_64|, main_~x~0=v_main_~x~0_Out_68, main_#t~post6=|v_main_#t~post6_Out_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14794#true} is VALID [2022-04-15 13:02:53,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {14794#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[] {14794#true} is VALID [2022-04-15 13:02:53,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {14794#true} ~z~0 := ~y~0; {14799#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 13:02:53,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {14799#(= 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; {14800#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 13:02:53,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {14800#(= (+ (- 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; {14801#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:02:53,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {14801#(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; {14802#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 13:02:53,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {14802#(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; {14803#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:02:53,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {14803#(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; {14804#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:02:53,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {14804#(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; {14805#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 13:02:53,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {14805#(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; {14806#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:02:53,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {14806#(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; {14807#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 13:02:53,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {14807#(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; {14808#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 13:02:53,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {14808#(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; {14809#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} is VALID [2022-04-15 13:02:53,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {14809#(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; {14810#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-15 13:02:53,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {14810#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14810#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-15 13:02:53,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {14810#(<= 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; {14811#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 13:02:53,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {14811#(<= 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; {14812#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:53,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {14812#(<= 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; {14813#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 13:02:53,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {14813#(<= 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; {14814#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 13:02:53,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {14814#(<= 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; {14815#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 13:02:54,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {14815#(<= 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; {14816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 13:02:54,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {14816#(<= 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; {14817#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 13:02:54,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {14817#(<= 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; {14818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 13:02:54,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {14818#(<= 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; {14819#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 13:02:54,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {14819#(<= 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; {14820#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 13:02:54,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {14820#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14795#false} is VALID [2022-04-15 13:02:54,034 INFO L272 TraceCheckUtils]: 32: Hoare triple {14795#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14795#false} is VALID [2022-04-15 13:02:54,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {14795#false} ~cond := #in~cond; {14795#false} is VALID [2022-04-15 13:02:54,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {14795#false} assume 0 == ~cond; {14795#false} is VALID [2022-04-15 13:02:54,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {14795#false} assume !false; {14795#false} is VALID [2022-04-15 13:02:54,035 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-15 13:02:54,035 INFO L328 TraceCheckSpWp]: Computing backward predicates...