/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:13:15,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:13:15,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:13:15,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:13:15,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:13:15,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:13:15,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:13:15,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:13:15,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:13:15,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:13:15,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:13:15,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:13:15,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:13:15,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:13:15,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:13:15,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:13:15,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:13:15,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:13:15,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:13:15,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:13:15,434 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:13:15,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:13:15,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:13:15,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:13:15,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:13:15,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:13:15,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:13:15,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:13:15,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:13:15,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:13:15,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:13:15,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:13:15,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:13:15,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:13:15,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:13:15,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:13:15,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:13:15,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:13:15,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:13:15,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:13:15,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:13:15,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:13:15,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:13:15,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:13:15,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:13:15,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:13:15,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:13:15,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:13:15,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:13:15,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:13:15,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:13:15,475 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:13:15,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:13:15,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:13:15,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:13:15,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:13:15,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:13:15,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:13:15,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:13:15,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:13:15,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:13:15,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:13:15,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:13:15,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:13:15,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:13:15,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:13:15,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:13:15,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:13:15,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:13:15,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:13:15,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:13:15,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:13:15,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:13:15,480 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:13:15,480 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:13:15,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:13:15,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 11:13:15,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:13:15,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:13:15,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:13:15,668 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:13:15,668 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:13:15,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-27 11:13:15,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8e1ec6a5/990e8609154042759f7cf5bc38a82870/FLAG544842e1d [2022-04-27 11:13:16,112 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:13:16,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-27 11:13:16,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8e1ec6a5/990e8609154042759f7cf5bc38a82870/FLAG544842e1d [2022-04-27 11:13:16,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8e1ec6a5/990e8609154042759f7cf5bc38a82870 [2022-04-27 11:13:16,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:13:16,132 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:13:16,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:13:16,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:13:16,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:13:16,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:13:16" (1/1) ... [2022-04-27 11:13:16,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d0d2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16, skipping insertion in model container [2022-04-27 11:13:16,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:13:16" (1/1) ... [2022-04-27 11:13:16,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:13:16,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:13:16,276 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-de52.c[368,381] [2022-04-27 11:13:16,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:13:16,293 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:13:16,300 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-de52.c[368,381] [2022-04-27 11:13:16,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:13:16,313 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:13:16,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16 WrapperNode [2022-04-27 11:13:16,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:13:16,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:13:16,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:13:16,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:13:16,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16" (1/1) ... [2022-04-27 11:13:16,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16" (1/1) ... [2022-04-27 11:13:16,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16" (1/1) ... [2022-04-27 11:13:16,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16" (1/1) ... [2022-04-27 11:13:16,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16" (1/1) ... [2022-04-27 11:13:16,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16" (1/1) ... [2022-04-27 11:13:16,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16" (1/1) ... [2022-04-27 11:13:16,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:13:16,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:13:16,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:13:16,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:13:16,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16" (1/1) ... [2022-04-27 11:13:16,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:13:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:16,358 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-27 11:13:16,363 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-27 11:13:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:13:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:13:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:13:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:13:16,382 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:13:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:13:16,424 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:13:16,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:13:16,630 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:13:16,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:13:16,634 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-27 11:13:16,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:13:16 BoogieIcfgContainer [2022-04-27 11:13:16,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:13:16,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:13:16,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:13:16,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:13:16,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:13:16" (1/3) ... [2022-04-27 11:13:16,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56445f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:13:16, skipping insertion in model container [2022-04-27 11:13:16,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:16" (2/3) ... [2022-04-27 11:13:16,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56445f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:13:16, skipping insertion in model container [2022-04-27 11:13:16,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:13:16" (3/3) ... [2022-04-27 11:13:16,643 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de52.c [2022-04-27 11:13:16,653 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:13:16,653 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:13:16,706 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:13:16,712 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@746051a6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5053a479 [2022-04-27 11:13:16,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:13:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-27 11:13:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:13:16,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:16,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:16,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:16,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-27 11:13:16,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:16,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073678427] [2022-04-27 11:13:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:16,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:16,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-27 11:13:16,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 11:13:16,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-27 11:13:16,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:16,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-27 11:13:16,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 11:13:16,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-27 11:13:16,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-27 11:13:16,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-27 11:13:16,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-27 11:13:16,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-27 11:13:16,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-27 11:13:16,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-27 11:13:16,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-27 11:13:16,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-27 11:13:16,931 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-27 11:13:16,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-27 11:13:16,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-27 11:13:16,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-27 11:13:16,931 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-27 11:13:16,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:16,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073678427] [2022-04-27 11:13:16,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073678427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:16,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:16,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:13:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81903385] [2022-04-27 11:13:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:16,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-27 11:13:16,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:16,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-27 11:13:16,959 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-27 11:13:16,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:13:16,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:13:16,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:13:16,980 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-27 11:13:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,066 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-27 11:13:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:13:17,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-27 11:13:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-27 11:13:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 11:13:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-27 11:13:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 11:13:17,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-27 11:13:17,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:17,168 INFO L225 Difference]: With dead ends: 41 [2022-04-27 11:13:17,169 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:13:17,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:13:17,173 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:17,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:13:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 11:13:17,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:17,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-27 11:13:17,199 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-27 11:13:17,200 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-27 11:13:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,205 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-27 11:13:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-27 11:13:17,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:17,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:17,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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 17 states. [2022-04-27 11:13:17,207 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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 17 states. [2022-04-27 11:13:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,209 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-27 11:13:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-27 11:13:17,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:17,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:17,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:17,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-27 11:13:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-27 11:13:17,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-27 11:13:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:17,215 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-27 11:13:17,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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-27 11:13:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-27 11:13:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:13:17,223 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:17,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:17,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:13:17,224 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:17,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-27 11:13:17,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:17,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463219314] [2022-04-27 11:13:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:17,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {146#true} is VALID [2022-04-27 11:13:17,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} assume true; {146#true} is VALID [2022-04-27 11:13:17,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146#true} {146#true} #83#return; {146#true} is VALID [2022-04-27 11:13:17,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:17,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {146#true} is VALID [2022-04-27 11:13:17,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume true; {146#true} is VALID [2022-04-27 11:13:17,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146#true} {146#true} #83#return; {146#true} is VALID [2022-04-27 11:13:17,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {146#true} call #t~ret15 := main(); {146#true} is VALID [2022-04-27 11:13:17,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {146#true} is VALID [2022-04-27 11:13:17,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#true} assume !(~x~0 % 4294967296 > 0); {146#true} is VALID [2022-04-27 11:13:17,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#true} ~z~0 := ~y~0; {146#true} is VALID [2022-04-27 11:13:17,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#true} assume !(~z~0 % 4294967296 > 0); {146#true} is VALID [2022-04-27 11:13:17,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#true} assume !(~y~0 % 4294967296 > 0); {151#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-27 11:13:17,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~x~0 % 4294967296 > 0); {151#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-27 11:13:17,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~z~0 % 4294967296 > 0); {151#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-27 11:13:17,329 INFO L272 TraceCheckUtils]: 12: Hoare triple {151#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:17,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {153#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:17,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {153#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {147#false} is VALID [2022-04-27 11:13:17,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-04-27 11:13:17,330 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-27 11:13:17,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:17,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463219314] [2022-04-27 11:13:17,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463219314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:17,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:17,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:13:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008280351] [2022-04-27 11:13:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-27 11:13:17,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:17,332 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), 4 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-27 11:13:17,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:17,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:13:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:17,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:13:17,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:13:17,347 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-27 11:13:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,535 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-27 11:13:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:13:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-27 11:13:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-27 11:13:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 11:13:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-27 11:13:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 11:13:17,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-27 11:13:17,576 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-27 11:13:17,577 INFO L225 Difference]: With dead ends: 34 [2022-04-27 11:13:17,577 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 11:13:17,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:13:17,578 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:17,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 11:13:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 11:13:17,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:17,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,582 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,583 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,584 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-27 11:13:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-27 11:13:17,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:17,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:17,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states 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-27 11:13:17,585 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states 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-27 11:13:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,586 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-27 11:13:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-27 11:13:17,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:17,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:17,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:17,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-04-27 11:13:17,587 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2022-04-27 11:13:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:17,588 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-04-27 11:13:17,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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-27 11:13:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-27 11:13:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:13:17,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:17,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:17,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:13:17,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:17,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-27 11:13:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:17,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512562493] [2022-04-27 11:13:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:17,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:17,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {291#true} is VALID [2022-04-27 11:13:17,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-27 11:13:17,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291#true} {291#true} #83#return; {291#true} is VALID [2022-04-27 11:13:17,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:17,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {291#true} is VALID [2022-04-27 11:13:17,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-27 11:13:17,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #83#return; {291#true} is VALID [2022-04-27 11:13:17,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret15 := main(); {291#true} is VALID [2022-04-27 11:13:17,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {291#true} is VALID [2022-04-27 11:13:17,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {291#true} assume !(~x~0 % 4294967296 > 0); {291#true} is VALID [2022-04-27 11:13:17,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#true} ~z~0 := ~y~0; {291#true} is VALID [2022-04-27 11:13:17,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {291#true} assume !(~z~0 % 4294967296 > 0); {296#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-27 11:13:17,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {296#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-27 11:13:17,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {296#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-27 11:13:17,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {292#false} is VALID [2022-04-27 11:13:17,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {292#false} assume !(~z~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:13:17,640 INFO L272 TraceCheckUtils]: 13: Hoare triple {292#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {292#false} is VALID [2022-04-27 11:13:17,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2022-04-27 11:13:17,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2022-04-27 11:13:17,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-27 11:13:17,641 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-27 11:13:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512562493] [2022-04-27 11:13:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512562493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:17,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:13:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220966935] [2022-04-27 11:13:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:17,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:17,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,657 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-27 11:13:17,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:13:17,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:17,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:13:17,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:13:17,659 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,723 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-27 11:13:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:13:17,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-27 11:13:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-27 11:13:17,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-27 11:13:17,757 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-27 11:13:17,759 INFO L225 Difference]: With dead ends: 34 [2022-04-27 11:13:17,759 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 11:13:17,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:17,765 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:17,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 11:13:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 11:13:17,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:17,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,777 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,777 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,781 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-27 11:13:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-27 11:13:17,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:17,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:17,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states 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-27 11:13:17,782 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states 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-27 11:13:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,783 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-27 11:13:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-27 11:13:17,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:17,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:17,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:17,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-04-27 11:13:17,785 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-04-27 11:13:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:17,785 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-04-27 11:13:17,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-27 11:13:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:13:17,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:17,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:17,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:13:17,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-27 11:13:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:17,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590233989] [2022-04-27 11:13:17,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:17,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:17,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:17,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {445#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {439#true} is VALID [2022-04-27 11:13:17,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#true} assume true; {439#true} is VALID [2022-04-27 11:13:17,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {439#true} {439#true} #83#return; {439#true} is VALID [2022-04-27 11:13:17,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {439#true} call ULTIMATE.init(); {445#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:17,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {439#true} is VALID [2022-04-27 11:13:17,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {439#true} assume true; {439#true} is VALID [2022-04-27 11:13:17,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439#true} {439#true} #83#return; {439#true} is VALID [2022-04-27 11:13:17,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {439#true} call #t~ret15 := main(); {439#true} is VALID [2022-04-27 11:13:17,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {439#true} is VALID [2022-04-27 11:13:17,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {439#true} assume !(~x~0 % 4294967296 > 0); {444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:17,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:17,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:17,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:17,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {440#false} is VALID [2022-04-27 11:13:17,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {440#false} assume !(~x~0 % 4294967296 > 0); {440#false} is VALID [2022-04-27 11:13:17,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {440#false} assume !(~z~0 % 4294967296 > 0); {440#false} is VALID [2022-04-27 11:13:17,828 INFO L272 TraceCheckUtils]: 13: Hoare triple {440#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {440#false} is VALID [2022-04-27 11:13:17,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {440#false} ~cond := #in~cond; {440#false} is VALID [2022-04-27 11:13:17,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#false} assume 0 == ~cond; {440#false} is VALID [2022-04-27 11:13:17,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {440#false} assume !false; {440#false} is VALID [2022-04-27 11:13:17,828 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-27 11:13:17,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:17,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590233989] [2022-04-27 11:13:17,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590233989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:17,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:17,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:13:17,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259665223] [2022-04-27 11:13:17,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:17,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:17,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,839 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-27 11:13:17,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:13:17,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:17,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:13:17,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:13:17,840 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,903 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-04-27 11:13:17,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:13:17,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-27 11:13:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-27 11:13:17,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-27 11:13:17,930 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-27 11:13:17,932 INFO L225 Difference]: With dead ends: 43 [2022-04-27 11:13:17,933 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 11:13:17,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:17,940 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:17,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 11:13:17,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 11:13:17,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:17,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,946 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,947 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,948 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-27 11:13:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-27 11:13:17,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:17,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:17,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-27 11:13:17,948 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-27 11:13:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,950 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-27 11:13:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-27 11:13:17,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:17,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:17,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:17,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-27 11:13:17,951 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 17 [2022-04-27 11:13:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:17,951 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-27 11:13:17,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-27 11:13:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-27 11:13:17,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 11:13:17,952 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:17,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:17,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 11:13:17,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:17,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 1 times [2022-04-27 11:13:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:17,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941427650] [2022-04-27 11:13:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:17,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:18,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {615#true} is VALID [2022-04-27 11:13:18,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {615#true} assume true; {615#true} is VALID [2022-04-27 11:13:18,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {615#true} {615#true} #83#return; {615#true} is VALID [2022-04-27 11:13:18,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {615#true} call ULTIMATE.init(); {622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:18,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {615#true} is VALID [2022-04-27 11:13:18,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {615#true} assume true; {615#true} is VALID [2022-04-27 11:13:18,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {615#true} {615#true} #83#return; {615#true} is VALID [2022-04-27 11:13:18,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {615#true} call #t~ret15 := main(); {615#true} is VALID [2022-04-27 11:13:18,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {615#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {620#(= main_~y~0 0)} is VALID [2022-04-27 11:13:18,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {620#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {620#(= main_~y~0 0)} is VALID [2022-04-27 11:13:18,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {620#(= main_~y~0 0)} ~z~0 := ~y~0; {621#(= main_~z~0 0)} is VALID [2022-04-27 11:13:18,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#(= 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; {616#false} is VALID [2022-04-27 11:13:18,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {616#false} assume !(~z~0 % 4294967296 > 0); {616#false} is VALID [2022-04-27 11:13:18,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {616#false} assume !(~y~0 % 4294967296 > 0); {616#false} is VALID [2022-04-27 11:13:18,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {616#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {616#false} is VALID [2022-04-27 11:13:18,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {616#false} assume !(~x~0 % 4294967296 > 0); {616#false} is VALID [2022-04-27 11:13:18,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {616#false} assume !(~z~0 % 4294967296 > 0); {616#false} is VALID [2022-04-27 11:13:18,010 INFO L272 TraceCheckUtils]: 14: Hoare triple {616#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {616#false} is VALID [2022-04-27 11:13:18,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#false} ~cond := #in~cond; {616#false} is VALID [2022-04-27 11:13:18,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {616#false} assume 0 == ~cond; {616#false} is VALID [2022-04-27 11:13:18,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {616#false} assume !false; {616#false} is VALID [2022-04-27 11:13:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941427650] [2022-04-27 11:13:18,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941427650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:18,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:18,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:13:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584457758] [2022-04-27 11:13:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 11:13:18,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:18,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:18,023 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-27 11:13:18,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:13:18,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:18,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:13:18,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:18,024 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:18,127 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-27 11:13:18,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:13:18,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 11:13:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 11:13:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 11:13:18,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 11:13:18,156 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-27 11:13:18,157 INFO L225 Difference]: With dead ends: 40 [2022-04-27 11:13:18,157 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 11:13:18,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:13:18,157 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:18,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 11:13:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 11:13:18,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:18,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 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-27 11:13:18,165 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 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-27 11:13:18,165 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 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-27 11:13:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:18,166 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-27 11:13:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-27 11:13:18,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:18,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:18,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 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 28 states. [2022-04-27 11:13:18,166 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 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 28 states. [2022-04-27 11:13:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:18,167 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-27 11:13:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-27 11:13:18,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:18,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:18,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:18,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 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-27 11:13:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-04-27 11:13:18,169 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2022-04-27 11:13:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:18,169 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-04-27 11:13:18,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-27 11:13:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:13:18,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:18,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:18,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 11:13:18,170 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash 735022287, now seen corresponding path program 1 times [2022-04-27 11:13:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:18,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207621593] [2022-04-27 11:13:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:18,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:18,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:18,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {777#true} is VALID [2022-04-27 11:13:18,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {777#true} assume true; {777#true} is VALID [2022-04-27 11:13:18,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {777#true} {777#true} #83#return; {777#true} is VALID [2022-04-27 11:13:18,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {777#true} call ULTIMATE.init(); {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:18,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {777#true} is VALID [2022-04-27 11:13:18,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {777#true} assume true; {777#true} is VALID [2022-04-27 11:13:18,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {777#true} {777#true} #83#return; {777#true} is VALID [2022-04-27 11:13:18,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {777#true} call #t~ret15 := main(); {777#true} is VALID [2022-04-27 11:13:18,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {777#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {782#(= main_~y~0 0)} is VALID [2022-04-27 11:13:18,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {782#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:18,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:18,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {784#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:18,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {778#false} is VALID [2022-04-27 11:13:18,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#false} assume !(~y~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#false} assume !(~x~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {778#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {778#false} is VALID [2022-04-27 11:13:18,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {778#false} assume !(~z~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,265 INFO L272 TraceCheckUtils]: 15: Hoare triple {778#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {778#false} is VALID [2022-04-27 11:13:18,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {778#false} ~cond := #in~cond; {778#false} is VALID [2022-04-27 11:13:18,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#false} assume 0 == ~cond; {778#false} is VALID [2022-04-27 11:13:18,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {778#false} assume !false; {778#false} is VALID [2022-04-27 11:13:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:18,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207621593] [2022-04-27 11:13:18,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207621593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393479744] [2022-04-27 11:13:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:18,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:18,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:18,267 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-27 11:13:18,267 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-27 11:13:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:18,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:13:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:18,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:18,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {777#true} call ULTIMATE.init(); {777#true} is VALID [2022-04-27 11:13:18,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {777#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {777#true} is VALID [2022-04-27 11:13:18,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {777#true} assume true; {777#true} is VALID [2022-04-27 11:13:18,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {777#true} {777#true} #83#return; {777#true} is VALID [2022-04-27 11:13:18,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {777#true} call #t~ret15 := main(); {777#true} is VALID [2022-04-27 11:13:18,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {777#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {782#(= main_~y~0 0)} is VALID [2022-04-27 11:13:18,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {782#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:18,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:18,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {813#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:18,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {813#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {778#false} is VALID [2022-04-27 11:13:18,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#false} assume !(~y~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#false} assume !(~x~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {778#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {778#false} is VALID [2022-04-27 11:13:18,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {778#false} assume !(~z~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,433 INFO L272 TraceCheckUtils]: 15: Hoare triple {778#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {778#false} is VALID [2022-04-27 11:13:18,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {778#false} ~cond := #in~cond; {778#false} is VALID [2022-04-27 11:13:18,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#false} assume 0 == ~cond; {778#false} is VALID [2022-04-27 11:13:18,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {778#false} assume !false; {778#false} is VALID [2022-04-27 11:13:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:18,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:18,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {778#false} assume !false; {778#false} is VALID [2022-04-27 11:13:18,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#false} assume 0 == ~cond; {778#false} is VALID [2022-04-27 11:13:18,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {778#false} ~cond := #in~cond; {778#false} is VALID [2022-04-27 11:13:18,504 INFO L272 TraceCheckUtils]: 15: Hoare triple {778#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {778#false} is VALID [2022-04-27 11:13:18,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {778#false} assume !(~z~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {778#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {778#false} is VALID [2022-04-27 11:13:18,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#false} assume !(~x~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#false} assume !(~y~0 % 4294967296 > 0); {778#false} is VALID [2022-04-27 11:13:18,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {868#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {778#false} is VALID [2022-04-27 11:13:18,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {872#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {868#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:13:18,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#true} ~z~0 := ~y~0; {872#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:13:18,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {777#true} assume !(~x~0 % 4294967296 > 0); {777#true} is VALID [2022-04-27 11:13:18,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {777#true} is VALID [2022-04-27 11:13:18,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {777#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {777#true} is VALID [2022-04-27 11:13:18,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {777#true} call #t~ret15 := main(); {777#true} is VALID [2022-04-27 11:13:18,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {777#true} {777#true} #83#return; {777#true} is VALID [2022-04-27 11:13:18,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {777#true} assume true; {777#true} is VALID [2022-04-27 11:13:18,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {777#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {777#true} is VALID [2022-04-27 11:13:18,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {777#true} call ULTIMATE.init(); {777#true} is VALID [2022-04-27 11:13:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:18,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393479744] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:18,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:13:18,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 9 [2022-04-27 11:13:18,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796454284] [2022-04-27 11:13:18,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:18,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 19 [2022-04-27 11:13:18,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:18,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-27 11:13:18,518 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-27 11:13:18,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:13:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:18,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:13:18,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:13:18,519 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-27 11:13:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:18,557 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 11:13:18,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:13:18,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 19 [2022-04-27 11:13:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-27 11:13:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-27 11:13:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-27 11:13:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-27 11:13:18,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-27 11:13:18,579 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-27 11:13:18,580 INFO L225 Difference]: With dead ends: 35 [2022-04-27 11:13:18,580 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 11:13:18,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:13:18,581 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:18,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 11:13:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 11:13:18,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:18,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 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-27 11:13:18,588 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 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-27 11:13:18,588 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 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-27 11:13:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:18,589 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-27 11:13:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 11:13:18,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:18,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:18,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 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 25 states. [2022-04-27 11:13:18,590 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 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 25 states. [2022-04-27 11:13:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:18,590 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-27 11:13:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 11:13:18,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:18,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:18,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:18,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 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-27 11:13:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-27 11:13:18,592 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-27 11:13:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:18,592 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-27 11:13:18,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-27 11:13:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-27 11:13:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:13:18,593 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:18,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:18,618 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-27 11:13:18,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 11:13:18,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash -528072081, now seen corresponding path program 1 times [2022-04-27 11:13:18,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:18,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811993076] [2022-04-27 11:13:18,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:18,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:18,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {1041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1034#true} is VALID [2022-04-27 11:13:18,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {1034#true} assume true; {1034#true} is VALID [2022-04-27 11:13:18,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1034#true} {1034#true} #83#return; {1034#true} is VALID [2022-04-27 11:13:18,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {1034#true} call ULTIMATE.init(); {1041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:18,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1034#true} is VALID [2022-04-27 11:13:18,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {1034#true} assume true; {1034#true} is VALID [2022-04-27 11:13:18,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} #83#return; {1034#true} is VALID [2022-04-27 11:13:18,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {1034#true} call #t~ret15 := main(); {1034#true} is VALID [2022-04-27 11:13:18,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {1034#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1039#(= main_~y~0 0)} is VALID [2022-04-27 11:13:18,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {1039#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1040#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:13:18,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {1040#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {1040#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:13:18,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {1040#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} ~z~0 := ~y~0; {1040#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:13:18,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {1040#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1040#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:13:18,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {1040#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1040#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:13:18,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {1040#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {1035#false} is VALID [2022-04-27 11:13:18,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {1035#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1035#false} is VALID [2022-04-27 11:13:18,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {1035#false} assume !(~x~0 % 4294967296 > 0); {1035#false} is VALID [2022-04-27 11:13:18,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {1035#false} assume !(~z~0 % 4294967296 > 0); {1035#false} is VALID [2022-04-27 11:13:18,884 INFO L272 TraceCheckUtils]: 15: Hoare triple {1035#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1035#false} is VALID [2022-04-27 11:13:18,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {1035#false} ~cond := #in~cond; {1035#false} is VALID [2022-04-27 11:13:18,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {1035#false} assume 0 == ~cond; {1035#false} is VALID [2022-04-27 11:13:18,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2022-04-27 11:13:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:18,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:18,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811993076] [2022-04-27 11:13:18,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811993076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:18,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182220063] [2022-04-27 11:13:18,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:18,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:18,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:18,886 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-27 11:13:18,907 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-27 11:13:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:18,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:13:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:18,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:18,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {1034#true} call ULTIMATE.init(); {1034#true} is VALID [2022-04-27 11:13:18,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {1034#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1034#true} is VALID [2022-04-27 11:13:18,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {1034#true} assume true; {1034#true} is VALID [2022-04-27 11:13:18,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} #83#return; {1034#true} is VALID [2022-04-27 11:13:18,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {1034#true} call #t~ret15 := main(); {1034#true} is VALID [2022-04-27 11:13:18,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {1034#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1039#(= main_~y~0 0)} is VALID [2022-04-27 11:13:18,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {1039#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1063#(= main_~y~0 1)} is VALID [2022-04-27 11:13:18,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {1063#(= main_~y~0 1)} assume !(~x~0 % 4294967296 > 0); {1063#(= main_~y~0 1)} is VALID [2022-04-27 11:13:18,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {1063#(= main_~y~0 1)} ~z~0 := ~y~0; {1070#(and (= main_~z~0 main_~y~0) (= main_~y~0 1))} is VALID [2022-04-27 11:13:18,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {1070#(and (= main_~z~0 main_~y~0) (= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1063#(= main_~y~0 1)} is VALID [2022-04-27 11:13:18,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {1063#(= main_~y~0 1)} assume !(~z~0 % 4294967296 > 0); {1063#(= main_~y~0 1)} is VALID [2022-04-27 11:13:18,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(= main_~y~0 1)} assume !(~y~0 % 4294967296 > 0); {1035#false} is VALID [2022-04-27 11:13:18,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {1035#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1035#false} is VALID [2022-04-27 11:13:18,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {1035#false} assume !(~x~0 % 4294967296 > 0); {1035#false} is VALID [2022-04-27 11:13:18,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {1035#false} assume !(~z~0 % 4294967296 > 0); {1035#false} is VALID [2022-04-27 11:13:18,989 INFO L272 TraceCheckUtils]: 15: Hoare triple {1035#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1035#false} is VALID [2022-04-27 11:13:18,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {1035#false} ~cond := #in~cond; {1035#false} is VALID [2022-04-27 11:13:18,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {1035#false} assume 0 == ~cond; {1035#false} is VALID [2022-04-27 11:13:18,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2022-04-27 11:13:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:18,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:19,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2022-04-27 11:13:19,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {1035#false} assume 0 == ~cond; {1035#false} is VALID [2022-04-27 11:13:19,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {1035#false} ~cond := #in~cond; {1035#false} is VALID [2022-04-27 11:13:19,045 INFO L272 TraceCheckUtils]: 15: Hoare triple {1035#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1035#false} is VALID [2022-04-27 11:13:19,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {1035#false} assume !(~z~0 % 4294967296 > 0); {1035#false} is VALID [2022-04-27 11:13:19,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {1035#false} assume !(~x~0 % 4294967296 > 0); {1035#false} is VALID [2022-04-27 11:13:19,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {1035#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1035#false} is VALID [2022-04-27 11:13:19,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {1122#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1035#false} is VALID [2022-04-27 11:13:19,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {1122#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1122#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:19,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {1129#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1122#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:19,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {1034#true} ~z~0 := ~y~0; {1129#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:13:19,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {1034#true} assume !(~x~0 % 4294967296 > 0); {1034#true} is VALID [2022-04-27 11:13:19,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {1034#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1034#true} is VALID [2022-04-27 11:13:19,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {1034#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1034#true} is VALID [2022-04-27 11:13:19,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {1034#true} call #t~ret15 := main(); {1034#true} is VALID [2022-04-27 11:13:19,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} #83#return; {1034#true} is VALID [2022-04-27 11:13:19,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {1034#true} assume true; {1034#true} is VALID [2022-04-27 11:13:19,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {1034#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1034#true} is VALID [2022-04-27 11:13:19,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {1034#true} call ULTIMATE.init(); {1034#true} is VALID [2022-04-27 11:13:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:19,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182220063] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:19,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:13:19,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2022-04-27 11:13:19,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101722890] [2022-04-27 11:13:19,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:19,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 19 [2022-04-27 11:13:19,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:19,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-27 11:13:19,060 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-27 11:13:19,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:13:19,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:19,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:13:19,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:13:19,061 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-27 11:13:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:19,107 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 11:13:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:13:19,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 19 [2022-04-27 11:13:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-27 11:13:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-27 11:13:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-27 11:13:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-27 11:13:19,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-27 11:13:19,128 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-27 11:13:19,128 INFO L225 Difference]: With dead ends: 30 [2022-04-27 11:13:19,128 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 11:13:19,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:13:19,129 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:19,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 11:13:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 11:13:19,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:19,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:19,137 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:19,137 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:19,138 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 11:13:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 11:13:19,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:19,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:19,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 11:13:19,138 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 11:13:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:19,139 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 11:13:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 11:13:19,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:19,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:19,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:19,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:19,139 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-27 11:13:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-27 11:13:19,140 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 19 [2022-04-27 11:13:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:19,140 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-27 11:13:19,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-27 11:13:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 11:13:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:13:19,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:19,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:19,159 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-27 11:13:19,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-27 11:13:19,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:19,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 1 times [2022-04-27 11:13:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:19,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459328003] [2022-04-27 11:13:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:19,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:19,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {1284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1277#true} is VALID [2022-04-27 11:13:19,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {1277#true} assume true; {1277#true} is VALID [2022-04-27 11:13:19,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1277#true} {1277#true} #83#return; {1277#true} is VALID [2022-04-27 11:13:19,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:19,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {1284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1277#true} is VALID [2022-04-27 11:13:19,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2022-04-27 11:13:19,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #83#return; {1277#true} is VALID [2022-04-27 11:13:19,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret15 := main(); {1277#true} is VALID [2022-04-27 11:13:19,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {1277#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1277#true} is VALID [2022-04-27 11:13:19,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:19,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:19,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:19,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:19,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:19,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:19,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:19,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1278#false} is VALID [2022-04-27 11:13:19,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {1278#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1278#false} is VALID [2022-04-27 11:13:19,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {1278#false} assume !(~z~0 % 4294967296 > 0); {1278#false} is VALID [2022-04-27 11:13:19,471 INFO L272 TraceCheckUtils]: 16: Hoare triple {1278#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1278#false} is VALID [2022-04-27 11:13:19,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {1278#false} ~cond := #in~cond; {1278#false} is VALID [2022-04-27 11:13:19,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#false} assume 0 == ~cond; {1278#false} is VALID [2022-04-27 11:13:19,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2022-04-27 11:13:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:19,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:19,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459328003] [2022-04-27 11:13:19,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459328003] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:19,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38756601] [2022-04-27 11:13:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:19,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:19,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:19,473 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-27 11:13:19,474 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-27 11:13:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:19,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 11:13:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:19,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:19,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2022-04-27 11:13:19,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1277#true} is VALID [2022-04-27 11:13:19,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2022-04-27 11:13:19,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #83#return; {1277#true} is VALID [2022-04-27 11:13:19,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret15 := main(); {1277#true} is VALID [2022-04-27 11:13:19,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {1277#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1277#true} is VALID [2022-04-27 11:13:19,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:19,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:19,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:19,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:19,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:19,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:19,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:19,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1278#false} is VALID [2022-04-27 11:13:19,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {1278#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1278#false} is VALID [2022-04-27 11:13:19,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {1278#false} assume !(~z~0 % 4294967296 > 0); {1278#false} is VALID [2022-04-27 11:13:19,805 INFO L272 TraceCheckUtils]: 16: Hoare triple {1278#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1278#false} is VALID [2022-04-27 11:13:19,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {1278#false} ~cond := #in~cond; {1278#false} is VALID [2022-04-27 11:13:19,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#false} assume 0 == ~cond; {1278#false} is VALID [2022-04-27 11:13:19,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2022-04-27 11:13:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:19,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:20,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2022-04-27 11:13:20,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#false} assume 0 == ~cond; {1278#false} is VALID [2022-04-27 11:13:20,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {1278#false} ~cond := #in~cond; {1278#false} is VALID [2022-04-27 11:13:20,034 INFO L272 TraceCheckUtils]: 16: Hoare triple {1278#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1278#false} is VALID [2022-04-27 11:13:20,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {1278#false} assume !(~z~0 % 4294967296 > 0); {1278#false} is VALID [2022-04-27 11:13:20,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {1278#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1278#false} is VALID [2022-04-27 11:13:20,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1278#false} is VALID [2022-04-27 11:13:20,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:20,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:20,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:20,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1283#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:20,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:20,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:20,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1282#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:20,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {1277#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1277#true} is VALID [2022-04-27 11:13:20,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret15 := main(); {1277#true} is VALID [2022-04-27 11:13:20,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #83#return; {1277#true} is VALID [2022-04-27 11:13:20,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2022-04-27 11:13:20,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1277#true} is VALID [2022-04-27 11:13:20,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2022-04-27 11:13:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:20,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38756601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:20,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:20,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-27 11:13:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733739286] [2022-04-27 11:13:20,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:20,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:13:20,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:20,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:20,074 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-27 11:13:20,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:13:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:20,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:13:20,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:20,075 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:20,196 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-27 11:13:20,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:13:20,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:13:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 11:13:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 11:13:20,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-27 11:13:20,229 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-27 11:13:20,229 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:13:20,229 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 11:13:20,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:13:20,230 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:20,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 11:13:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 11:13:20,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:20,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:20,243 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:20,243 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:20,244 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-04-27 11:13:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-27 11:13:20,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:20,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:20,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-27 11:13:20,244 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-27 11:13:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:20,245 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-04-27 11:13:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-27 11:13:20,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:20,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:20,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:20,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-04-27 11:13:20,246 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 20 [2022-04-27 11:13:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:20,246 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-04-27 11:13:20,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-27 11:13:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:13:20,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:20,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:20,271 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-27 11:13:20,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:20,464 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-04-27 11:13:20,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:20,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200267014] [2022-04-27 11:13:20,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:20,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:20,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:20,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {1553#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1543#true} is VALID [2022-04-27 11:13:20,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {1543#true} assume true; {1543#true} is VALID [2022-04-27 11:13:20,551 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1543#true} {1543#true} #83#return; {1543#true} is VALID [2022-04-27 11:13:20,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {1543#true} call ULTIMATE.init(); {1553#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:20,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {1553#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1543#true} is VALID [2022-04-27 11:13:20,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {1543#true} assume true; {1543#true} is VALID [2022-04-27 11:13:20,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1543#true} {1543#true} #83#return; {1543#true} is VALID [2022-04-27 11:13:20,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {1543#true} call #t~ret15 := main(); {1543#true} is VALID [2022-04-27 11:13:20,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {1543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1548#(= main_~y~0 0)} is VALID [2022-04-27 11:13:20,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {1548#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:20,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {1549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:20,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {1549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1550#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:20,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {1550#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1551#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:20,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {1551#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1551#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:20,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {1551#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1552#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:20,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {1552#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1552#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:20,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {1552#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1552#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:20,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {1552#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1552#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:20,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {1552#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1544#false} is VALID [2022-04-27 11:13:20,558 INFO L272 TraceCheckUtils]: 16: Hoare triple {1544#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1544#false} is VALID [2022-04-27 11:13:20,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {1544#false} ~cond := #in~cond; {1544#false} is VALID [2022-04-27 11:13:20,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {1544#false} assume 0 == ~cond; {1544#false} is VALID [2022-04-27 11:13:20,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#false} assume !false; {1544#false} is VALID [2022-04-27 11:13:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:20,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:20,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200267014] [2022-04-27 11:13:20,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200267014] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:20,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055763334] [2022-04-27 11:13:20,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:20,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:20,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:20,560 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-27 11:13:20,561 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-27 11:13:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:20,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:13:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:20,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:20,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {1543#true} call ULTIMATE.init(); {1543#true} is VALID [2022-04-27 11:13:20,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {1543#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1543#true} is VALID [2022-04-27 11:13:20,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {1543#true} assume true; {1543#true} is VALID [2022-04-27 11:13:20,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1543#true} {1543#true} #83#return; {1543#true} is VALID [2022-04-27 11:13:20,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {1543#true} call #t~ret15 := main(); {1543#true} is VALID [2022-04-27 11:13:20,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {1543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1548#(= main_~y~0 0)} is VALID [2022-04-27 11:13:20,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {1548#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:20,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {1549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:20,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {1549#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1581#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:20,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {1581#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1585#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:20,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1585#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:20,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1592#(and (<= main_~z~0 1) (= main_~z~0 (+ main_~y~0 1)) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:20,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {1592#(and (<= main_~z~0 1) (= main_~z~0 (+ main_~y~0 1)) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1592#(and (<= main_~z~0 1) (= main_~z~0 (+ main_~y~0 1)) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:20,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {1592#(and (<= main_~z~0 1) (= main_~z~0 (+ main_~y~0 1)) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1550#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:20,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {1550#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1550#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:20,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {1550#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1544#false} is VALID [2022-04-27 11:13:20,862 INFO L272 TraceCheckUtils]: 16: Hoare triple {1544#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1544#false} is VALID [2022-04-27 11:13:20,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {1544#false} ~cond := #in~cond; {1544#false} is VALID [2022-04-27 11:13:20,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {1544#false} assume 0 == ~cond; {1544#false} is VALID [2022-04-27 11:13:20,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#false} assume !false; {1544#false} is VALID [2022-04-27 11:13:20,863 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-27 11:13:20,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:20,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#false} assume !false; {1544#false} is VALID [2022-04-27 11:13:20,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {1544#false} assume 0 == ~cond; {1544#false} is VALID [2022-04-27 11:13:20,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {1544#false} ~cond := #in~cond; {1544#false} is VALID [2022-04-27 11:13:20,927 INFO L272 TraceCheckUtils]: 16: Hoare triple {1544#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1544#false} is VALID [2022-04-27 11:13:20,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {1629#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1544#false} is VALID [2022-04-27 11:13:20,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {1629#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1629#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:20,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {1629#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1629#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:20,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {1629#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1629#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:20,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {1642#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1629#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:20,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {1642#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1642#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-27 11:13:20,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {1543#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1642#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-27 11:13:20,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {1543#true} ~z~0 := ~y~0; {1543#true} is VALID [2022-04-27 11:13:20,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {1543#true} assume !(~x~0 % 4294967296 > 0); {1543#true} is VALID [2022-04-27 11:13:20,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {1543#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1543#true} is VALID [2022-04-27 11:13:20,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {1543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1543#true} is VALID [2022-04-27 11:13:20,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {1543#true} call #t~ret15 := main(); {1543#true} is VALID [2022-04-27 11:13:20,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1543#true} {1543#true} #83#return; {1543#true} is VALID [2022-04-27 11:13:20,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {1543#true} assume true; {1543#true} is VALID [2022-04-27 11:13:20,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {1543#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1543#true} is VALID [2022-04-27 11:13:20,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {1543#true} call ULTIMATE.init(); {1543#true} is VALID [2022-04-27 11:13:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:20,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055763334] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:20,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:20,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 4] total 13 [2022-04-27 11:13:20,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368720828] [2022-04-27 11:13:20,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:20,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:13:20,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:20,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:20,958 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-27 11:13:20,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:13:20,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:20,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:13:20,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:13:20,959 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:21,323 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-04-27 11:13:21,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:13:21,323 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:13:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-04-27 11:13:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-04-27 11:13:21,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 68 transitions. [2022-04-27 11:13:21,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:21,370 INFO L225 Difference]: With dead ends: 63 [2022-04-27 11:13:21,370 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 11:13:21,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:13:21,371 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:21,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 11:13:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-04-27 11:13:21,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:21,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:21,425 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:21,425 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:21,426 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 11:13:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-04-27 11:13:21,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:21,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:21,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-27 11:13:21,427 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-27 11:13:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:21,428 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 11:13:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-04-27 11:13:21,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:21,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:21,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:21,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-04-27 11:13:21,430 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 20 [2022-04-27 11:13:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:21,430 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-04-27 11:13:21,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-04-27 11:13:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:13:21,430 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:21,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:21,465 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-27 11:13:21,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:21,635 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-27 11:13:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:21,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981399193] [2022-04-27 11:13:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:21,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:21,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {1943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1933#true} is VALID [2022-04-27 11:13:21,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {1933#true} assume true; {1933#true} is VALID [2022-04-27 11:13:21,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1933#true} {1933#true} #83#return; {1933#true} is VALID [2022-04-27 11:13:21,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {1933#true} call ULTIMATE.init(); {1943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:21,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1933#true} is VALID [2022-04-27 11:13:21,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#true} assume true; {1933#true} is VALID [2022-04-27 11:13:21,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#true} {1933#true} #83#return; {1933#true} is VALID [2022-04-27 11:13:21,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#true} call #t~ret15 := main(); {1933#true} is VALID [2022-04-27 11:13:21,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1938#(= main_~y~0 0)} is VALID [2022-04-27 11:13:21,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {1938#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1938#(= main_~y~0 0)} is VALID [2022-04-27 11:13:21,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {1938#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {1938#(= main_~y~0 0)} is VALID [2022-04-27 11:13:21,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {1938#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1940#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:13:21,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {1940#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {1940#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:13:21,723 INFO L272 TraceCheckUtils]: 17: Hoare triple {1940#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1941#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:21,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {1941#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1942#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:21,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {1942#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1934#false} is VALID [2022-04-27 11:13:21,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {1934#false} assume !false; {1934#false} is VALID [2022-04-27 11:13:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:21,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:21,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981399193] [2022-04-27 11:13:21,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981399193] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:21,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072242339] [2022-04-27 11:13:21,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:21,726 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-27 11:13:21,727 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-27 11:13:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:21,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:13:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:21,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:21,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {1933#true} call ULTIMATE.init(); {1933#true} is VALID [2022-04-27 11:13:21,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {1933#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1933#true} is VALID [2022-04-27 11:13:21,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#true} assume true; {1933#true} is VALID [2022-04-27 11:13:21,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#true} {1933#true} #83#return; {1933#true} is VALID [2022-04-27 11:13:21,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#true} call #t~ret15 := main(); {1933#true} is VALID [2022-04-27 11:13:21,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1938#(= main_~y~0 0)} is VALID [2022-04-27 11:13:21,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {1938#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1938#(= main_~y~0 0)} is VALID [2022-04-27 11:13:21,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {1938#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {1938#(= main_~y~0 0)} is VALID [2022-04-27 11:13:21,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {1938#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:21,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {1939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1938#(= main_~y~0 0)} is VALID [2022-04-27 11:13:21,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {1938#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {1938#(= main_~y~0 0)} is VALID [2022-04-27 11:13:21,886 INFO L272 TraceCheckUtils]: 17: Hoare triple {1938#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1998#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:21,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {1998#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2002#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:21,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {2002#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1934#false} is VALID [2022-04-27 11:13:21,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {1934#false} assume !false; {1934#false} is VALID [2022-04-27 11:13:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:21,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:21,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {1934#false} assume !false; {1934#false} is VALID [2022-04-27 11:13:21,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {2002#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1934#false} is VALID [2022-04-27 11:13:21,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {1998#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2002#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:21,980 INFO L272 TraceCheckUtils]: 17: Hoare triple {2018#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1998#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:21,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {2018#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {2018#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:13:21,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {2025#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2018#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:13:21,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {2025#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {2025#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-27 11:13:21,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {2018#(= (mod main_~y~0 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2025#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-27 11:13:21,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#true} assume !(~y~0 % 4294967296 > 0); {2018#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:13:21,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {1933#true} assume !(~z~0 % 4294967296 > 0); {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#true} ~z~0 := ~y~0; {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#true} assume !(~x~0 % 4294967296 > 0); {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {1933#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#true} call #t~ret15 := main(); {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#true} {1933#true} #83#return; {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#true} assume true; {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {1933#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1933#true} is VALID [2022-04-27 11:13:21,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {1933#true} call ULTIMATE.init(); {1933#true} is VALID [2022-04-27 11:13:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:21,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072242339] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:21,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:21,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-04-27 11:13:21,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662912719] [2022-04-27 11:13:21,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:21,984 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:13:21,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:21,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,009 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-27 11:13:22,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:13:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:13:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:13:22,010 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:22,386 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-27 11:13:22,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:13:22,386 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:13:22,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-27 11:13:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-27 11:13:22,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-27 11:13:22,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:22,424 INFO L225 Difference]: With dead ends: 57 [2022-04-27 11:13:22,424 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 11:13:22,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:13:22,425 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:22,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 59 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 11:13:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-04-27 11:13:22,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:22,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,444 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,444 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:22,445 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-27 11:13:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-27 11:13:22,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:22,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:22,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-27 11:13:22,446 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-27 11:13:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:22,447 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-27 11:13:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-27 11:13:22,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:22,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:22,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:22,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2022-04-27 11:13:22,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 21 [2022-04-27 11:13:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:22,448 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-04-27 11:13:22,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-04-27 11:13:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:13:22,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:22,449 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:22,465 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-27 11:13:22,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 11:13:22,665 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:22,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 2 times [2022-04-27 11:13:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:22,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772186589] [2022-04-27 11:13:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:22,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:22,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {2327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2320#true} is VALID [2022-04-27 11:13:22,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {2320#true} assume true; {2320#true} is VALID [2022-04-27 11:13:22,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2320#true} {2320#true} #83#return; {2320#true} is VALID [2022-04-27 11:13:22,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {2320#true} call ULTIMATE.init(); {2327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:22,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {2327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2320#true} is VALID [2022-04-27 11:13:22,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {2320#true} assume true; {2320#true} is VALID [2022-04-27 11:13:22,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2320#true} {2320#true} #83#return; {2320#true} is VALID [2022-04-27 11:13:22,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {2320#true} call #t~ret15 := main(); {2320#true} is VALID [2022-04-27 11:13:22,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {2320#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2320#true} is VALID [2022-04-27 11:13:22,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {2320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2320#true} is VALID [2022-04-27 11:13:22,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {2320#true} assume !(~x~0 % 4294967296 > 0); {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:22,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:22,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= 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; {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:22,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:22,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:22,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:22,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:22,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2321#false} is VALID [2022-04-27 11:13:22,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {2321#false} assume !(~x~0 % 4294967296 > 0); {2321#false} is VALID [2022-04-27 11:13:22,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {2321#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2321#false} is VALID [2022-04-27 11:13:22,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {2321#false} assume !(~z~0 % 4294967296 > 0); {2321#false} is VALID [2022-04-27 11:13:22,725 INFO L272 TraceCheckUtils]: 18: Hoare triple {2321#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2321#false} is VALID [2022-04-27 11:13:22,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {2321#false} ~cond := #in~cond; {2321#false} is VALID [2022-04-27 11:13:22,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {2321#false} assume 0 == ~cond; {2321#false} is VALID [2022-04-27 11:13:22,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {2321#false} assume !false; {2321#false} is VALID [2022-04-27 11:13:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:22,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772186589] [2022-04-27 11:13:22,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772186589] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:22,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528026582] [2022-04-27 11:13:22,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:22,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:22,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:22,727 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-27 11:13:22,728 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-27 11:13:22,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:22,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:22,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 11:13:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:22,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:22,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {2320#true} call ULTIMATE.init(); {2320#true} is VALID [2022-04-27 11:13:22,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {2320#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2320#true} is VALID [2022-04-27 11:13:22,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {2320#true} assume true; {2320#true} is VALID [2022-04-27 11:13:22,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2320#true} {2320#true} #83#return; {2320#true} is VALID [2022-04-27 11:13:22,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {2320#true} call #t~ret15 := main(); {2320#true} is VALID [2022-04-27 11:13:22,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {2320#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2320#true} is VALID [2022-04-27 11:13:22,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {2320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2320#true} is VALID [2022-04-27 11:13:22,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {2320#true} assume !(~x~0 % 4294967296 > 0); {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:22,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:22,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= 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; {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:22,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:22,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:22,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:22,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:22,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2321#false} is VALID [2022-04-27 11:13:22,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {2321#false} assume !(~x~0 % 4294967296 > 0); {2321#false} is VALID [2022-04-27 11:13:22,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {2321#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2321#false} is VALID [2022-04-27 11:13:22,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {2321#false} assume !(~z~0 % 4294967296 > 0); {2321#false} is VALID [2022-04-27 11:13:22,996 INFO L272 TraceCheckUtils]: 18: Hoare triple {2321#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2321#false} is VALID [2022-04-27 11:13:22,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {2321#false} ~cond := #in~cond; {2321#false} is VALID [2022-04-27 11:13:22,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {2321#false} assume 0 == ~cond; {2321#false} is VALID [2022-04-27 11:13:22,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {2321#false} assume !false; {2321#false} is VALID [2022-04-27 11:13:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:22,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:23,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {2321#false} assume !false; {2321#false} is VALID [2022-04-27 11:13:23,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {2321#false} assume 0 == ~cond; {2321#false} is VALID [2022-04-27 11:13:23,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {2321#false} ~cond := #in~cond; {2321#false} is VALID [2022-04-27 11:13:23,176 INFO L272 TraceCheckUtils]: 18: Hoare triple {2321#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2321#false} is VALID [2022-04-27 11:13:23,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {2321#false} assume !(~z~0 % 4294967296 > 0); {2321#false} is VALID [2022-04-27 11:13:23,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {2321#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2321#false} is VALID [2022-04-27 11:13:23,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {2321#false} assume !(~x~0 % 4294967296 > 0); {2321#false} is VALID [2022-04-27 11:13:23,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2321#false} is VALID [2022-04-27 11:13:23,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:23,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:23,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:23,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:23,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= 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; {2326#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:23,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:23,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {2320#true} assume !(~x~0 % 4294967296 > 0); {2325#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:23,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {2320#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2320#true} is VALID [2022-04-27 11:13:23,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {2320#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2320#true} is VALID [2022-04-27 11:13:23,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {2320#true} call #t~ret15 := main(); {2320#true} is VALID [2022-04-27 11:13:23,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2320#true} {2320#true} #83#return; {2320#true} is VALID [2022-04-27 11:13:23,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {2320#true} assume true; {2320#true} is VALID [2022-04-27 11:13:23,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {2320#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2320#true} is VALID [2022-04-27 11:13:23,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {2320#true} call ULTIMATE.init(); {2320#true} is VALID [2022-04-27 11:13:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:23,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528026582] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:23,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:23,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-27 11:13:23,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099879387] [2022-04-27 11:13:23,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:23,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:13:23,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:23,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,197 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-27 11:13:23,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:13:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:13:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:23,198 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:23,305 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-27 11:13:23,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:13:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:13:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 11:13:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 11:13:23,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-27 11:13:23,333 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-27 11:13:23,334 INFO L225 Difference]: With dead ends: 57 [2022-04-27 11:13:23,334 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 11:13:23,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:13:23,335 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:23,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 30 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:23,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 11:13:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 11:13:23,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:23,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,349 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,349 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:23,350 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-04-27 11:13:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2022-04-27 11:13:23,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:23,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:23,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states 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-27 11:13:23,351 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states 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-27 11:13:23,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:23,351 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-04-27 11:13:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2022-04-27 11:13:23,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:23,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:23,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:23,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-27 11:13:23,352 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 22 [2022-04-27 11:13:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:23,353 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2022-04-27 11:13:23,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2022-04-27 11:13:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:13:23,353 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:23,353 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:23,371 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-27 11:13:23,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:23,567 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:23,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:23,568 INFO L85 PathProgramCache]: Analyzing trace with hash 38994402, now seen corresponding path program 2 times [2022-04-27 11:13:23,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:23,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720887517] [2022-04-27 11:13:23,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:23,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:23,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {2672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2662#true} is VALID [2022-04-27 11:13:23,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {2662#true} assume true; {2662#true} is VALID [2022-04-27 11:13:23,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2662#true} {2662#true} #83#return; {2662#true} is VALID [2022-04-27 11:13:23,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {2662#true} call ULTIMATE.init(); {2672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:23,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2662#true} is VALID [2022-04-27 11:13:23,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {2662#true} assume true; {2662#true} is VALID [2022-04-27 11:13:23,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2662#true} {2662#true} #83#return; {2662#true} is VALID [2022-04-27 11:13:23,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {2662#true} call #t~ret15 := main(); {2662#true} is VALID [2022-04-27 11:13:23,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {2662#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2667#(= main_~y~0 0)} is VALID [2022-04-27 11:13:23,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {2667#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2668#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:23,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {2668#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2669#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:23,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {2669#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2669#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:23,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {2669#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2670#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:23,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {2670#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2671#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:23,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {2671#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2663#false} is VALID [2022-04-27 11:13:23,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {2663#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2663#false} is VALID [2022-04-27 11:13:23,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {2663#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2663#false} is VALID [2022-04-27 11:13:23,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {2663#false} assume !(~y~0 % 4294967296 > 0); {2663#false} is VALID [2022-04-27 11:13:23,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {2663#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2663#false} is VALID [2022-04-27 11:13:23,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {2663#false} assume !(~x~0 % 4294967296 > 0); {2663#false} is VALID [2022-04-27 11:13:23,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {2663#false} assume !(~z~0 % 4294967296 > 0); {2663#false} is VALID [2022-04-27 11:13:23,645 INFO L272 TraceCheckUtils]: 18: Hoare triple {2663#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2663#false} is VALID [2022-04-27 11:13:23,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {2663#false} ~cond := #in~cond; {2663#false} is VALID [2022-04-27 11:13:23,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {2663#false} assume 0 == ~cond; {2663#false} is VALID [2022-04-27 11:13:23,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {2663#false} assume !false; {2663#false} is VALID [2022-04-27 11:13:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:13:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:23,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720887517] [2022-04-27 11:13:23,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720887517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:23,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296498065] [2022-04-27 11:13:23,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:23,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:23,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:23,646 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-27 11:13:23,647 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-27 11:13:23,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:23,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:23,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:13:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:23,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:23,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {2662#true} call ULTIMATE.init(); {2662#true} is VALID [2022-04-27 11:13:23,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {2662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2662#true} is VALID [2022-04-27 11:13:23,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {2662#true} assume true; {2662#true} is VALID [2022-04-27 11:13:23,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2662#true} {2662#true} #83#return; {2662#true} is VALID [2022-04-27 11:13:23,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {2662#true} call #t~ret15 := main(); {2662#true} is VALID [2022-04-27 11:13:23,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {2662#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2667#(= main_~y~0 0)} is VALID [2022-04-27 11:13:23,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {2667#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2668#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:23,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {2668#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2669#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:23,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {2669#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2669#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:23,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {2669#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2703#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:23,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {2703#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2707#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:13:23,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {2707#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {2663#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {2663#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {2663#false} assume !(~y~0 % 4294967296 > 0); {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {2663#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {2663#false} assume !(~x~0 % 4294967296 > 0); {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {2663#false} assume !(~z~0 % 4294967296 > 0); {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L272 TraceCheckUtils]: 18: Hoare triple {2663#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {2663#false} ~cond := #in~cond; {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {2663#false} assume 0 == ~cond; {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {2663#false} assume !false; {2663#false} is VALID [2022-04-27 11:13:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:13:23,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:23,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {2663#false} assume !false; {2663#false} is VALID [2022-04-27 11:13:23,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {2744#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2663#false} is VALID [2022-04-27 11:13:23,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {2748#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2744#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:23,991 INFO L272 TraceCheckUtils]: 18: Hoare triple {2752#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2748#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:23,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {2752#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {2752#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:13:23,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {2752#(= (mod main_~y~0 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {2752#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:13:23,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {2762#(= (mod (+ main_~y~0 1) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2752#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:13:23,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {2762#(= (mod (+ main_~y~0 1) 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {2762#(= (mod (+ main_~y~0 1) 4294967296) 0)} is VALID [2022-04-27 11:13:23,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {2752#(= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2762#(= (mod (+ main_~y~0 1) 4294967296) 0)} is VALID [2022-04-27 11:13:23,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {2772#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2752#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:13:23,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {2776#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2772#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-27 11:13:23,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {2780#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2776#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:13:23,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {2662#true} ~z~0 := ~y~0; {2780#(or (= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:13:23,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {2662#true} assume !(~x~0 % 4294967296 > 0); {2662#true} is VALID [2022-04-27 11:13:23,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {2662#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2662#true} is VALID [2022-04-27 11:13:23,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {2662#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2662#true} is VALID [2022-04-27 11:13:23,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {2662#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2662#true} is VALID [2022-04-27 11:13:23,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {2662#true} call #t~ret15 := main(); {2662#true} is VALID [2022-04-27 11:13:23,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2662#true} {2662#true} #83#return; {2662#true} is VALID [2022-04-27 11:13:23,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {2662#true} assume true; {2662#true} is VALID [2022-04-27 11:13:23,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {2662#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2662#true} is VALID [2022-04-27 11:13:23,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {2662#true} call ULTIMATE.init(); {2662#true} is VALID [2022-04-27 11:13:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:23,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296498065] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:23,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:23,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2022-04-27 11:13:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472005010] [2022-04-27 11:13:23,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:23,998 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:13:23,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:23,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,026 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-27 11:13:24,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 11:13:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:24,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 11:13:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:13:24,028 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:24,878 INFO L93 Difference]: Finished difference Result 87 states and 126 transitions. [2022-04-27 11:13:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 11:13:24,878 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:13:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 85 transitions. [2022-04-27 11:13:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 85 transitions. [2022-04-27 11:13:24,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 85 transitions. [2022-04-27 11:13:24,961 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-27 11:13:24,962 INFO L225 Difference]: With dead ends: 87 [2022-04-27 11:13:24,962 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 11:13:24,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:13:24,963 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:24,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 64 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:13:24,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 11:13:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2022-04-27 11:13:24,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:24,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 49 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,994 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 49 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,995 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 49 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:24,996 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2022-04-27 11:13:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2022-04-27 11:13:24,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:24,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:24,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 3 states have call successors, (3), 3 states 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-27 11:13:24,997 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 3 states have call successors, (3), 3 states 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-27 11:13:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:25,000 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2022-04-27 11:13:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2022-04-27 11:13:25,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:25,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:25,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:25,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2022-04-27 11:13:25,001 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 22 [2022-04-27 11:13:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:25,001 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 68 transitions. [2022-04-27 11:13:25,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,001 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2022-04-27 11:13:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:13:25,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:25,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:25,022 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-27 11:13:25,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:25,221 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1409588607, now seen corresponding path program 2 times [2022-04-27 11:13:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:25,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680861213] [2022-04-27 11:13:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:25,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:25,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {3158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3146#true} is VALID [2022-04-27 11:13:25,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {3146#true} assume true; {3146#true} is VALID [2022-04-27 11:13:25,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3146#true} {3146#true} #83#return; {3146#true} is VALID [2022-04-27 11:13:25,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {3146#true} call ULTIMATE.init(); {3158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:25,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {3158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3146#true} is VALID [2022-04-27 11:13:25,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {3146#true} assume true; {3146#true} is VALID [2022-04-27 11:13:25,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3146#true} {3146#true} #83#return; {3146#true} is VALID [2022-04-27 11:13:25,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {3146#true} call #t~ret15 := main(); {3146#true} is VALID [2022-04-27 11:13:25,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {3146#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3151#(= main_~y~0 0)} is VALID [2022-04-27 11:13:25,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {3151#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3152#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:25,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {3152#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3153#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:25,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {3153#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3153#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:25,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {3153#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3154#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:25,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {3154#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3155#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:25,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {3155#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3156#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:25,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {3156#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3156#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:25,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {3156#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3155#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:25,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {3155#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3154#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:25,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {3154#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {3154#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:25,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {3154#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {3154#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:25,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {3154#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3157#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:25,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {3157#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3147#false} is VALID [2022-04-27 11:13:25,357 INFO L272 TraceCheckUtils]: 19: Hoare triple {3147#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3147#false} is VALID [2022-04-27 11:13:25,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {3147#false} ~cond := #in~cond; {3147#false} is VALID [2022-04-27 11:13:25,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {3147#false} assume 0 == ~cond; {3147#false} is VALID [2022-04-27 11:13:25,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {3147#false} assume !false; {3147#false} is VALID [2022-04-27 11:13:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:25,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:25,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680861213] [2022-04-27 11:13:25,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680861213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:25,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042132341] [2022-04-27 11:13:25,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:25,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:25,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:25,359 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-27 11:13:25,360 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-27 11:13:25,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:25,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:25,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:13:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:25,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:25,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {3146#true} call ULTIMATE.init(); {3146#true} is VALID [2022-04-27 11:13:25,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {3146#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3146#true} is VALID [2022-04-27 11:13:25,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {3146#true} assume true; {3146#true} is VALID [2022-04-27 11:13:25,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3146#true} {3146#true} #83#return; {3146#true} is VALID [2022-04-27 11:13:25,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {3146#true} call #t~ret15 := main(); {3146#true} is VALID [2022-04-27 11:13:25,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {3146#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3146#true} is VALID [2022-04-27 11:13:25,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {3146#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3180#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:25,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:25,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:25,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:25,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3180#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:25,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3197#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:25,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {3197#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3197#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:25,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {3197#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3197#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:25,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {3197#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3197#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:25,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {3197#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3197#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:25,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {3197#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3147#false} is VALID [2022-04-27 11:13:25,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {3147#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3147#false} is VALID [2022-04-27 11:13:25,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {3147#false} assume !(~z~0 % 4294967296 > 0); {3147#false} is VALID [2022-04-27 11:13:25,512 INFO L272 TraceCheckUtils]: 19: Hoare triple {3147#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3147#false} is VALID [2022-04-27 11:13:25,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {3147#false} ~cond := #in~cond; {3147#false} is VALID [2022-04-27 11:13:25,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {3147#false} assume 0 == ~cond; {3147#false} is VALID [2022-04-27 11:13:25,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {3147#false} assume !false; {3147#false} is VALID [2022-04-27 11:13:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:13:25,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:25,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {3147#false} assume !false; {3147#false} is VALID [2022-04-27 11:13:25,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {3147#false} assume 0 == ~cond; {3147#false} is VALID [2022-04-27 11:13:25,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {3147#false} ~cond := #in~cond; {3147#false} is VALID [2022-04-27 11:13:25,579 INFO L272 TraceCheckUtils]: 19: Hoare triple {3147#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3147#false} is VALID [2022-04-27 11:13:25,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {3147#false} assume !(~z~0 % 4294967296 > 0); {3147#false} is VALID [2022-04-27 11:13:25,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {3147#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3147#false} is VALID [2022-04-27 11:13:25,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {3197#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3147#false} is VALID [2022-04-27 11:13:25,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {3197#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3197#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:25,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {3197#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3197#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:25,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {3197#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3197#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:25,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {3197#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3197#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:25,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3197#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:25,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3180#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:25,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:25,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:25,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3184#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:25,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {3146#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3180#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:25,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {3146#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3146#true} is VALID [2022-04-27 11:13:25,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {3146#true} call #t~ret15 := main(); {3146#true} is VALID [2022-04-27 11:13:25,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3146#true} {3146#true} #83#return; {3146#true} is VALID [2022-04-27 11:13:25,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {3146#true} assume true; {3146#true} is VALID [2022-04-27 11:13:25,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {3146#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3146#true} is VALID [2022-04-27 11:13:25,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {3146#true} call ULTIMATE.init(); {3146#true} is VALID [2022-04-27 11:13:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:13:25,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042132341] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:25,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:25,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-27 11:13:25,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584268319] [2022-04-27 11:13:25,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:25,588 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:13:25,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:25,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:25,611 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-27 11:13:25,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:13:25,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:25,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:13:25,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:13:25,612 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:26,578 INFO L93 Difference]: Finished difference Result 80 states and 116 transitions. [2022-04-27 11:13:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 11:13:26,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:13:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 84 transitions. [2022-04-27 11:13:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 84 transitions. [2022-04-27 11:13:26,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 84 transitions. [2022-04-27 11:13:26,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:26,655 INFO L225 Difference]: With dead ends: 80 [2022-04-27 11:13:26,655 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 11:13:26,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:13:26,656 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:26,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 68 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:13:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 11:13:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-04-27 11:13:26,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:26,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,698 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,698 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:26,699 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-27 11:13:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-27 11:13:26,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:26,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:26,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-27 11:13:26,699 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-27 11:13:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:26,700 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-27 11:13:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-27 11:13:26,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:26,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:26,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:26,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-04-27 11:13:26,701 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 23 [2022-04-27 11:13:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:26,702 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-04-27 11:13:26,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-27 11:13:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:13:26,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:26,702 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:26,719 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-27 11:13:26,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 11:13:26,919 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:26,919 INFO L85 PathProgramCache]: Analyzing trace with hash 731459730, now seen corresponding path program 3 times [2022-04-27 11:13:26,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:26,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346588721] [2022-04-27 11:13:26,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:26,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:27,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:27,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {3643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3632#true} is VALID [2022-04-27 11:13:27,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 11:13:27,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3632#true} {3632#true} #83#return; {3632#true} is VALID [2022-04-27 11:13:27,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {3632#true} call ULTIMATE.init(); {3643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:27,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {3643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3632#true} is VALID [2022-04-27 11:13:27,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 11:13:27,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3632#true} {3632#true} #83#return; {3632#true} is VALID [2022-04-27 11:13:27,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {3632#true} call #t~ret15 := main(); {3632#true} is VALID [2022-04-27 11:13:27,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {3632#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3637#(= main_~y~0 0)} is VALID [2022-04-27 11:13:27,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {3637#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3638#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:27,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {3638#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3639#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:27,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {3639#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3640#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:27,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {3640#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3640#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:27,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {3640#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3641#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:13:27,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {3641#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3642#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {3642#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {3633#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {3633#false} assume !(~y~0 % 4294967296 > 0); {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {3633#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {3633#false} assume !(~x~0 % 4294967296 > 0); {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {3633#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {3633#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {3633#false} assume !(~z~0 % 4294967296 > 0); {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L272 TraceCheckUtils]: 20: Hoare triple {3633#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {3633#false} ~cond := #in~cond; {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {3633#false} assume 0 == ~cond; {3633#false} is VALID [2022-04-27 11:13:27,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {3633#false} assume !false; {3633#false} is VALID [2022-04-27 11:13:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 11:13:27,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:27,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346588721] [2022-04-27 11:13:27,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346588721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:27,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200088909] [2022-04-27 11:13:27,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:27,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:27,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:27,031 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-27 11:13:27,032 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-27 11:13:27,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:13:27,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:27,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:13:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:27,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:27,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {3632#true} call ULTIMATE.init(); {3632#true} is VALID [2022-04-27 11:13:27,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {3632#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3632#true} is VALID [2022-04-27 11:13:27,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 11:13:27,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3632#true} {3632#true} #83#return; {3632#true} is VALID [2022-04-27 11:13:27,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {3632#true} call #t~ret15 := main(); {3632#true} is VALID [2022-04-27 11:13:27,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {3632#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3632#true} is VALID [2022-04-27 11:13:27,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {3632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3632#true} is VALID [2022-04-27 11:13:27,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {3632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3632#true} is VALID [2022-04-27 11:13:27,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {3632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3632#true} is VALID [2022-04-27 11:13:27,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#true} assume !(~x~0 % 4294967296 > 0); {3632#true} is VALID [2022-04-27 11:13:27,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {3632#true} ~z~0 := ~y~0; {3677#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:13:27,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {3677#(= 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; {3681#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-27 11:13:27,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {3681#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {3681#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-27 11:13:27,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {3681#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3688#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-27 11:13:27,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {3688#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {3688#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-27 11:13:27,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {3688#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3677#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:13:27,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {3677#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {3677#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:13:27,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {3677#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3677#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:13:27,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {3677#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3677#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:13:27,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {3677#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {3707#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:13:27,290 INFO L272 TraceCheckUtils]: 20: Hoare triple {3707#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3711#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:27,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {3711#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3715#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:27,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {3715#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3633#false} is VALID [2022-04-27 11:13:27,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {3633#false} assume !false; {3633#false} is VALID [2022-04-27 11:13:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:13:27,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:27,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {3633#false} assume !false; {3633#false} is VALID [2022-04-27 11:13:27,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {3715#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3633#false} is VALID [2022-04-27 11:13:27,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {3711#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3715#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:27,532 INFO L272 TraceCheckUtils]: 20: Hoare triple {3707#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3711#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:27,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {3734#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3707#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:13:27,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {3738#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3734#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:13:27,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {3742#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3738#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:13:27,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {3742#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3742#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:13:27,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {3749#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3742#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:13:27,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {3749#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3749#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:13:27,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {3756#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3749#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:13:27,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {3756#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3756#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:13:27,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {3742#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3756#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:13:27,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {3632#true} ~z~0 := ~y~0; {3742#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:13:27,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#true} assume !(~x~0 % 4294967296 > 0); {3632#true} is VALID [2022-04-27 11:13:27,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {3632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3632#true} is VALID [2022-04-27 11:13:27,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {3632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3632#true} is VALID [2022-04-27 11:13:27,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {3632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3632#true} is VALID [2022-04-27 11:13:27,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {3632#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3632#true} is VALID [2022-04-27 11:13:27,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {3632#true} call #t~ret15 := main(); {3632#true} is VALID [2022-04-27 11:13:27,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3632#true} {3632#true} #83#return; {3632#true} is VALID [2022-04-27 11:13:27,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-27 11:13:27,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {3632#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3632#true} is VALID [2022-04-27 11:13:27,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {3632#true} call ULTIMATE.init(); {3632#true} is VALID [2022-04-27 11:13:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:27,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200088909] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:27,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:27,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 20 [2022-04-27 11:13:27,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506445308] [2022-04-27 11:13:27,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:27,539 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 11:13:27,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:27,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:27,571 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-27 11:13:27,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 11:13:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:27,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 11:13:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:13:27,572 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:30,079 INFO L93 Difference]: Finished difference Result 133 states and 188 transitions. [2022-04-27 11:13:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 11:13:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 11:13:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 130 transitions. [2022-04-27 11:13:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 130 transitions. [2022-04-27 11:13:30,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 130 transitions. [2022-04-27 11:13:30,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:30,203 INFO L225 Difference]: With dead ends: 133 [2022-04-27 11:13:30,203 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 11:13:30,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=518, Invalid=3022, Unknown=0, NotChecked=0, Total=3540 [2022-04-27 11:13:30,204 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 73 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:30,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 91 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 11:13:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 11:13:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-04-27 11:13:30,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:30,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:30,264 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:30,265 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:30,266 INFO L93 Difference]: Finished difference Result 94 states and 128 transitions. [2022-04-27 11:13:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2022-04-27 11:13:30,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:30,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:30,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-27 11:13:30,267 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-27 11:13:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:30,268 INFO L93 Difference]: Finished difference Result 94 states and 128 transitions. [2022-04-27 11:13:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2022-04-27 11:13:30,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:30,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:30,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:30,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2022-04-27 11:13:30,269 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 24 [2022-04-27 11:13:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:30,269 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2022-04-27 11:13:30,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-04-27 11:13:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:13:30,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:30,270 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:30,291 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-27 11:13:30,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 11:13:30,487 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:30,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1097749168, now seen corresponding path program 4 times [2022-04-27 11:13:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:30,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384908088] [2022-04-27 11:13:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:30,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:30,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {4341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4333#true} is VALID [2022-04-27 11:13:30,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {4333#true} assume true; {4333#true} is VALID [2022-04-27 11:13:30,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4333#true} {4333#true} #83#return; {4333#true} is VALID [2022-04-27 11:13:30,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {4333#true} call ULTIMATE.init(); {4341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:30,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {4341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4333#true} is VALID [2022-04-27 11:13:30,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {4333#true} assume true; {4333#true} is VALID [2022-04-27 11:13:30,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4333#true} {4333#true} #83#return; {4333#true} is VALID [2022-04-27 11:13:30,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {4333#true} call #t~ret15 := main(); {4333#true} is VALID [2022-04-27 11:13:30,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {4333#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4333#true} is VALID [2022-04-27 11:13:30,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {4333#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4333#true} is VALID [2022-04-27 11:13:30,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {4333#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:30,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:30,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:30,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4334#false} is VALID [2022-04-27 11:13:30,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {4334#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4334#false} is VALID [2022-04-27 11:13:30,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {4334#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4334#false} is VALID [2022-04-27 11:13:30,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#false} assume !(~z~0 % 4294967296 > 0); {4334#false} is VALID [2022-04-27 11:13:30,559 INFO L272 TraceCheckUtils]: 21: Hoare triple {4334#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4334#false} is VALID [2022-04-27 11:13:30,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {4334#false} ~cond := #in~cond; {4334#false} is VALID [2022-04-27 11:13:30,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {4334#false} assume 0 == ~cond; {4334#false} is VALID [2022-04-27 11:13:30,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2022-04-27 11:13:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:13:30,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:30,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384908088] [2022-04-27 11:13:30,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384908088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:30,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765977891] [2022-04-27 11:13:30,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:13:30,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:30,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:30,561 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-27 11:13:30,571 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-27 11:13:30,596 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:13:30,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:30,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:13:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:30,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:30,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {4333#true} call ULTIMATE.init(); {4333#true} is VALID [2022-04-27 11:13:30,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {4333#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4333#true} is VALID [2022-04-27 11:13:30,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {4333#true} assume true; {4333#true} is VALID [2022-04-27 11:13:30,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4333#true} {4333#true} #83#return; {4333#true} is VALID [2022-04-27 11:13:30,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {4333#true} call #t~ret15 := main(); {4333#true} is VALID [2022-04-27 11:13:30,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {4333#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4333#true} is VALID [2022-04-27 11:13:30,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {4333#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4333#true} is VALID [2022-04-27 11:13:30,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {4333#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:30,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:30,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:30,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4334#false} is VALID [2022-04-27 11:13:30,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {4334#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4334#false} is VALID [2022-04-27 11:13:30,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {4334#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4334#false} is VALID [2022-04-27 11:13:30,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#false} assume !(~z~0 % 4294967296 > 0); {4334#false} is VALID [2022-04-27 11:13:30,876 INFO L272 TraceCheckUtils]: 21: Hoare triple {4334#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4334#false} is VALID [2022-04-27 11:13:30,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {4334#false} ~cond := #in~cond; {4334#false} is VALID [2022-04-27 11:13:30,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {4334#false} assume 0 == ~cond; {4334#false} is VALID [2022-04-27 11:13:30,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2022-04-27 11:13:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:13:30,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:30,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {4334#false} assume !false; {4334#false} is VALID [2022-04-27 11:13:30,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {4334#false} assume 0 == ~cond; {4334#false} is VALID [2022-04-27 11:13:30,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {4334#false} ~cond := #in~cond; {4334#false} is VALID [2022-04-27 11:13:30,959 INFO L272 TraceCheckUtils]: 21: Hoare triple {4334#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4334#false} is VALID [2022-04-27 11:13:30,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#false} assume !(~z~0 % 4294967296 > 0); {4334#false} is VALID [2022-04-27 11:13:30,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {4334#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4334#false} is VALID [2022-04-27 11:13:30,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {4334#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4334#false} is VALID [2022-04-27 11:13:30,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4334#false} is VALID [2022-04-27 11:13:30,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4340#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4339#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:30,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:30,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:30,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {4333#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4338#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:30,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {4333#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4333#true} is VALID [2022-04-27 11:13:30,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {4333#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4333#true} is VALID [2022-04-27 11:13:30,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {4333#true} call #t~ret15 := main(); {4333#true} is VALID [2022-04-27 11:13:30,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4333#true} {4333#true} #83#return; {4333#true} is VALID [2022-04-27 11:13:30,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {4333#true} assume true; {4333#true} is VALID [2022-04-27 11:13:30,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {4333#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4333#true} is VALID [2022-04-27 11:13:30,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {4333#true} call ULTIMATE.init(); {4333#true} is VALID [2022-04-27 11:13:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:13:30,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765977891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:30,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:30,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-27 11:13:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861962463] [2022-04-27 11:13:30,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:30,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:13:30,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:30,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:30,982 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-27 11:13:30,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:13:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:30,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:13:30,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:13:30,982 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:31,192 INFO L93 Difference]: Finished difference Result 88 states and 118 transitions. [2022-04-27 11:13:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:13:31,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:13:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 11:13:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 11:13:31,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 11:13:31,234 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-27 11:13:31,235 INFO L225 Difference]: With dead ends: 88 [2022-04-27 11:13:31,235 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 11:13:31,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:13:31,236 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:31,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 11:13:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-27 11:13:31,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:31,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:31,300 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:31,300 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:31,301 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-04-27 11:13:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2022-04-27 11:13:31,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:31,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:31,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-27 11:13:31,301 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-27 11:13:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:31,302 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-04-27 11:13:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2022-04-27 11:13:31,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:31,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:31,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:31,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions. [2022-04-27 11:13:31,304 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 25 [2022-04-27 11:13:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:31,304 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions. [2022-04-27 11:13:31,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2022-04-27 11:13:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:13:31,304 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:31,304 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:31,320 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-27 11:13:31,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 11:13:31,520 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:31,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1022340144, now seen corresponding path program 3 times [2022-04-27 11:13:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:31,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433321281] [2022-04-27 11:13:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:31,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:31,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:31,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {4879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4865#true} is VALID [2022-04-27 11:13:31,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {4865#true} assume true; {4865#true} is VALID [2022-04-27 11:13:31,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4865#true} {4865#true} #83#return; {4865#true} is VALID [2022-04-27 11:13:31,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {4865#true} call ULTIMATE.init(); {4879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:31,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4865#true} is VALID [2022-04-27 11:13:31,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {4865#true} assume true; {4865#true} is VALID [2022-04-27 11:13:31,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4865#true} {4865#true} #83#return; {4865#true} is VALID [2022-04-27 11:13:31,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {4865#true} call #t~ret15 := main(); {4865#true} is VALID [2022-04-27 11:13:31,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {4865#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4870#(= main_~y~0 0)} is VALID [2022-04-27 11:13:31,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {4870#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4871#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:31,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {4871#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4872#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:31,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {4872#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4873#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:31,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {4873#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4874#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:31,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {4874#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4874#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:31,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {4874#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {4875#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:31,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {4875#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4876#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:13:31,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {4876#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4877#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:31,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {4877#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4878#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:31,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {4878#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4866#false} is VALID [2022-04-27 11:13:31,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {4866#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4866#false} is VALID [2022-04-27 11:13:31,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {4866#false} assume !(~y~0 % 4294967296 > 0); {4866#false} is VALID [2022-04-27 11:13:31,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {4866#false} assume !(~x~0 % 4294967296 > 0); {4866#false} is VALID [2022-04-27 11:13:31,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {4866#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4866#false} is VALID [2022-04-27 11:13:31,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {4866#false} assume !(~z~0 % 4294967296 > 0); {4866#false} is VALID [2022-04-27 11:13:31,640 INFO L272 TraceCheckUtils]: 21: Hoare triple {4866#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4866#false} is VALID [2022-04-27 11:13:31,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {4866#false} ~cond := #in~cond; {4866#false} is VALID [2022-04-27 11:13:31,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {4866#false} assume 0 == ~cond; {4866#false} is VALID [2022-04-27 11:13:31,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {4866#false} assume !false; {4866#false} is VALID [2022-04-27 11:13:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:31,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:31,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433321281] [2022-04-27 11:13:31,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433321281] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:31,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869131715] [2022-04-27 11:13:31,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:31,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:31,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:31,642 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-27 11:13:31,643 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-27 11:13:31,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:13:31,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:31,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:13:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:31,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:31,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {4865#true} call ULTIMATE.init(); {4865#true} is VALID [2022-04-27 11:13:31,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {4865#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4865#true} is VALID [2022-04-27 11:13:31,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {4865#true} assume true; {4865#true} is VALID [2022-04-27 11:13:31,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4865#true} {4865#true} #83#return; {4865#true} is VALID [2022-04-27 11:13:31,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {4865#true} call #t~ret15 := main(); {4865#true} is VALID [2022-04-27 11:13:31,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {4865#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4865#true} is VALID [2022-04-27 11:13:31,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {4865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4865#true} is VALID [2022-04-27 11:13:31,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {4865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4904#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:31,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {4904#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4908#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:31,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {4908#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:31,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:31,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:31,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4908#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:31,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {4908#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4904#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:31,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {4904#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4928#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:31,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {4928#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4928#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:31,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {4928#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4928#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:31,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {4928#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4928#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:31,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {4928#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4866#false} is VALID [2022-04-27 11:13:31,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {4866#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4866#false} is VALID [2022-04-27 11:13:31,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {4866#false} assume !(~z~0 % 4294967296 > 0); {4866#false} is VALID [2022-04-27 11:13:31,804 INFO L272 TraceCheckUtils]: 21: Hoare triple {4866#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4866#false} is VALID [2022-04-27 11:13:31,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {4866#false} ~cond := #in~cond; {4866#false} is VALID [2022-04-27 11:13:31,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {4866#false} assume 0 == ~cond; {4866#false} is VALID [2022-04-27 11:13:31,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {4866#false} assume !false; {4866#false} is VALID [2022-04-27 11:13:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:31,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:31,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {4866#false} assume !false; {4866#false} is VALID [2022-04-27 11:13:31,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {4866#false} assume 0 == ~cond; {4866#false} is VALID [2022-04-27 11:13:31,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {4866#false} ~cond := #in~cond; {4866#false} is VALID [2022-04-27 11:13:31,874 INFO L272 TraceCheckUtils]: 21: Hoare triple {4866#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4866#false} is VALID [2022-04-27 11:13:31,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {4866#false} assume !(~z~0 % 4294967296 > 0); {4866#false} is VALID [2022-04-27 11:13:31,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {4866#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4866#false} is VALID [2022-04-27 11:13:31,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {4928#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4866#false} is VALID [2022-04-27 11:13:31,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {4928#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4928#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:31,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {4928#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4928#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:31,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {4928#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4928#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:31,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {4904#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4928#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:31,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {4908#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4904#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:31,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4908#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:31,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:31,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:31,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {4908#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4912#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:31,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {4904#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4908#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:31,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {4865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4904#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:31,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {4865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4865#true} is VALID [2022-04-27 11:13:31,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {4865#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4865#true} is VALID [2022-04-27 11:13:31,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {4865#true} call #t~ret15 := main(); {4865#true} is VALID [2022-04-27 11:13:31,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4865#true} {4865#true} #83#return; {4865#true} is VALID [2022-04-27 11:13:31,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {4865#true} assume true; {4865#true} is VALID [2022-04-27 11:13:31,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {4865#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4865#true} is VALID [2022-04-27 11:13:31,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {4865#true} call ULTIMATE.init(); {4865#true} is VALID [2022-04-27 11:13:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:31,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869131715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:31,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:31,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-27 11:13:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52521509] [2022-04-27 11:13:31,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:31,881 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:13:31,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:31,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:31,905 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-27 11:13:31,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:13:31,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:13:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:13:31,906 INFO L87 Difference]: Start difference. First operand 75 states and 101 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:34,253 INFO L93 Difference]: Finished difference Result 155 states and 224 transitions. [2022-04-27 11:13:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-27 11:13:34,253 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:13:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2022-04-27 11:13:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2022-04-27 11:13:34,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 125 transitions. [2022-04-27 11:13:34,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:34,390 INFO L225 Difference]: With dead ends: 155 [2022-04-27 11:13:34,390 INFO L226 Difference]: Without dead ends: 126 [2022-04-27 11:13:34,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=363, Invalid=2187, Unknown=0, NotChecked=0, Total=2550 [2022-04-27 11:13:34,391 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 109 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:34,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 90 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:13:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-27 11:13:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2022-04-27 11:13:34,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:34,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 98 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:34,501 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 98 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:34,502 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 98 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:34,503 INFO L93 Difference]: Finished difference Result 126 states and 173 transitions. [2022-04-27 11:13:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 173 transitions. [2022-04-27 11:13:34,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:34,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:34,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 126 states. [2022-04-27 11:13:34,504 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 126 states. [2022-04-27 11:13:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:34,506 INFO L93 Difference]: Finished difference Result 126 states and 173 transitions. [2022-04-27 11:13:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 173 transitions. [2022-04-27 11:13:34,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:34,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:34,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:34,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2022-04-27 11:13:34,507 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 25 [2022-04-27 11:13:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:34,507 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2022-04-27 11:13:34,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2022-04-27 11:13:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:13:34,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:34,508 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:34,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:34,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 11:13:34,715 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:34,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1205395922, now seen corresponding path program 3 times [2022-04-27 11:13:34,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:34,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112792748] [2022-04-27 11:13:34,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:34,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:34,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:34,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {5697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5683#true} is VALID [2022-04-27 11:13:34,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {5683#true} assume true; {5683#true} is VALID [2022-04-27 11:13:34,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5683#true} {5683#true} #83#return; {5683#true} is VALID [2022-04-27 11:13:34,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {5683#true} call ULTIMATE.init(); {5697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:34,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {5697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5683#true} is VALID [2022-04-27 11:13:34,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {5683#true} assume true; {5683#true} is VALID [2022-04-27 11:13:34,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5683#true} {5683#true} #83#return; {5683#true} is VALID [2022-04-27 11:13:34,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {5683#true} call #t~ret15 := main(); {5683#true} is VALID [2022-04-27 11:13:34,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {5683#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5688#(= main_~y~0 0)} is VALID [2022-04-27 11:13:34,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {5688#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5689#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:34,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {5689#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5690#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:34,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {5690#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5691#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:34,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {5691#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5691#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:34,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {5691#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5692#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:13:34,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {5692#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5693#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:34,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {5693#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5694#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:34,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {5694#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5695#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:34,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {5695#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5695#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:34,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {5695#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5694#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:34,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {5694#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5693#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:34,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {5693#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5696#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:34,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {5696#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {5696#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:34,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {5696#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5696#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:34,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {5696#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {5696#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:34,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {5696#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {5684#false} is VALID [2022-04-27 11:13:34,844 INFO L272 TraceCheckUtils]: 22: Hoare triple {5684#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5684#false} is VALID [2022-04-27 11:13:34,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {5684#false} ~cond := #in~cond; {5684#false} is VALID [2022-04-27 11:13:34,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {5684#false} assume 0 == ~cond; {5684#false} is VALID [2022-04-27 11:13:34,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {5684#false} assume !false; {5684#false} is VALID [2022-04-27 11:13:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:34,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:34,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112792748] [2022-04-27 11:13:34,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112792748] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:34,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109871989] [2022-04-27 11:13:34,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:34,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:34,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:34,846 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-27 11:13:34,847 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-27 11:13:34,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:13:34,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:34,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:13:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:34,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:35,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {5683#true} call ULTIMATE.init(); {5683#true} is VALID [2022-04-27 11:13:35,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {5683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5683#true} is VALID [2022-04-27 11:13:35,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {5683#true} assume true; {5683#true} is VALID [2022-04-27 11:13:35,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5683#true} {5683#true} #83#return; {5683#true} is VALID [2022-04-27 11:13:35,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {5683#true} call #t~ret15 := main(); {5683#true} is VALID [2022-04-27 11:13:35,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {5683#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5683#true} is VALID [2022-04-27 11:13:35,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {5683#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5683#true} is VALID [2022-04-27 11:13:35,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {5683#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5722#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:35,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {5722#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:35,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:35,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:35,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5722#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:35,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {5722#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5739#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:35,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {5739#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5739#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:35,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {5739#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5684#false} is VALID [2022-04-27 11:13:35,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {5684#false} assume !(~z~0 % 4294967296 > 0); {5684#false} is VALID [2022-04-27 11:13:35,010 INFO L272 TraceCheckUtils]: 22: Hoare triple {5684#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5684#false} is VALID [2022-04-27 11:13:35,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {5684#false} ~cond := #in~cond; {5684#false} is VALID [2022-04-27 11:13:35,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {5684#false} assume 0 == ~cond; {5684#false} is VALID [2022-04-27 11:13:35,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {5684#false} assume !false; {5684#false} is VALID [2022-04-27 11:13:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:13:35,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:35,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {5684#false} assume !false; {5684#false} is VALID [2022-04-27 11:13:35,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {5684#false} assume 0 == ~cond; {5684#false} is VALID [2022-04-27 11:13:35,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {5684#false} ~cond := #in~cond; {5684#false} is VALID [2022-04-27 11:13:35,088 INFO L272 TraceCheckUtils]: 22: Hoare triple {5684#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5684#false} is VALID [2022-04-27 11:13:35,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {5684#false} assume !(~z~0 % 4294967296 > 0); {5684#false} is VALID [2022-04-27 11:13:35,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {5739#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5684#false} is VALID [2022-04-27 11:13:35,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5739#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:35,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {5739#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5743#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:35,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {5722#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5739#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:35,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5722#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:35,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:35,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:35,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {5722#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5726#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:35,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {5683#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5722#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:35,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {5683#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5683#true} is VALID [2022-04-27 11:13:35,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {5683#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5683#true} is VALID [2022-04-27 11:13:35,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {5683#true} call #t~ret15 := main(); {5683#true} is VALID [2022-04-27 11:13:35,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5683#true} {5683#true} #83#return; {5683#true} is VALID [2022-04-27 11:13:35,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {5683#true} assume true; {5683#true} is VALID [2022-04-27 11:13:35,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {5683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5683#true} is VALID [2022-04-27 11:13:35,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {5683#true} call ULTIMATE.init(); {5683#true} is VALID [2022-04-27 11:13:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:13:35,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109871989] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:35,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:35,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-27 11:13:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412180652] [2022-04-27 11:13:35,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:35,096 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:13:35,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:35,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:35,124 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-27 11:13:35,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:13:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:13:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:13:35,125 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:37,116 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2022-04-27 11:13:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-27 11:13:37,116 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:13:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 115 transitions. [2022-04-27 11:13:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 115 transitions. [2022-04-27 11:13:37,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 115 transitions. [2022-04-27 11:13:37,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:37,244 INFO L225 Difference]: With dead ends: 133 [2022-04-27 11:13:37,244 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 11:13:37,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=489, Invalid=3051, Unknown=0, NotChecked=0, Total=3540 [2022-04-27 11:13:37,245 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:37,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 72 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:13:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 11:13:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2022-04-27 11:13:37,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:37,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 87 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,344 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 87 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,344 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 87 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:37,345 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-27 11:13:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-27 11:13:37,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:37,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:37,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-27 11:13:37,347 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-27 11:13:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:37,349 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-27 11:13:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-27 11:13:37,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:37,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:37,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:37,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2022-04-27 11:13:37,351 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 26 [2022-04-27 11:13:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:37,351 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2022-04-27 11:13:37,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2022-04-27 11:13:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:13:37,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:37,352 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:37,371 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-27 11:13:37,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 11:13:37,569 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:37,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash -438714480, now seen corresponding path program 5 times [2022-04-27 11:13:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:37,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020518569] [2022-04-27 11:13:37,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:37,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:37,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:37,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {6450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6442#true} is VALID [2022-04-27 11:13:37,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {6442#true} assume true; {6442#true} is VALID [2022-04-27 11:13:37,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6442#true} {6442#true} #83#return; {6442#true} is VALID [2022-04-27 11:13:37,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {6442#true} call ULTIMATE.init(); {6450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:37,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {6450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6442#true} is VALID [2022-04-27 11:13:37,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {6442#true} assume true; {6442#true} is VALID [2022-04-27 11:13:37,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6442#true} {6442#true} #83#return; {6442#true} is VALID [2022-04-27 11:13:37,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {6442#true} call #t~ret15 := main(); {6442#true} is VALID [2022-04-27 11:13:37,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {6442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6442#true} is VALID [2022-04-27 11:13:37,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {6442#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6442#true} is VALID [2022-04-27 11:13:37,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {6442#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6442#true} is VALID [2022-04-27 11:13:37,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {6442#true} assume !(~x~0 % 4294967296 > 0); {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:37,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:37,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {6447#(<= 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; {6448#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:37,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {6448#(<= 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; {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6448#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:37,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {6448#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:37,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6443#false} is VALID [2022-04-27 11:13:37,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {6443#false} assume !(~x~0 % 4294967296 > 0); {6443#false} is VALID [2022-04-27 11:13:37,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {6443#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6443#false} is VALID [2022-04-27 11:13:37,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {6443#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6443#false} is VALID [2022-04-27 11:13:37,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {6443#false} assume !(~z~0 % 4294967296 > 0); {6443#false} is VALID [2022-04-27 11:13:37,635 INFO L272 TraceCheckUtils]: 23: Hoare triple {6443#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6443#false} is VALID [2022-04-27 11:13:37,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {6443#false} ~cond := #in~cond; {6443#false} is VALID [2022-04-27 11:13:37,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {6443#false} assume 0 == ~cond; {6443#false} is VALID [2022-04-27 11:13:37,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {6443#false} assume !false; {6443#false} is VALID [2022-04-27 11:13:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:13:37,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020518569] [2022-04-27 11:13:37,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020518569] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667774823] [2022-04-27 11:13:37,636 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:13:37,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:37,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:37,639 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-27 11:13:37,640 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-27 11:13:37,682 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-27 11:13:37,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:37,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:13:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:37,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:37,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {6442#true} call ULTIMATE.init(); {6442#true} is VALID [2022-04-27 11:13:37,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {6442#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6442#true} is VALID [2022-04-27 11:13:37,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {6442#true} assume true; {6442#true} is VALID [2022-04-27 11:13:37,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6442#true} {6442#true} #83#return; {6442#true} is VALID [2022-04-27 11:13:37,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {6442#true} call #t~ret15 := main(); {6442#true} is VALID [2022-04-27 11:13:37,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {6442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6442#true} is VALID [2022-04-27 11:13:37,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {6442#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6442#true} is VALID [2022-04-27 11:13:37,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {6442#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6442#true} is VALID [2022-04-27 11:13:37,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {6442#true} assume !(~x~0 % 4294967296 > 0); {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:37,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:37,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {6447#(<= 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; {6448#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:37,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {6448#(<= 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; {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6448#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:37,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {6448#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:37,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6443#false} is VALID [2022-04-27 11:13:37,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {6443#false} assume !(~x~0 % 4294967296 > 0); {6443#false} is VALID [2022-04-27 11:13:37,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {6443#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6443#false} is VALID [2022-04-27 11:13:37,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {6443#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6443#false} is VALID [2022-04-27 11:13:37,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {6443#false} assume !(~z~0 % 4294967296 > 0); {6443#false} is VALID [2022-04-27 11:13:37,904 INFO L272 TraceCheckUtils]: 23: Hoare triple {6443#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6443#false} is VALID [2022-04-27 11:13:37,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {6443#false} ~cond := #in~cond; {6443#false} is VALID [2022-04-27 11:13:37,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {6443#false} assume 0 == ~cond; {6443#false} is VALID [2022-04-27 11:13:37,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {6443#false} assume !false; {6443#false} is VALID [2022-04-27 11:13:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:13:37,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:37,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {6443#false} assume !false; {6443#false} is VALID [2022-04-27 11:13:37,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {6443#false} assume 0 == ~cond; {6443#false} is VALID [2022-04-27 11:13:37,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {6443#false} ~cond := #in~cond; {6443#false} is VALID [2022-04-27 11:13:37,976 INFO L272 TraceCheckUtils]: 23: Hoare triple {6443#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6443#false} is VALID [2022-04-27 11:13:37,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {6443#false} assume !(~z~0 % 4294967296 > 0); {6443#false} is VALID [2022-04-27 11:13:37,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {6443#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6443#false} is VALID [2022-04-27 11:13:37,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {6443#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6443#false} is VALID [2022-04-27 11:13:37,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {6443#false} assume !(~x~0 % 4294967296 > 0); {6443#false} is VALID [2022-04-27 11:13:37,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6443#false} is VALID [2022-04-27 11:13:37,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {6448#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:37,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6448#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:37,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {6448#(<= 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; {6449#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:37,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {6447#(<= 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; {6448#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:13:37,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:37,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {6442#true} assume !(~x~0 % 4294967296 > 0); {6447#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:37,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {6442#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6442#true} is VALID [2022-04-27 11:13:37,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {6442#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6442#true} is VALID [2022-04-27 11:13:37,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {6442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6442#true} is VALID [2022-04-27 11:13:37,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {6442#true} call #t~ret15 := main(); {6442#true} is VALID [2022-04-27 11:13:37,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6442#true} {6442#true} #83#return; {6442#true} is VALID [2022-04-27 11:13:37,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {6442#true} assume true; {6442#true} is VALID [2022-04-27 11:13:37,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {6442#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6442#true} is VALID [2022-04-27 11:13:37,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {6442#true} call ULTIMATE.init(); {6442#true} is VALID [2022-04-27 11:13:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:13:37,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667774823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:37,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:37,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-27 11:13:37,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075735906] [2022-04-27 11:13:37,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:37,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:13:37,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:37,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:38,000 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-27 11:13:38,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:13:38,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:38,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:13:38,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:13:38,000 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:38,233 INFO L93 Difference]: Finished difference Result 110 states and 141 transitions. [2022-04-27 11:13:38,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:13:38,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:13:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 11:13:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 11:13:38,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-27 11:13:38,264 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-27 11:13:38,264 INFO L225 Difference]: With dead ends: 110 [2022-04-27 11:13:38,265 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 11:13:38,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:13:38,265 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:38,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 35 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 11:13:38,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-27 11:13:38,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:38,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:38,341 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:38,341 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:38,342 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2022-04-27 11:13:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2022-04-27 11:13:38,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:38,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:38,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-27 11:13:38,343 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-27 11:13:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:38,344 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2022-04-27 11:13:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2022-04-27 11:13:38,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:38,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:38,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:38,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2022-04-27 11:13:38,345 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 27 [2022-04-27 11:13:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:38,345 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2022-04-27 11:13:38,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2022-04-27 11:13:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:13:38,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:38,346 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:38,379 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-27 11:13:38,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 11:13:38,559 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:38,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1284330801, now seen corresponding path program 6 times [2022-04-27 11:13:38,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:38,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094524265] [2022-04-27 11:13:38,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:38,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:38,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:38,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {7054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7040#true} is VALID [2022-04-27 11:13:38,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {7040#true} assume true; {7040#true} is VALID [2022-04-27 11:13:38,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7040#true} {7040#true} #83#return; {7040#true} is VALID [2022-04-27 11:13:38,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {7040#true} call ULTIMATE.init(); {7054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:38,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {7054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7040#true} is VALID [2022-04-27 11:13:38,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {7040#true} assume true; {7040#true} is VALID [2022-04-27 11:13:38,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7040#true} {7040#true} #83#return; {7040#true} is VALID [2022-04-27 11:13:38,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {7040#true} call #t~ret15 := main(); {7040#true} is VALID [2022-04-27 11:13:38,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {7040#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7045#(= main_~y~0 0)} is VALID [2022-04-27 11:13:38,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {7045#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7046#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:38,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {7046#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7047#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:38,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {7047#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7048#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:38,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {7048#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7049#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:38,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {7049#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7050#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:38,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {7050#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {7050#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:38,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {7050#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {7051#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:38,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {7051#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7052#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:38,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {7052#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7053#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:38,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {7053#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7041#false} is VALID [2022-04-27 11:13:38,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {7041#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7041#false} is VALID [2022-04-27 11:13:38,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {7041#false} assume !(~y~0 % 4294967296 > 0); {7041#false} is VALID [2022-04-27 11:13:38,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {7041#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7041#false} is VALID [2022-04-27 11:13:38,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {7041#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7041#false} is VALID [2022-04-27 11:13:38,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {7041#false} assume !(~x~0 % 4294967296 > 0); {7041#false} is VALID [2022-04-27 11:13:38,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {7041#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7041#false} is VALID [2022-04-27 11:13:38,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {7041#false} assume !(~z~0 % 4294967296 > 0); {7041#false} is VALID [2022-04-27 11:13:38,692 INFO L272 TraceCheckUtils]: 23: Hoare triple {7041#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7041#false} is VALID [2022-04-27 11:13:38,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {7041#false} ~cond := #in~cond; {7041#false} is VALID [2022-04-27 11:13:38,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {7041#false} assume 0 == ~cond; {7041#false} is VALID [2022-04-27 11:13:38,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {7041#false} assume !false; {7041#false} is VALID [2022-04-27 11:13:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 11:13:38,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:38,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094524265] [2022-04-27 11:13:38,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094524265] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:38,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611975720] [2022-04-27 11:13:38,692 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:13:38,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:38,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:38,693 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-27 11:13:38,700 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-27 11:13:38,734 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:13:38,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:38,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:13:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:38,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:38,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {7040#true} call ULTIMATE.init(); {7040#true} is VALID [2022-04-27 11:13:38,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {7040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7040#true} is VALID [2022-04-27 11:13:38,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {7040#true} assume true; {7040#true} is VALID [2022-04-27 11:13:38,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7040#true} {7040#true} #83#return; {7040#true} is VALID [2022-04-27 11:13:38,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {7040#true} call #t~ret15 := main(); {7040#true} is VALID [2022-04-27 11:13:38,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {7040#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7040#true} is VALID [2022-04-27 11:13:38,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {7040#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7040#true} is VALID [2022-04-27 11:13:38,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {7040#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7040#true} is VALID [2022-04-27 11:13:38,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {7040#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7040#true} is VALID [2022-04-27 11:13:38,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {7040#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7040#true} is VALID [2022-04-27 11:13:38,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {7040#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7040#true} is VALID [2022-04-27 11:13:38,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {7040#true} assume !(~x~0 % 4294967296 > 0); {7040#true} is VALID [2022-04-27 11:13:38,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {7040#true} ~z~0 := ~y~0; {7094#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:13:38,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {7094#(= 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; {7098#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-27 11:13:38,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {7098#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7102#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:38,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {7102#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {7102#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:38,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {7102#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7109#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:38,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {7109#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7041#false} is VALID [2022-04-27 11:13:38,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {7041#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7041#false} is VALID [2022-04-27 11:13:38,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {7041#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7041#false} is VALID [2022-04-27 11:13:38,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {7041#false} assume !(~x~0 % 4294967296 > 0); {7041#false} is VALID [2022-04-27 11:13:38,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {7041#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7041#false} is VALID [2022-04-27 11:13:38,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {7041#false} assume !(~z~0 % 4294967296 > 0); {7041#false} is VALID [2022-04-27 11:13:38,824 INFO L272 TraceCheckUtils]: 23: Hoare triple {7041#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7041#false} is VALID [2022-04-27 11:13:38,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {7041#false} ~cond := #in~cond; {7041#false} is VALID [2022-04-27 11:13:38,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {7041#false} assume 0 == ~cond; {7041#false} is VALID [2022-04-27 11:13:38,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {7041#false} assume !false; {7041#false} is VALID [2022-04-27 11:13:38,824 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 11:13:38,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:38,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {7041#false} assume !false; {7041#false} is VALID [2022-04-27 11:13:38,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {7041#false} assume 0 == ~cond; {7041#false} is VALID [2022-04-27 11:13:38,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {7041#false} ~cond := #in~cond; {7041#false} is VALID [2022-04-27 11:13:38,926 INFO L272 TraceCheckUtils]: 23: Hoare triple {7041#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7041#false} is VALID [2022-04-27 11:13:38,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {7041#false} assume !(~z~0 % 4294967296 > 0); {7041#false} is VALID [2022-04-27 11:13:38,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {7041#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7041#false} is VALID [2022-04-27 11:13:38,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {7041#false} assume !(~x~0 % 4294967296 > 0); {7041#false} is VALID [2022-04-27 11:13:38,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {7041#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7041#false} is VALID [2022-04-27 11:13:38,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {7041#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7041#false} is VALID [2022-04-27 11:13:38,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {7109#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7041#false} is VALID [2022-04-27 11:13:38,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {7102#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7109#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:38,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {7102#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {7102#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:38,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {7176#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7102#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:38,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {7180#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7176#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:13:38,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {7040#true} ~z~0 := ~y~0; {7180#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:13:38,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {7040#true} assume !(~x~0 % 4294967296 > 0); {7040#true} is VALID [2022-04-27 11:13:38,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {7040#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7040#true} is VALID [2022-04-27 11:13:38,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {7040#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7040#true} is VALID [2022-04-27 11:13:38,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {7040#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7040#true} is VALID [2022-04-27 11:13:38,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {7040#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7040#true} is VALID [2022-04-27 11:13:38,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {7040#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7040#true} is VALID [2022-04-27 11:13:38,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {7040#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7040#true} is VALID [2022-04-27 11:13:38,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {7040#true} call #t~ret15 := main(); {7040#true} is VALID [2022-04-27 11:13:38,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7040#true} {7040#true} #83#return; {7040#true} is VALID [2022-04-27 11:13:38,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {7040#true} assume true; {7040#true} is VALID [2022-04-27 11:13:38,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {7040#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7040#true} is VALID [2022-04-27 11:13:38,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {7040#true} call ULTIMATE.init(); {7040#true} is VALID [2022-04-27 11:13:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 11:13:38,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611975720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:38,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:38,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 18 [2022-04-27 11:13:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2877076] [2022-04-27 11:13:38,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:13:38,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:38,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:38,954 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-27 11:13:38,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:13:38,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:38,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:13:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:13:38,955 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:40,542 INFO L93 Difference]: Finished difference Result 185 states and 258 transitions. [2022-04-27 11:13:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 11:13:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:13:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 125 transitions. [2022-04-27 11:13:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 125 transitions. [2022-04-27 11:13:40,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 125 transitions. [2022-04-27 11:13:40,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:40,641 INFO L225 Difference]: With dead ends: 185 [2022-04-27 11:13:40,641 INFO L226 Difference]: Without dead ends: 151 [2022-04-27 11:13:40,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=352, Invalid=1370, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 11:13:40,642 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 126 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:40,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 64 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:13:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-27 11:13:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 88. [2022-04-27 11:13:40,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:40,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 88 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,744 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 88 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,744 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 88 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:40,746 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2022-04-27 11:13:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2022-04-27 11:13:40,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:40,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:40,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states. [2022-04-27 11:13:40,747 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states. [2022-04-27 11:13:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:40,749 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2022-04-27 11:13:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2022-04-27 11:13:40,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:40,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:40,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:40,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-04-27 11:13:40,750 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 27 [2022-04-27 11:13:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:40,750 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-04-27 11:13:40,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-04-27 11:13:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:13:40,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:40,751 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:40,767 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-27 11:13:40,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:40,967 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:40,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:40,968 INFO L85 PathProgramCache]: Analyzing trace with hash -67489470, now seen corresponding path program 4 times [2022-04-27 11:13:40,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:40,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133936231] [2022-04-27 11:13:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:41,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:41,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {7948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7933#true} is VALID [2022-04-27 11:13:41,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-27 11:13:41,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7933#true} {7933#true} #83#return; {7933#true} is VALID [2022-04-27 11:13:41,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {7933#true} call ULTIMATE.init(); {7948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:41,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {7948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7933#true} is VALID [2022-04-27 11:13:41,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-27 11:13:41,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #83#return; {7933#true} is VALID [2022-04-27 11:13:41,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret15 := main(); {7933#true} is VALID [2022-04-27 11:13:41,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {7933#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7938#(= main_~y~0 0)} is VALID [2022-04-27 11:13:41,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {7938#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:41,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {7939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7940#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:41,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {7940#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7941#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:41,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {7941#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7942#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:41,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {7942#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7943#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:41,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {7943#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7944#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:13:41,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {7944#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7944#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:13:41,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {7944#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {7945#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:13:41,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {7945#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7946#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:41,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {7946#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7947#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {7947#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {7934#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {7934#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {7934#false} assume !(~y~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {7934#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {7934#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {7934#false} assume !(~x~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {7934#false} assume !(~z~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L272 TraceCheckUtils]: 24: Hoare triple {7934#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {7934#false} ~cond := #in~cond; {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {7934#false} assume 0 == ~cond; {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-27 11:13:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:41,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133936231] [2022-04-27 11:13:41,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133936231] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:41,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056654830] [2022-04-27 11:13:41,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:13:41,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:41,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:41,118 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-27 11:13:41,119 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-27 11:13:41,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:13:41,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:41,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 11:13:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:41,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:41,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {7933#true} call ULTIMATE.init(); {7933#true} is VALID [2022-04-27 11:13:41,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {7933#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7933#true} is VALID [2022-04-27 11:13:41,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-27 11:13:41,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #83#return; {7933#true} is VALID [2022-04-27 11:13:41,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret15 := main(); {7933#true} is VALID [2022-04-27 11:13:41,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {7933#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7938#(= main_~y~0 0)} is VALID [2022-04-27 11:13:41,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {7938#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:41,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {7939#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7940#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:41,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {7940#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7941#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:41,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {7941#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7942#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:41,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {7942#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7943#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:41,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {7943#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7944#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:13:41,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {7944#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7944#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:13:41,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {7944#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {7945#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:13:41,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {7945#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7946#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:41,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {7946#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7997#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:41,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {7997#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {7934#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7934#false} is VALID [2022-04-27 11:13:41,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {7934#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7934#false} is VALID [2022-04-27 11:13:41,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {7934#false} assume !(~y~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {7934#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7934#false} is VALID [2022-04-27 11:13:41,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {7934#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7934#false} is VALID [2022-04-27 11:13:41,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {7934#false} assume !(~x~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {7934#false} assume !(~z~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,348 INFO L272 TraceCheckUtils]: 24: Hoare triple {7934#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7934#false} is VALID [2022-04-27 11:13:41,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {7934#false} ~cond := #in~cond; {7934#false} is VALID [2022-04-27 11:13:41,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {7934#false} assume 0 == ~cond; {7934#false} is VALID [2022-04-27 11:13:41,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-27 11:13:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:41,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:41,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-27 11:13:41,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {7934#false} assume 0 == ~cond; {7934#false} is VALID [2022-04-27 11:13:41,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {7934#false} ~cond := #in~cond; {7934#false} is VALID [2022-04-27 11:13:41,553 INFO L272 TraceCheckUtils]: 24: Hoare triple {7934#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7934#false} is VALID [2022-04-27 11:13:41,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {7934#false} assume !(~z~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {7934#false} assume !(~x~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {7934#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7934#false} is VALID [2022-04-27 11:13:41,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {7934#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7934#false} is VALID [2022-04-27 11:13:41,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {7934#false} assume !(~y~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {7934#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7934#false} is VALID [2022-04-27 11:13:41,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {7934#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7934#false} is VALID [2022-04-27 11:13:41,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {8067#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7934#false} is VALID [2022-04-27 11:13:41,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {8071#(< 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; {8067#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:41,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {8075#(< 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; {8071#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:41,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {8079#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {8075#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:13:41,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {8079#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8079#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:13:41,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {8086#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8079#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:13:41,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {8090#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8086#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:41,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {8094#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8090#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:41,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {8098#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8094#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:41,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {8102#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8098#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:13:41,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {8106#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8102#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:13:41,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {7933#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8106#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:13:41,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret15 := main(); {7933#true} is VALID [2022-04-27 11:13:41,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #83#return; {7933#true} is VALID [2022-04-27 11:13:41,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-27 11:13:41,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {7933#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7933#true} is VALID [2022-04-27 11:13:41,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {7933#true} call ULTIMATE.init(); {7933#true} is VALID [2022-04-27 11:13:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:41,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056654830] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:41,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:41,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-27 11:13:41,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000478138] [2022-04-27 11:13:41,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:41,561 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:13:41,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:41,561 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), 23 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:41,601 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-27 11:13:41,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 11:13:41,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:41,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 11:13:41,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:13:41,602 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:55,500 INFO L93 Difference]: Finished difference Result 382 states and 535 transitions. [2022-04-27 11:13:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-04-27 11:13:55,500 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:13:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 353 transitions. [2022-04-27 11:13:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 353 transitions. [2022-04-27 11:13:55,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 353 transitions. [2022-04-27 11:13:56,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:56,330 INFO L225 Difference]: With dead ends: 382 [2022-04-27 11:13:56,331 INFO L226 Difference]: Without dead ends: 343 [2022-04-27 11:13:56,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11603 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=5490, Invalid=21570, Unknown=0, NotChecked=0, Total=27060 [2022-04-27 11:13:56,337 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 400 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 669 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:56,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 109 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [669 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 11:13:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-04-27 11:13:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 108. [2022-04-27 11:13:56,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:56,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:56,544 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:56,544 INFO L87 Difference]: Start difference. First operand 343 states. Second operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:56,549 INFO L93 Difference]: Finished difference Result 343 states and 463 transitions. [2022-04-27 11:13:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2022-04-27 11:13:56,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:56,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:56,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 343 states. [2022-04-27 11:13:56,550 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 343 states. [2022-04-27 11:13:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:56,555 INFO L93 Difference]: Finished difference Result 343 states and 463 transitions. [2022-04-27 11:13:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2022-04-27 11:13:56,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:56,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:56,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:56,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2022-04-27 11:13:56,558 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 28 [2022-04-27 11:13:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:56,558 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2022-04-27 11:13:56,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2022-04-27 11:13:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:13:56,558 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:56,558 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:56,579 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-27 11:13:56,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:56,771 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:56,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash -409683135, now seen corresponding path program 4 times [2022-04-27 11:13:56,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:56,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158703312] [2022-04-27 11:13:56,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:56,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:56,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {9784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9768#true} is VALID [2022-04-27 11:13:56,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {9768#true} assume true; {9768#true} is VALID [2022-04-27 11:13:56,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9768#true} {9768#true} #83#return; {9768#true} is VALID [2022-04-27 11:13:56,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {9768#true} call ULTIMATE.init(); {9784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:56,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {9784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9768#true} is VALID [2022-04-27 11:13:56,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {9768#true} assume true; {9768#true} is VALID [2022-04-27 11:13:56,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9768#true} {9768#true} #83#return; {9768#true} is VALID [2022-04-27 11:13:56,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {9768#true} call #t~ret15 := main(); {9768#true} is VALID [2022-04-27 11:13:56,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {9768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9773#(= main_~y~0 0)} is VALID [2022-04-27 11:13:56,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {9773#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:56,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {9774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9775#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:56,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {9775#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9776#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:56,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {9776#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9777#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:56,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {9777#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9777#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:56,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {9777#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {9778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:56,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {9778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9779#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:13:56,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {9779#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9780#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:56,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {9780#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9781#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:56,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {9781#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:56,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {9782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:56,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {9782#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9781#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:56,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {9781#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9780#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:56,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {9780#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9779#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:13:56,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {9779#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:56,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {9778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {9778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:56,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {9778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~x~0 % 4294967296 > 0); {9778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:56,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {9778#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9783#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:56,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {9783#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {9769#false} is VALID [2022-04-27 11:13:56,948 INFO L272 TraceCheckUtils]: 25: Hoare triple {9769#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9769#false} is VALID [2022-04-27 11:13:56,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {9769#false} ~cond := #in~cond; {9769#false} is VALID [2022-04-27 11:13:56,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {9769#false} assume 0 == ~cond; {9769#false} is VALID [2022-04-27 11:13:56,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {9769#false} assume !false; {9769#false} is VALID [2022-04-27 11:13:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:56,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:56,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158703312] [2022-04-27 11:13:56,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158703312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:56,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134487758] [2022-04-27 11:13:56,949 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:13:56,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:56,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:56,950 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-27 11:13:56,951 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-27 11:13:56,984 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:13:56,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:56,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:13:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:56,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:57,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {9768#true} call ULTIMATE.init(); {9768#true} is VALID [2022-04-27 11:13:57,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {9768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9768#true} is VALID [2022-04-27 11:13:57,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {9768#true} assume true; {9768#true} is VALID [2022-04-27 11:13:57,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9768#true} {9768#true} #83#return; {9768#true} is VALID [2022-04-27 11:13:57,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {9768#true} call #t~ret15 := main(); {9768#true} is VALID [2022-04-27 11:13:57,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {9768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9768#true} is VALID [2022-04-27 11:13:57,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {9768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9806#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:57,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {9806#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9810#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:57,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {9810#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9814#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:57,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {9814#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:13:57,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:13:57,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:13:57,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9814#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:57,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {9814#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9810#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:57,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {9810#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9806#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:57,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {9806#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9769#false} is VALID [2022-04-27 11:13:57,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {9769#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9769#false} is VALID [2022-04-27 11:13:57,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {9769#false} assume !(~z~0 % 4294967296 > 0); {9769#false} is VALID [2022-04-27 11:13:57,139 INFO L272 TraceCheckUtils]: 25: Hoare triple {9769#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9769#false} is VALID [2022-04-27 11:13:57,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {9769#false} ~cond := #in~cond; {9769#false} is VALID [2022-04-27 11:13:57,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {9769#false} assume 0 == ~cond; {9769#false} is VALID [2022-04-27 11:13:57,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {9769#false} assume !false; {9769#false} is VALID [2022-04-27 11:13:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 11:13:57,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:57,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {9769#false} assume !false; {9769#false} is VALID [2022-04-27 11:13:57,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {9769#false} assume 0 == ~cond; {9769#false} is VALID [2022-04-27 11:13:57,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {9769#false} ~cond := #in~cond; {9769#false} is VALID [2022-04-27 11:13:57,218 INFO L272 TraceCheckUtils]: 25: Hoare triple {9769#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9769#false} is VALID [2022-04-27 11:13:57,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {9769#false} assume !(~z~0 % 4294967296 > 0); {9769#false} is VALID [2022-04-27 11:13:57,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {9769#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9769#false} is VALID [2022-04-27 11:13:57,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9769#false} is VALID [2022-04-27 11:13:57,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {9837#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {9806#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9837#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:57,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {9810#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9806#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:57,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {9814#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9810#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:57,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9814#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:57,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:13:57,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:13:57,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {9814#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9818#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:13:57,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {9810#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9814#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:57,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {9806#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9810#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:57,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {9768#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9806#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:57,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {9768#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9768#true} is VALID [2022-04-27 11:13:57,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {9768#true} call #t~ret15 := main(); {9768#true} is VALID [2022-04-27 11:13:57,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9768#true} {9768#true} #83#return; {9768#true} is VALID [2022-04-27 11:13:57,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {9768#true} assume true; {9768#true} is VALID [2022-04-27 11:13:57,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {9768#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9768#true} is VALID [2022-04-27 11:13:57,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {9768#true} call ULTIMATE.init(); {9768#true} is VALID [2022-04-27 11:13:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 11:13:57,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134487758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:57,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:57,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-27 11:13:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815461435] [2022-04-27 11:13:57,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:57,226 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:13:57,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:57,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:57,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:57,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:13:57,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:57,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:13:57,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:13:57,260 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:02,207 INFO L93 Difference]: Finished difference Result 177 states and 245 transitions. [2022-04-27 11:14:02,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-27 11:14:02,207 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:14:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 151 transitions. [2022-04-27 11:14:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 151 transitions. [2022-04-27 11:14:02,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 151 transitions. [2022-04-27 11:14:02,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:02,501 INFO L225 Difference]: With dead ends: 177 [2022-04-27 11:14:02,501 INFO L226 Difference]: Without dead ends: 158 [2022-04-27 11:14:02,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=710, Invalid=4840, Unknown=0, NotChecked=0, Total=5550 [2022-04-27 11:14:02,503 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 112 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:02,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 92 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-27 11:14:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-27 11:14:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2022-04-27 11:14:02,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:02,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 123 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 118 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:02,726 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 123 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 118 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:02,726 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 123 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 118 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:02,729 INFO L93 Difference]: Finished difference Result 158 states and 199 transitions. [2022-04-27 11:14:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2022-04-27 11:14:02,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:02,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:02,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 118 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 158 states. [2022-04-27 11:14:02,729 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 118 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 158 states. [2022-04-27 11:14:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:02,731 INFO L93 Difference]: Finished difference Result 158 states and 199 transitions. [2022-04-27 11:14:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2022-04-27 11:14:02,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:02,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:02,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:02,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:02,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 118 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 157 transitions. [2022-04-27 11:14:02,733 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 157 transitions. Word has length 29 [2022-04-27 11:14:02,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:02,733 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 157 transitions. [2022-04-27 11:14:02,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 157 transitions. [2022-04-27 11:14:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 11:14:02,734 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:02,734 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:02,752 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-27 11:14:02,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:02,950 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:02,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:02,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1456672573, now seen corresponding path program 7 times [2022-04-27 11:14:02,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:02,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534252354] [2022-04-27 11:14:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:03,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {10816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10807#true} is VALID [2022-04-27 11:14:03,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-27 11:14:03,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10807#true} {10807#true} #83#return; {10807#true} is VALID [2022-04-27 11:14:03,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {10807#true} call ULTIMATE.init(); {10816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:03,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {10816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10807#true} is VALID [2022-04-27 11:14:03,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-27 11:14:03,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10807#true} {10807#true} #83#return; {10807#true} is VALID [2022-04-27 11:14:03,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {10807#true} call #t~ret15 := main(); {10807#true} is VALID [2022-04-27 11:14:03,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {10807#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10807#true} is VALID [2022-04-27 11:14:03,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {10807#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10807#true} is VALID [2022-04-27 11:14:03,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {10807#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10807#true} is VALID [2022-04-27 11:14:03,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {10807#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:03,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:03,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:03,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10814#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {10814#(<= main_~x~0 (+ 4294967296 (* (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; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10814#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {10814#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10808#false} is VALID [2022-04-27 11:14:03,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {10808#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10808#false} is VALID [2022-04-27 11:14:03,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {10808#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10808#false} is VALID [2022-04-27 11:14:03,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {10808#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10808#false} is VALID [2022-04-27 11:14:03,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {10808#false} assume !(~z~0 % 4294967296 > 0); {10808#false} is VALID [2022-04-27 11:14:03,057 INFO L272 TraceCheckUtils]: 26: Hoare triple {10808#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10808#false} is VALID [2022-04-27 11:14:03,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {10808#false} ~cond := #in~cond; {10808#false} is VALID [2022-04-27 11:14:03,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {10808#false} assume 0 == ~cond; {10808#false} is VALID [2022-04-27 11:14:03,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {10808#false} assume !false; {10808#false} is VALID [2022-04-27 11:14:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:14:03,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534252354] [2022-04-27 11:14:03,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534252354] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357220327] [2022-04-27 11:14:03,058 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:14:03,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:03,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:03,059 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-27 11:14:03,060 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-27 11:14:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:03,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:14:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:03,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:03,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {10807#true} call ULTIMATE.init(); {10807#true} is VALID [2022-04-27 11:14:03,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {10807#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10807#true} is VALID [2022-04-27 11:14:03,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-27 11:14:03,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10807#true} {10807#true} #83#return; {10807#true} is VALID [2022-04-27 11:14:03,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {10807#true} call #t~ret15 := main(); {10807#true} is VALID [2022-04-27 11:14:03,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {10807#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10807#true} is VALID [2022-04-27 11:14:03,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {10807#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10807#true} is VALID [2022-04-27 11:14:03,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {10807#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10807#true} is VALID [2022-04-27 11:14:03,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {10807#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:03,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:03,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:03,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10814#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {10814#(<= main_~x~0 (+ 4294967296 (* (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; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10814#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {10814#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10808#false} is VALID [2022-04-27 11:14:03,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {10808#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10808#false} is VALID [2022-04-27 11:14:03,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {10808#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10808#false} is VALID [2022-04-27 11:14:03,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {10808#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10808#false} is VALID [2022-04-27 11:14:03,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {10808#false} assume !(~z~0 % 4294967296 > 0); {10808#false} is VALID [2022-04-27 11:14:03,373 INFO L272 TraceCheckUtils]: 26: Hoare triple {10808#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10808#false} is VALID [2022-04-27 11:14:03,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {10808#false} ~cond := #in~cond; {10808#false} is VALID [2022-04-27 11:14:03,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {10808#false} assume 0 == ~cond; {10808#false} is VALID [2022-04-27 11:14:03,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {10808#false} assume !false; {10808#false} is VALID [2022-04-27 11:14:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:14:03,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:03,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {10808#false} assume !false; {10808#false} is VALID [2022-04-27 11:14:03,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {10808#false} assume 0 == ~cond; {10808#false} is VALID [2022-04-27 11:14:03,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {10808#false} ~cond := #in~cond; {10808#false} is VALID [2022-04-27 11:14:03,464 INFO L272 TraceCheckUtils]: 26: Hoare triple {10808#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10808#false} is VALID [2022-04-27 11:14:03,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {10808#false} assume !(~z~0 % 4294967296 > 0); {10808#false} is VALID [2022-04-27 11:14:03,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {10808#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10808#false} is VALID [2022-04-27 11:14:03,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {10808#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10808#false} is VALID [2022-04-27 11:14:03,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {10808#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10808#false} is VALID [2022-04-27 11:14:03,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10808#false} is VALID [2022-04-27 11:14:03,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {10814#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10814#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {10814#(<= main_~x~0 (+ 4294967296 (* (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; {10815#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10814#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10813#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:03,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:03,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:03,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {10807#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:03,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {10807#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10807#true} is VALID [2022-04-27 11:14:03,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {10807#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10807#true} is VALID [2022-04-27 11:14:03,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {10807#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10807#true} is VALID [2022-04-27 11:14:03,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {10807#true} call #t~ret15 := main(); {10807#true} is VALID [2022-04-27 11:14:03,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10807#true} {10807#true} #83#return; {10807#true} is VALID [2022-04-27 11:14:03,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-27 11:14:03,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {10807#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10807#true} is VALID [2022-04-27 11:14:03,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {10807#true} call ULTIMATE.init(); {10807#true} is VALID [2022-04-27 11:14:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:14:03,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357220327] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:03,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:03,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-27 11:14:03,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575074213] [2022-04-27 11:14:03,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:03,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 11:14:03,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:03,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:03,497 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-27 11:14:03,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:14:03,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:03,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:14:03,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:14:03,498 INFO L87 Difference]: Start difference. First operand 123 states and 157 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:03,987 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2022-04-27 11:14:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:14:03,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 11:14:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-04-27 11:14:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-04-27 11:14:03,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2022-04-27 11:14:04,031 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-27 11:14:04,033 INFO L225 Difference]: With dead ends: 137 [2022-04-27 11:14:04,033 INFO L226 Difference]: Without dead ends: 124 [2022-04-27 11:14:04,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:14:04,033 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:04,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 42 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:14:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-27 11:14:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-27 11:14:04,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:04,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 119 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:04,262 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 119 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:04,262 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 119 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:04,272 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-04-27 11:14:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-27 11:14:04,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:04,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:04,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 119 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-27 11:14:04,273 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 119 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-27 11:14:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:04,275 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2022-04-27 11:14:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-27 11:14:04,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:04,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:04,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:04,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 119 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2022-04-27 11:14:04,276 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 30 [2022-04-27 11:14:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:04,277 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2022-04-27 11:14:04,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-04-27 11:14:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:14:04,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:04,277 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:04,299 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-27 11:14:04,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:04,491 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash 975209470, now seen corresponding path program 5 times [2022-04-27 11:14:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:04,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151389720] [2022-04-27 11:14:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:04,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {11650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11632#true} is VALID [2022-04-27 11:14:04,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {11632#true} assume true; {11632#true} is VALID [2022-04-27 11:14:04,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11632#true} {11632#true} #83#return; {11632#true} is VALID [2022-04-27 11:14:04,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {11632#true} call ULTIMATE.init(); {11650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:04,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {11650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11632#true} is VALID [2022-04-27 11:14:04,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {11632#true} assume true; {11632#true} is VALID [2022-04-27 11:14:04,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11632#true} {11632#true} #83#return; {11632#true} is VALID [2022-04-27 11:14:04,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {11632#true} call #t~ret15 := main(); {11632#true} is VALID [2022-04-27 11:14:04,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {11632#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11637#(= main_~y~0 0)} is VALID [2022-04-27 11:14:04,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {11637#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11638#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:04,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {11638#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11639#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:04,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {11639#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11640#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:04,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {11640#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11641#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:04,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {11641#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11642#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:04,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {11642#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11643#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:14:04,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {11643#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11644#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:04,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {11644#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {11644#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:04,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {11644#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {11645#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:14:04,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {11645#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11646#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:14:04,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {11646#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11647#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:14:04,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {11647#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11648#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:14:04,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {11648#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11649#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:14:04,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {11649#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11633#false} is VALID [2022-04-27 11:14:04,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {11633#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11633#false} is VALID [2022-04-27 11:14:04,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {11633#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11633#false} is VALID [2022-04-27 11:14:04,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {11633#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11633#false} is VALID [2022-04-27 11:14:04,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {11633#false} assume !(~y~0 % 4294967296 > 0); {11633#false} is VALID [2022-04-27 11:14:04,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {11633#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11633#false} is VALID [2022-04-27 11:14:04,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {11633#false} assume !(~x~0 % 4294967296 > 0); {11633#false} is VALID [2022-04-27 11:14:04,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {11633#false} assume !(~z~0 % 4294967296 > 0); {11633#false} is VALID [2022-04-27 11:14:04,689 INFO L272 TraceCheckUtils]: 27: Hoare triple {11633#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11633#false} is VALID [2022-04-27 11:14:04,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {11633#false} ~cond := #in~cond; {11633#false} is VALID [2022-04-27 11:14:04,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {11633#false} assume 0 == ~cond; {11633#false} is VALID [2022-04-27 11:14:04,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {11633#false} assume !false; {11633#false} is VALID [2022-04-27 11:14:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:14:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:04,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151389720] [2022-04-27 11:14:04,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151389720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:04,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597233509] [2022-04-27 11:14:04,689 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:14:04,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:04,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:04,691 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-27 11:14:04,691 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-27 11:14:04,935 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-04-27 11:14:04,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:04,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 11:14:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:04,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:05,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {11632#true} call ULTIMATE.init(); {11632#true} is VALID [2022-04-27 11:14:05,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {11632#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11632#true} is VALID [2022-04-27 11:14:05,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {11632#true} assume true; {11632#true} is VALID [2022-04-27 11:14:05,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11632#true} {11632#true} #83#return; {11632#true} is VALID [2022-04-27 11:14:05,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {11632#true} call #t~ret15 := main(); {11632#true} is VALID [2022-04-27 11:14:05,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {11632#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11632#true} is VALID [2022-04-27 11:14:05,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {11632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11632#true} is VALID [2022-04-27 11:14:05,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {11632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11632#true} is VALID [2022-04-27 11:14:05,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {11632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11632#true} is VALID [2022-04-27 11:14:05,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {11632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11632#true} is VALID [2022-04-27 11:14:05,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {11632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11684#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:05,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {11684#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11688#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:05,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {11688#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:05,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:05,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:05,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11688#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:05,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {11688#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11684#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:05,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {11684#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11708#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:05,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {11708#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11708#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:05,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {11708#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11633#false} is VALID [2022-04-27 11:14:05,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {11633#false} assume !(~z~0 % 4294967296 > 0); {11633#false} is VALID [2022-04-27 11:14:05,112 INFO L272 TraceCheckUtils]: 27: Hoare triple {11633#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11633#false} is VALID [2022-04-27 11:14:05,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {11633#false} ~cond := #in~cond; {11633#false} is VALID [2022-04-27 11:14:05,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {11633#false} assume 0 == ~cond; {11633#false} is VALID [2022-04-27 11:14:05,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {11633#false} assume !false; {11633#false} is VALID [2022-04-27 11:14:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:14:05,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:05,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {11633#false} assume !false; {11633#false} is VALID [2022-04-27 11:14:05,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {11633#false} assume 0 == ~cond; {11633#false} is VALID [2022-04-27 11:14:05,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {11633#false} ~cond := #in~cond; {11633#false} is VALID [2022-04-27 11:14:05,199 INFO L272 TraceCheckUtils]: 27: Hoare triple {11633#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11633#false} is VALID [2022-04-27 11:14:05,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {11633#false} assume !(~z~0 % 4294967296 > 0); {11633#false} is VALID [2022-04-27 11:14:05,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {11708#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11633#false} is VALID [2022-04-27 11:14:05,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11708#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:05,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {11708#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11712#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:05,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {11684#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11708#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:05,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {11688#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11684#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:05,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11688#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:05,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:05,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:05,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {11688#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11692#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:05,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {11684#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11688#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:05,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {11632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11684#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:05,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {11632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11632#true} is VALID [2022-04-27 11:14:05,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {11632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11632#true} is VALID [2022-04-27 11:14:05,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {11632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11632#true} is VALID [2022-04-27 11:14:05,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {11632#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11632#true} is VALID [2022-04-27 11:14:05,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {11632#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11632#true} is VALID [2022-04-27 11:14:05,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {11632#true} call #t~ret15 := main(); {11632#true} is VALID [2022-04-27 11:14:05,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11632#true} {11632#true} #83#return; {11632#true} is VALID [2022-04-27 11:14:05,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {11632#true} assume true; {11632#true} is VALID [2022-04-27 11:14:05,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {11632#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11632#true} is VALID [2022-04-27 11:14:05,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {11632#true} call ULTIMATE.init(); {11632#true} is VALID [2022-04-27 11:14:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:14:05,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597233509] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:05,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:05,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7, 7] total 21 [2022-04-27 11:14:05,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821601837] [2022-04-27 11:14:05,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:05,208 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 11:14:05,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:05,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:05,237 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-27 11:14:05,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 11:14:05,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:05,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 11:14:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2022-04-27 11:14:05,238 INFO L87 Difference]: Start difference. First operand 124 states and 157 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:10,831 INFO L93 Difference]: Finished difference Result 240 states and 320 transitions. [2022-04-27 11:14:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-27 11:14:10,831 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 11:14:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 173 transitions. [2022-04-27 11:14:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 173 transitions. [2022-04-27 11:14:10,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 173 transitions. [2022-04-27 11:14:11,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:11,064 INFO L225 Difference]: With dead ends: 240 [2022-04-27 11:14:11,064 INFO L226 Difference]: Without dead ends: 209 [2022-04-27 11:14:11,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2053 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=726, Invalid=6414, Unknown=0, NotChecked=0, Total=7140 [2022-04-27 11:14:11,066 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 154 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:11,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 116 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-27 11:14:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-27 11:14:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 134. [2022-04-27 11:14:11,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:11,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 134 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 129 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:11,357 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 134 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 129 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:11,357 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 134 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 129 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:11,359 INFO L93 Difference]: Finished difference Result 209 states and 271 transitions. [2022-04-27 11:14:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 271 transitions. [2022-04-27 11:14:11,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:11,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:11,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 129 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 209 states. [2022-04-27 11:14:11,360 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 129 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 209 states. [2022-04-27 11:14:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:11,362 INFO L93 Difference]: Finished difference Result 209 states and 271 transitions. [2022-04-27 11:14:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 271 transitions. [2022-04-27 11:14:11,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:11,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:11,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:11,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 129 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 168 transitions. [2022-04-27 11:14:11,364 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 168 transitions. Word has length 31 [2022-04-27 11:14:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:11,365 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 168 transitions. [2022-04-27 11:14:11,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 168 transitions. [2022-04-27 11:14:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:14:11,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:11,365 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:11,369 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-27 11:14:11,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:11,569 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:11,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1990656643, now seen corresponding path program 8 times [2022-04-27 11:14:11,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:11,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809149296] [2022-04-27 11:14:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:11,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:11,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:11,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {12911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12902#true} is VALID [2022-04-27 11:14:11,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {12902#true} assume true; {12902#true} is VALID [2022-04-27 11:14:11,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12902#true} {12902#true} #83#return; {12902#true} is VALID [2022-04-27 11:14:11,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {12902#true} call ULTIMATE.init(); {12911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:11,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {12911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12902#true} is VALID [2022-04-27 11:14:11,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {12902#true} assume true; {12902#true} is VALID [2022-04-27 11:14:11,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12902#true} {12902#true} #83#return; {12902#true} is VALID [2022-04-27 11:14:11,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {12902#true} call #t~ret15 := main(); {12902#true} is VALID [2022-04-27 11:14:11,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {12902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12902#true} is VALID [2022-04-27 11:14:11,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {12902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12902#true} is VALID [2022-04-27 11:14:11,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {12902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12902#true} is VALID [2022-04-27 11:14:11,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {12902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12902#true} is VALID [2022-04-27 11:14:11,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {12902#true} assume !(~x~0 % 4294967296 > 0); {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:11,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:11,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {12907#(<= 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; {12908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:14:11,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {12908#(<= 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; {12909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {12909#(<= 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; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {12909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:14:11,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {12908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:11,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12903#false} is VALID [2022-04-27 11:14:11,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {12903#false} assume !(~x~0 % 4294967296 > 0); {12903#false} is VALID [2022-04-27 11:14:11,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {12903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12903#false} is VALID [2022-04-27 11:14:11,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {12903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12903#false} is VALID [2022-04-27 11:14:11,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {12903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12903#false} is VALID [2022-04-27 11:14:11,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {12903#false} assume !(~z~0 % 4294967296 > 0); {12903#false} is VALID [2022-04-27 11:14:11,659 INFO L272 TraceCheckUtils]: 28: Hoare triple {12903#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12903#false} is VALID [2022-04-27 11:14:11,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {12903#false} ~cond := #in~cond; {12903#false} is VALID [2022-04-27 11:14:11,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {12903#false} assume 0 == ~cond; {12903#false} is VALID [2022-04-27 11:14:11,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {12903#false} assume !false; {12903#false} is VALID [2022-04-27 11:14:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:14:11,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:11,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809149296] [2022-04-27 11:14:11,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809149296] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:11,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398637024] [2022-04-27 11:14:11,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:14:11,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:11,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:11,661 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-27 11:14:11,682 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-27 11:14:11,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:14:11,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:11,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:14:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:11,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:11,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {12902#true} call ULTIMATE.init(); {12902#true} is VALID [2022-04-27 11:14:11,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {12902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12902#true} is VALID [2022-04-27 11:14:11,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {12902#true} assume true; {12902#true} is VALID [2022-04-27 11:14:11,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12902#true} {12902#true} #83#return; {12902#true} is VALID [2022-04-27 11:14:11,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {12902#true} call #t~ret15 := main(); {12902#true} is VALID [2022-04-27 11:14:11,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {12902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12902#true} is VALID [2022-04-27 11:14:11,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {12902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12902#true} is VALID [2022-04-27 11:14:11,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {12902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12902#true} is VALID [2022-04-27 11:14:11,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {12902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12902#true} is VALID [2022-04-27 11:14:11,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {12902#true} assume !(~x~0 % 4294967296 > 0); {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:11,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:11,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {12907#(<= 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; {12908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:14:11,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {12908#(<= 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; {12909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {12909#(<= 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; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:11,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {12909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:14:11,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {12908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:11,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12903#false} is VALID [2022-04-27 11:14:11,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {12903#false} assume !(~x~0 % 4294967296 > 0); {12903#false} is VALID [2022-04-27 11:14:11,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {12903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12903#false} is VALID [2022-04-27 11:14:11,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {12903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12903#false} is VALID [2022-04-27 11:14:11,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {12903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12903#false} is VALID [2022-04-27 11:14:11,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {12903#false} assume !(~z~0 % 4294967296 > 0); {12903#false} is VALID [2022-04-27 11:14:11,889 INFO L272 TraceCheckUtils]: 28: Hoare triple {12903#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12903#false} is VALID [2022-04-27 11:14:11,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {12903#false} ~cond := #in~cond; {12903#false} is VALID [2022-04-27 11:14:11,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {12903#false} assume 0 == ~cond; {12903#false} is VALID [2022-04-27 11:14:11,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {12903#false} assume !false; {12903#false} is VALID [2022-04-27 11:14:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:14:11,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:12,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {12903#false} assume !false; {12903#false} is VALID [2022-04-27 11:14:12,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {12903#false} assume 0 == ~cond; {12903#false} is VALID [2022-04-27 11:14:12,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {12903#false} ~cond := #in~cond; {12903#false} is VALID [2022-04-27 11:14:12,075 INFO L272 TraceCheckUtils]: 28: Hoare triple {12903#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12903#false} is VALID [2022-04-27 11:14:12,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {12903#false} assume !(~z~0 % 4294967296 > 0); {12903#false} is VALID [2022-04-27 11:14:12,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {12903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12903#false} is VALID [2022-04-27 11:14:12,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {12903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12903#false} is VALID [2022-04-27 11:14:12,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {12903#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12903#false} is VALID [2022-04-27 11:14:12,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {12903#false} assume !(~x~0 % 4294967296 > 0); {12903#false} is VALID [2022-04-27 11:14:12,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12903#false} is VALID [2022-04-27 11:14:12,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {12908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:12,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {12909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:14:12,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:12,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:12,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:12,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:12,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:12,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:12,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {12909#(<= 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; {12910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:12,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {12908#(<= 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; {12909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:12,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {12907#(<= 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; {12908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:14:12,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:12,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {12902#true} assume !(~x~0 % 4294967296 > 0); {12907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:12,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {12902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12902#true} is VALID [2022-04-27 11:14:12,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {12902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12902#true} is VALID [2022-04-27 11:14:12,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {12902#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12902#true} is VALID [2022-04-27 11:14:12,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {12902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12902#true} is VALID [2022-04-27 11:14:12,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {12902#true} call #t~ret15 := main(); {12902#true} is VALID [2022-04-27 11:14:12,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12902#true} {12902#true} #83#return; {12902#true} is VALID [2022-04-27 11:14:12,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {12902#true} assume true; {12902#true} is VALID [2022-04-27 11:14:12,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {12902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12902#true} is VALID [2022-04-27 11:14:12,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {12902#true} call ULTIMATE.init(); {12902#true} is VALID [2022-04-27 11:14:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:14:12,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398637024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:12,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:12,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-27 11:14:12,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381318528] [2022-04-27 11:14:12,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:12,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:14:12,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:12,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:12,113 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-27 11:14:12,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:14:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:12,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:14:12,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:14:12,113 INFO L87 Difference]: Start difference. First operand 134 states and 168 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:12,576 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2022-04-27 11:14:12,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:14:12,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:14:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 11:14:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 11:14:12,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-27 11:14:12,609 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-27 11:14:12,610 INFO L225 Difference]: With dead ends: 146 [2022-04-27 11:14:12,610 INFO L226 Difference]: Without dead ends: 121 [2022-04-27 11:14:12,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:14:12,610 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:12,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 44 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:14:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-27 11:14:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-27 11:14:12,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:12,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:12,865 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:12,865 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:12,866 INFO L93 Difference]: Finished difference Result 121 states and 153 transitions. [2022-04-27 11:14:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-27 11:14:12,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:12,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:12,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-27 11:14:12,866 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-27 11:14:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:12,867 INFO L93 Difference]: Finished difference Result 121 states and 153 transitions. [2022-04-27 11:14:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-27 11:14:12,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:12,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:12,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:12,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2022-04-27 11:14:12,869 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 32 [2022-04-27 11:14:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:12,869 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2022-04-27 11:14:12,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-27 11:14:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:14:12,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:12,870 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:12,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 11:14:13,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:13,079 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:13,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:13,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1032467933, now seen corresponding path program 5 times [2022-04-27 11:14:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:13,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579406341] [2022-04-27 11:14:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:13,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:13,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {13758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13740#true} is VALID [2022-04-27 11:14:13,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {13740#true} assume true; {13740#true} is VALID [2022-04-27 11:14:13,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13740#true} {13740#true} #83#return; {13740#true} is VALID [2022-04-27 11:14:13,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {13740#true} call ULTIMATE.init(); {13758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:13,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {13758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13740#true} is VALID [2022-04-27 11:14:13,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {13740#true} assume true; {13740#true} is VALID [2022-04-27 11:14:13,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13740#true} {13740#true} #83#return; {13740#true} is VALID [2022-04-27 11:14:13,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {13740#true} call #t~ret15 := main(); {13740#true} is VALID [2022-04-27 11:14:13,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {13740#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13745#(= main_~y~0 0)} is VALID [2022-04-27 11:14:13,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {13745#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13746#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:13,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {13746#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13747#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:13,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {13747#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13748#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:13,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {13748#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13749#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:13,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {13749#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13750#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:13,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {13750#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {13750#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:13,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {13750#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {13751#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:14:13,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {13751#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13752#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:14:13,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {13752#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13753#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:13,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {13753#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13754#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:13,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {13754#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13755#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:14:13,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {13755#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13756#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:14:13,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {13756#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13756#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:14:13,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {13756#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13755#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:14:13,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {13755#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13754#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:13,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {13754#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13753#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:13,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {13753#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13752#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:14:13,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {13752#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13751#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:14:13,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {13751#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {13751#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:14:13,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {13751#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {13751#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:14:13,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {13751#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13757#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:14:13,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {13757#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {13741#false} is VALID [2022-04-27 11:14:13,281 INFO L272 TraceCheckUtils]: 28: Hoare triple {13741#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13741#false} is VALID [2022-04-27 11:14:13,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {13741#false} ~cond := #in~cond; {13741#false} is VALID [2022-04-27 11:14:13,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {13741#false} assume 0 == ~cond; {13741#false} is VALID [2022-04-27 11:14:13,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {13741#false} assume !false; {13741#false} is VALID [2022-04-27 11:14:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:14:13,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:13,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579406341] [2022-04-27 11:14:13,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579406341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:13,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198336669] [2022-04-27 11:14:13,281 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:14:13,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:13,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:13,282 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-27 11:14:13,283 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-27 11:14:13,405 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:14:13,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:13,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:14:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:13,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:13,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {13740#true} call ULTIMATE.init(); {13740#true} is VALID [2022-04-27 11:14:13,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {13740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13740#true} is VALID [2022-04-27 11:14:13,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {13740#true} assume true; {13740#true} is VALID [2022-04-27 11:14:13,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13740#true} {13740#true} #83#return; {13740#true} is VALID [2022-04-27 11:14:13,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {13740#true} call #t~ret15 := main(); {13740#true} is VALID [2022-04-27 11:14:13,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {13740#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13740#true} is VALID [2022-04-27 11:14:13,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {13740#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13780#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:13,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {13780#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13784#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:13,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {13784#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13788#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:13,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {13788#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13792#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:13,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {13792#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:13,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:13,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:13,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13792#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:13,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {13792#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13788#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:13,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {13788#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13784#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:13,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {13784#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13780#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:13,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {13780#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {13741#false} is VALID [2022-04-27 11:14:13,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {13741#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13741#false} is VALID [2022-04-27 11:14:13,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {13741#false} assume !(~z~0 % 4294967296 > 0); {13741#false} is VALID [2022-04-27 11:14:13,610 INFO L272 TraceCheckUtils]: 28: Hoare triple {13741#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13741#false} is VALID [2022-04-27 11:14:13,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {13741#false} ~cond := #in~cond; {13741#false} is VALID [2022-04-27 11:14:13,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {13741#false} assume 0 == ~cond; {13741#false} is VALID [2022-04-27 11:14:13,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {13741#false} assume !false; {13741#false} is VALID [2022-04-27 11:14:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:14:13,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:13,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {13741#false} assume !false; {13741#false} is VALID [2022-04-27 11:14:13,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {13741#false} assume 0 == ~cond; {13741#false} is VALID [2022-04-27 11:14:13,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {13741#false} ~cond := #in~cond; {13741#false} is VALID [2022-04-27 11:14:13,704 INFO L272 TraceCheckUtils]: 28: Hoare triple {13741#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {13741#false} is VALID [2022-04-27 11:14:13,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {13741#false} assume !(~z~0 % 4294967296 > 0); {13741#false} is VALID [2022-04-27 11:14:13,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {13741#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13741#false} is VALID [2022-04-27 11:14:13,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {13741#false} is VALID [2022-04-27 11:14:13,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {13818#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {13780#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13818#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:13,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {13784#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13780#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:13,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {13788#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13784#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:13,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {13792#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13788#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:13,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13792#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:13,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:13,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:13,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {13792#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13796#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:13,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {13788#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13792#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:13,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {13784#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13788#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:13,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {13780#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13784#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:13,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {13740#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13780#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:13,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {13740#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13740#true} is VALID [2022-04-27 11:14:13,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {13740#true} call #t~ret15 := main(); {13740#true} is VALID [2022-04-27 11:14:13,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13740#true} {13740#true} #83#return; {13740#true} is VALID [2022-04-27 11:14:13,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {13740#true} assume true; {13740#true} is VALID [2022-04-27 11:14:13,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {13740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13740#true} is VALID [2022-04-27 11:14:13,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {13740#true} call ULTIMATE.init(); {13740#true} is VALID [2022-04-27 11:14:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:14:13,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198336669] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:13,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:13,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-27 11:14:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081835646] [2022-04-27 11:14:13,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:13,713 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:14:13,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:13,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:13,747 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-27 11:14:13,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:14:13,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:13,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:14:13,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:14:13,748 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:25,074 INFO L93 Difference]: Finished difference Result 223 states and 305 transitions. [2022-04-27 11:14:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-04-27 11:14:25,074 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:14:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 183 transitions. [2022-04-27 11:14:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 183 transitions. [2022-04-27 11:14:25,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 183 transitions. [2022-04-27 11:14:25,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:25,474 INFO L225 Difference]: With dead ends: 223 [2022-04-27 11:14:25,474 INFO L226 Difference]: Without dead ends: 203 [2022-04-27 11:14:25,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2590 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1028, Invalid=7902, Unknown=0, NotChecked=0, Total=8930 [2022-04-27 11:14:25,476 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 145 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:25,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 117 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-27 11:14:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-27 11:14:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 146. [2022-04-27 11:14:25,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:25,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 146 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,768 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 146 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,768 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 146 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:25,770 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2022-04-27 11:14:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2022-04-27 11:14:25,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:25,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:25,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-27 11:14:25,771 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-27 11:14:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:25,773 INFO L93 Difference]: Finished difference Result 203 states and 251 transitions. [2022-04-27 11:14:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2022-04-27 11:14:25,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:25,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:25,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:25,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 182 transitions. [2022-04-27 11:14:25,775 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 182 transitions. Word has length 32 [2022-04-27 11:14:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:25,775 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 182 transitions. [2022-04-27 11:14:25,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions. [2022-04-27 11:14:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 11:14:25,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:25,775 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:25,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-27 11:14:25,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-27 11:14:25,979 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash -38925857, now seen corresponding path program 6 times [2022-04-27 11:14:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:25,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649390787] [2022-04-27 11:14:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:26,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:26,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {15021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15003#true} is VALID [2022-04-27 11:14:26,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {15003#true} assume true; {15003#true} is VALID [2022-04-27 11:14:26,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15003#true} {15003#true} #83#return; {15003#true} is VALID [2022-04-27 11:14:26,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {15003#true} call ULTIMATE.init(); {15021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:26,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {15021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15003#true} is VALID [2022-04-27 11:14:26,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {15003#true} assume true; {15003#true} is VALID [2022-04-27 11:14:26,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15003#true} {15003#true} #83#return; {15003#true} is VALID [2022-04-27 11:14:26,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {15003#true} call #t~ret15 := main(); {15003#true} is VALID [2022-04-27 11:14:26,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {15003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15008#(= main_~y~0 0)} is VALID [2022-04-27 11:14:26,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {15008#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15009#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:26,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {15009#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15010#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:26,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {15010#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15011#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:26,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {15011#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15012#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:26,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {15012#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15013#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:26,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {15013#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15014#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:14:26,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {15014#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15015#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:26,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {15015#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:26,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:26,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {15017#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:14:26,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {15017#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15018#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:14:26,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {15018#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15019#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {15019#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15020#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {15020#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15004#false} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {15004#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15004#false} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {15004#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15004#false} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {15004#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15004#false} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {15004#false} assume !(~y~0 % 4294967296 > 0); {15004#false} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {15004#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15004#false} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {15004#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15004#false} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {15004#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15004#false} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {15004#false} assume !(~x~0 % 4294967296 > 0); {15004#false} is VALID [2022-04-27 11:14:26,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {15004#false} assume !(~z~0 % 4294967296 > 0); {15004#false} is VALID [2022-04-27 11:14:26,175 INFO L272 TraceCheckUtils]: 29: Hoare triple {15004#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15004#false} is VALID [2022-04-27 11:14:26,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {15004#false} ~cond := #in~cond; {15004#false} is VALID [2022-04-27 11:14:26,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {15004#false} assume 0 == ~cond; {15004#false} is VALID [2022-04-27 11:14:26,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {15004#false} assume !false; {15004#false} is VALID [2022-04-27 11:14:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:14:26,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:26,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649390787] [2022-04-27 11:14:26,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649390787] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:26,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709498747] [2022-04-27 11:14:26,175 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:14:26,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:26,176 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-27 11:14:26,180 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-27 11:14:26,237 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-27 11:14:26,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:26,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 11:14:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:26,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:26,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {15003#true} call ULTIMATE.init(); {15003#true} is VALID [2022-04-27 11:14:26,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {15003#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15003#true} is VALID [2022-04-27 11:14:26,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {15003#true} assume true; {15003#true} is VALID [2022-04-27 11:14:26,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15003#true} {15003#true} #83#return; {15003#true} is VALID [2022-04-27 11:14:26,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {15003#true} call #t~ret15 := main(); {15003#true} is VALID [2022-04-27 11:14:26,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {15003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15008#(= main_~y~0 0)} is VALID [2022-04-27 11:14:26,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {15008#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15009#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:26,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {15009#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15010#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:26,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {15010#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15011#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:26,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {15011#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15012#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:26,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {15012#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15013#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:26,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {15013#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15014#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:14:26,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {15014#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15015#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:26,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {15015#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:26,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:26,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:26,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:26,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:26,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:26,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:26,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {15016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15015#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:26,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {15015#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15014#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:14:26,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {15014#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15013#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:26,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {15013#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~y~0 % 4294967296 > 0); {15004#false} is VALID [2022-04-27 11:14:26,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {15004#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15004#false} is VALID [2022-04-27 11:14:26,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {15004#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15004#false} is VALID [2022-04-27 11:14:26,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {15004#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15004#false} is VALID [2022-04-27 11:14:26,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {15004#false} assume !(~x~0 % 4294967296 > 0); {15004#false} is VALID [2022-04-27 11:14:26,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {15004#false} assume !(~z~0 % 4294967296 > 0); {15004#false} is VALID [2022-04-27 11:14:26,460 INFO L272 TraceCheckUtils]: 29: Hoare triple {15004#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15004#false} is VALID [2022-04-27 11:14:26,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {15004#false} ~cond := #in~cond; {15004#false} is VALID [2022-04-27 11:14:26,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {15004#false} assume 0 == ~cond; {15004#false} is VALID [2022-04-27 11:14:26,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {15004#false} assume !false; {15004#false} is VALID [2022-04-27 11:14:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:14:26,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:26,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {15004#false} assume !false; {15004#false} is VALID [2022-04-27 11:14:26,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {15004#false} assume 0 == ~cond; {15004#false} is VALID [2022-04-27 11:14:26,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {15004#false} ~cond := #in~cond; {15004#false} is VALID [2022-04-27 11:14:26,688 INFO L272 TraceCheckUtils]: 29: Hoare triple {15004#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15004#false} is VALID [2022-04-27 11:14:26,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {15004#false} assume !(~z~0 % 4294967296 > 0); {15004#false} is VALID [2022-04-27 11:14:26,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {15004#false} assume !(~x~0 % 4294967296 > 0); {15004#false} is VALID [2022-04-27 11:14:26,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {15004#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15004#false} is VALID [2022-04-27 11:14:26,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {15004#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15004#false} is VALID [2022-04-27 11:14:26,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {15004#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15004#false} is VALID [2022-04-27 11:14:26,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {15148#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {15004#false} is VALID [2022-04-27 11:14:26,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {15152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15148#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:14:26,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {15156#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:26,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15156#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:26,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:26,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:26,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:26,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:26,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:26,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:26,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {15156#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15160#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:26,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {15152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15156#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:26,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {15148#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:26,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {15191#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15148#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:14:26,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {15195#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15191#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:14:26,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {15199#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15195#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:14:26,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {15203#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15199#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:14:26,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {15207#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15203#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:14:26,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {15003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15207#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:14:26,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {15003#true} call #t~ret15 := main(); {15003#true} is VALID [2022-04-27 11:14:26,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15003#true} {15003#true} #83#return; {15003#true} is VALID [2022-04-27 11:14:26,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {15003#true} assume true; {15003#true} is VALID [2022-04-27 11:14:26,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {15003#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15003#true} is VALID [2022-04-27 11:14:26,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {15003#true} call ULTIMATE.init(); {15003#true} is VALID [2022-04-27 11:14:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:14:26,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709498747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:26,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:26,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 25 [2022-04-27 11:14:26,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103161468] [2022-04-27 11:14:26,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:26,699 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:14:26,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:26,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:26,734 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-27 11:14:26,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 11:14:26,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:26,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 11:14:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:14:26,735 INFO L87 Difference]: Start difference. First operand 146 states and 182 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:41,732 INFO L93 Difference]: Finished difference Result 727 states and 998 transitions. [2022-04-27 11:14:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-04-27 11:14:41,733 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:14:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 434 transitions. [2022-04-27 11:14:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 434 transitions. [2022-04-27 11:14:41,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 434 transitions. [2022-04-27 11:14:43,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:43,360 INFO L225 Difference]: With dead ends: 727 [2022-04-27 11:14:43,360 INFO L226 Difference]: Without dead ends: 697 [2022-04-27 11:14:43,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4703 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3039, Invalid=9843, Unknown=0, NotChecked=0, Total=12882 [2022-04-27 11:14:43,362 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 693 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 677 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:43,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 124 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [677 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 11:14:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-04-27 11:14:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 202. [2022-04-27 11:14:43,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:43,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 697 states. Second operand has 202 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 197 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:43,792 INFO L74 IsIncluded]: Start isIncluded. First operand 697 states. Second operand has 202 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 197 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:43,792 INFO L87 Difference]: Start difference. First operand 697 states. Second operand has 202 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 197 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:43,805 INFO L93 Difference]: Finished difference Result 697 states and 921 transitions. [2022-04-27 11:14:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 921 transitions. [2022-04-27 11:14:43,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:43,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:43,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 197 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 697 states. [2022-04-27 11:14:43,807 INFO L87 Difference]: Start difference. First operand has 202 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 197 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 697 states. [2022-04-27 11:14:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:43,821 INFO L93 Difference]: Finished difference Result 697 states and 921 transitions. [2022-04-27 11:14:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 921 transitions. [2022-04-27 11:14:43,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:43,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:43,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:43,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 197 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 256 transitions. [2022-04-27 11:14:43,825 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 256 transitions. Word has length 33 [2022-04-27 11:14:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:43,825 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 256 transitions. [2022-04-27 11:14:43,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 256 transitions. [2022-04-27 11:14:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 11:14:43,825 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:43,826 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:43,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 11:14:44,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-27 11:14:44,043 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash 74673410, now seen corresponding path program 9 times [2022-04-27 11:14:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:44,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264879472] [2022-04-27 11:14:44,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:44,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:44,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {18024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18012#true} is VALID [2022-04-27 11:14:44,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {18012#true} assume true; {18012#true} is VALID [2022-04-27 11:14:44,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18012#true} {18012#true} #83#return; {18012#true} is VALID [2022-04-27 11:14:44,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {18012#true} call ULTIMATE.init(); {18024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:44,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {18024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18012#true} is VALID [2022-04-27 11:14:44,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {18012#true} assume true; {18012#true} is VALID [2022-04-27 11:14:44,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18012#true} {18012#true} #83#return; {18012#true} is VALID [2022-04-27 11:14:44,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {18012#true} call #t~ret15 := main(); {18012#true} is VALID [2022-04-27 11:14:44,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {18012#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18012#true} is VALID [2022-04-27 11:14:44,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {18012#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18012#true} is VALID [2022-04-27 11:14:44,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {18012#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18012#true} is VALID [2022-04-27 11:14:44,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {18012#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18012#true} is VALID [2022-04-27 11:14:44,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {18012#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18012#true} is VALID [2022-04-27 11:14:44,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {18012#true} assume !(~x~0 % 4294967296 > 0); {18017#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:14:44,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {18017#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {18017#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:14:44,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {18017#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18018#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:14:44,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {18018#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18019#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:14:44,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {18019#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18020#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:14:44,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {18020#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:14:44,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:14:44,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:14:44,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:14:44,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:14:44,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:14:44,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:14:44,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {18021#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18022#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:14:44,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {18022#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18023#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:14:44,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {18023#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {18013#false} is VALID [2022-04-27 11:14:44,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {18013#false} assume !(~z~0 % 4294967296 > 0); {18013#false} is VALID [2022-04-27 11:14:44,167 INFO L272 TraceCheckUtils]: 30: Hoare triple {18013#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18013#false} is VALID [2022-04-27 11:14:44,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {18013#false} ~cond := #in~cond; {18013#false} is VALID [2022-04-27 11:14:44,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {18013#false} assume 0 == ~cond; {18013#false} is VALID [2022-04-27 11:14:44,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {18013#false} assume !false; {18013#false} is VALID [2022-04-27 11:14:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 11:14:44,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:44,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264879472] [2022-04-27 11:14:44,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264879472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:44,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790830165] [2022-04-27 11:14:44,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:14:44,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:44,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:44,169 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-27 11:14:44,170 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-27 11:14:44,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:14:44,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:44,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:14:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:44,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:44,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {18012#true} call ULTIMATE.init(); {18012#true} is VALID [2022-04-27 11:14:44,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {18012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18012#true} is VALID [2022-04-27 11:14:44,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {18012#true} assume true; {18012#true} is VALID [2022-04-27 11:14:44,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18012#true} {18012#true} #83#return; {18012#true} is VALID [2022-04-27 11:14:44,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {18012#true} call #t~ret15 := main(); {18012#true} is VALID [2022-04-27 11:14:44,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {18012#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18012#true} is VALID [2022-04-27 11:14:44,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {18012#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18012#true} is VALID [2022-04-27 11:14:44,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {18012#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18012#true} is VALID [2022-04-27 11:14:44,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {18012#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18052#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:44,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {18052#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:44,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:44,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:44,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18052#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:44,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {18052#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18069#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:44,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {18069#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18073#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:44,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {18073#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~y~0 % 4294967296 > 0); {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18073#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:44,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {18073#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18069#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:44,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {18069#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18013#false} is VALID [2022-04-27 11:14:44,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {18013#false} assume !(~z~0 % 4294967296 > 0); {18013#false} is VALID [2022-04-27 11:14:44,398 INFO L272 TraceCheckUtils]: 30: Hoare triple {18013#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18013#false} is VALID [2022-04-27 11:14:44,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {18013#false} ~cond := #in~cond; {18013#false} is VALID [2022-04-27 11:14:44,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {18013#false} assume 0 == ~cond; {18013#false} is VALID [2022-04-27 11:14:44,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {18013#false} assume !false; {18013#false} is VALID [2022-04-27 11:14:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-27 11:14:44,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:44,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {18013#false} assume !false; {18013#false} is VALID [2022-04-27 11:14:44,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {18013#false} assume 0 == ~cond; {18013#false} is VALID [2022-04-27 11:14:44,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {18013#false} ~cond := #in~cond; {18013#false} is VALID [2022-04-27 11:14:44,487 INFO L272 TraceCheckUtils]: 30: Hoare triple {18013#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18013#false} is VALID [2022-04-27 11:14:44,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {18013#false} assume !(~z~0 % 4294967296 > 0); {18013#false} is VALID [2022-04-27 11:14:44,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {18013#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18013#false} is VALID [2022-04-27 11:14:44,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {18069#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18013#false} is VALID [2022-04-27 11:14:44,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {18073#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18069#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:44,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18073#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:44,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~y~0 % 4294967296 > 0); {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {18073#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18077#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:44,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {18069#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18073#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:44,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {18052#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18069#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:44,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18052#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:44,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:44,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:44,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {18052#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18056#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:44,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {18012#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18052#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:44,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {18012#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18012#true} is VALID [2022-04-27 11:14:44,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {18012#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18012#true} is VALID [2022-04-27 11:14:44,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {18012#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18012#true} is VALID [2022-04-27 11:14:44,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {18012#true} call #t~ret15 := main(); {18012#true} is VALID [2022-04-27 11:14:44,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18012#true} {18012#true} #83#return; {18012#true} is VALID [2022-04-27 11:14:44,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {18012#true} assume true; {18012#true} is VALID [2022-04-27 11:14:44,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {18012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18012#true} is VALID [2022-04-27 11:14:44,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {18012#true} call ULTIMATE.init(); {18012#true} is VALID [2022-04-27 11:14:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-27 11:14:44,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790830165] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:44,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:44,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-04-27 11:14:44,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349366952] [2022-04-27 11:14:44,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:44,497 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-27 11:14:44,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:44,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:44,529 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-27 11:14:44,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:14:44,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:14:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:14:44,531 INFO L87 Difference]: Start difference. First operand 202 states and 256 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:45,685 INFO L93 Difference]: Finished difference Result 326 states and 431 transitions. [2022-04-27 11:14:45,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 11:14:45,685 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-27 11:14:45,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 94 transitions. [2022-04-27 11:14:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 94 transitions. [2022-04-27 11:14:45,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 94 transitions. [2022-04-27 11:14:45,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:45,811 INFO L225 Difference]: With dead ends: 326 [2022-04-27 11:14:45,811 INFO L226 Difference]: Without dead ends: 309 [2022-04-27 11:14:45,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:14:45,811 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 117 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:45,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 50 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:14:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-27 11:14:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 268. [2022-04-27 11:14:46,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:46,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 268 states, 263 states have (on average 1.3231939163498099) internal successors, (348), 263 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:46,345 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 268 states, 263 states have (on average 1.3231939163498099) internal successors, (348), 263 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:46,345 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 268 states, 263 states have (on average 1.3231939163498099) internal successors, (348), 263 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:46,349 INFO L93 Difference]: Finished difference Result 309 states and 397 transitions. [2022-04-27 11:14:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 397 transitions. [2022-04-27 11:14:46,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:46,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:46,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.3231939163498099) internal successors, (348), 263 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 309 states. [2022-04-27 11:14:46,350 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.3231939163498099) internal successors, (348), 263 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 309 states. [2022-04-27 11:14:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:46,353 INFO L93 Difference]: Finished difference Result 309 states and 397 transitions. [2022-04-27 11:14:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 397 transitions. [2022-04-27 11:14:46,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:46,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:46,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:46,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.3231939163498099) internal successors, (348), 263 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 352 transitions. [2022-04-27 11:14:46,357 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 352 transitions. Word has length 34 [2022-04-27 11:14:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:46,358 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 352 transitions. [2022-04-27 11:14:46,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 352 transitions. [2022-04-27 11:14:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:14:46,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:46,358 INFO L195 NwaCegarLoop]: trace histogram [9, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:46,376 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-27 11:14:46,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-27 11:14:46,579 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:46,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash -452274769, now seen corresponding path program 7 times [2022-04-27 11:14:46,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:46,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418211948] [2022-04-27 11:14:46,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:46,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:46,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:46,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {19710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19691#true} is VALID [2022-04-27 11:14:46,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {19691#true} assume true; {19691#true} is VALID [2022-04-27 11:14:46,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19691#true} {19691#true} #83#return; {19691#true} is VALID [2022-04-27 11:14:46,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {19691#true} call ULTIMATE.init(); {19710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:46,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {19710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19691#true} is VALID [2022-04-27 11:14:46,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {19691#true} assume true; {19691#true} is VALID [2022-04-27 11:14:46,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19691#true} {19691#true} #83#return; {19691#true} is VALID [2022-04-27 11:14:46,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {19691#true} call #t~ret15 := main(); {19691#true} is VALID [2022-04-27 11:14:46,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {19691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19696#(= main_~y~0 0)} is VALID [2022-04-27 11:14:46,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {19696#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19697#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:46,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {19697#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19698#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:46,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {19698#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19699#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:46,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {19699#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19700#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:46,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {19700#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:46,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {19701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19702#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:14:46,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {19702#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19703#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:46,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {19703#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19704#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:46,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {19704#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19705#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:14:46,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {19705#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {19705#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:14:46,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {19705#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {19706#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:14:46,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {19706#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:14:46,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {19707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:14:46,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {19708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19709#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:14:46,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {19709#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {19692#false} assume !(~y~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {19692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {19692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {19692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {19692#false} assume !(~x~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {19692#false} assume !(~z~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L272 TraceCheckUtils]: 31: Hoare triple {19692#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {19692#false} ~cond := #in~cond; {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {19692#false} assume 0 == ~cond; {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {19692#false} assume !false; {19692#false} is VALID [2022-04-27 11:14:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:14:46,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:46,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418211948] [2022-04-27 11:14:46,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418211948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:46,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542953303] [2022-04-27 11:14:46,788 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:14:46,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:46,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:46,789 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-27 11:14:46,791 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-27 11:14:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:46,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 11:14:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:46,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:47,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {19691#true} call ULTIMATE.init(); {19691#true} is VALID [2022-04-27 11:14:47,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {19691#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19691#true} is VALID [2022-04-27 11:14:47,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {19691#true} assume true; {19691#true} is VALID [2022-04-27 11:14:47,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19691#true} {19691#true} #83#return; {19691#true} is VALID [2022-04-27 11:14:47,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {19691#true} call #t~ret15 := main(); {19691#true} is VALID [2022-04-27 11:14:47,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {19691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19696#(= main_~y~0 0)} is VALID [2022-04-27 11:14:47,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {19696#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19697#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:47,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {19697#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19698#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:47,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {19698#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19699#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:47,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {19699#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19700#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:47,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {19700#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:47,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {19701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19702#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:14:47,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {19702#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19703#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:47,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {19703#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19704#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:47,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {19704#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19705#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:14:47,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {19705#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {19705#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:14:47,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {19705#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {19706#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:14:47,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {19706#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:14:47,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {19707#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:14:47,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {19708#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19771#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:14:47,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {19771#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:47,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {19692#false} assume !(~y~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {19692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {19692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {19692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {19692#false} assume !(~x~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {19692#false} assume !(~z~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L272 TraceCheckUtils]: 31: Hoare triple {19692#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {19692#false} ~cond := #in~cond; {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {19692#false} assume 0 == ~cond; {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {19692#false} assume !false; {19692#false} is VALID [2022-04-27 11:14:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:14:47,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:47,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {19692#false} assume !false; {19692#false} is VALID [2022-04-27 11:14:47,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {19692#false} assume 0 == ~cond; {19692#false} is VALID [2022-04-27 11:14:47,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {19692#false} ~cond := #in~cond; {19692#false} is VALID [2022-04-27 11:14:47,429 INFO L272 TraceCheckUtils]: 31: Hoare triple {19692#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19692#false} is VALID [2022-04-27 11:14:47,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {19692#false} assume !(~z~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:47,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {19692#false} assume !(~x~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:47,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {19692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19692#false} is VALID [2022-04-27 11:14:47,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {19692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19692#false} is VALID [2022-04-27 11:14:47,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {19692#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19692#false} is VALID [2022-04-27 11:14:47,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {19692#false} assume !(~y~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:47,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:47,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:47,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:47,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {19692#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19692#false} is VALID [2022-04-27 11:14:47,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {19859#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {19692#false} is VALID [2022-04-27 11:14:47,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {19863#(< 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; {19859#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:14:47,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {19867#(< 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; {19863#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:47,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {19871#(< 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; {19867#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:47,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {19875#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {19871#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:47,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {19875#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {19875#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:47,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {19882#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19875#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:47,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {19886#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19882#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:47,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {19890#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19886#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:47,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {19894#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19890#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:14:47,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {19898#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19894#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:14:47,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {19902#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19898#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:14:47,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {19906#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19902#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:14:47,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {19910#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19906#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:14:47,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {19914#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19910#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:14:47,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {19691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19914#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:14:47,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {19691#true} call #t~ret15 := main(); {19691#true} is VALID [2022-04-27 11:14:47,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19691#true} {19691#true} #83#return; {19691#true} is VALID [2022-04-27 11:14:47,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {19691#true} assume true; {19691#true} is VALID [2022-04-27 11:14:47,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {19691#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19691#true} is VALID [2022-04-27 11:14:47,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {19691#true} call ULTIMATE.init(); {19691#true} is VALID [2022-04-27 11:14:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:14:47,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542953303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:47,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:47,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-27 11:14:47,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502787944] [2022-04-27 11:14:47,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.40625) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:14:47,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:47,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.40625) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:47,468 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-27 11:14:47,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 11:14:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:47,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 11:14:47,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2022-04-27 11:14:47,469 INFO L87 Difference]: Start difference. First operand 268 states and 352 transitions. Second operand has 32 states, 32 states have (on average 1.40625) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:37,341 INFO L93 Difference]: Finished difference Result 1037 states and 1462 transitions. [2022-04-27 11:16:37,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2022-04-27 11:16:37,342 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.40625) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:16:37,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:16:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.40625) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 707 transitions. [2022-04-27 11:16:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.40625) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 707 transitions. [2022-04-27 11:16:37,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 707 transitions. [2022-04-27 11:16:40,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 707 edges. 707 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:40,607 INFO L225 Difference]: With dead ends: 1037 [2022-04-27 11:16:40,607 INFO L226 Difference]: Without dead ends: 963 [2022-04-27 11:16:40,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60520 ImplicationChecksByTransitivity, 91.9s TimeCoverageRelationStatistics Valid=21899, Invalid=104481, Unknown=0, NotChecked=0, Total=126380 [2022-04-27 11:16:40,615 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 901 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 1679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 3649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1679 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:16:40,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 135 Invalid, 3649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1679 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-04-27 11:16:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-04-27 11:16:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 308. [2022-04-27 11:16:41,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:16:41,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 963 states. Second operand has 308 states, 303 states have (on average 1.33003300330033) internal successors, (403), 303 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:41,249 INFO L74 IsIncluded]: Start isIncluded. First operand 963 states. Second operand has 308 states, 303 states have (on average 1.33003300330033) internal successors, (403), 303 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:41,250 INFO L87 Difference]: Start difference. First operand 963 states. Second operand has 308 states, 303 states have (on average 1.33003300330033) internal successors, (403), 303 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:41,277 INFO L93 Difference]: Finished difference Result 963 states and 1301 transitions. [2022-04-27 11:16:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1301 transitions. [2022-04-27 11:16:41,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:41,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:41,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 308 states, 303 states have (on average 1.33003300330033) internal successors, (403), 303 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 963 states. [2022-04-27 11:16:41,278 INFO L87 Difference]: Start difference. First operand has 308 states, 303 states have (on average 1.33003300330033) internal successors, (403), 303 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 963 states. [2022-04-27 11:16:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:41,305 INFO L93 Difference]: Finished difference Result 963 states and 1301 transitions. [2022-04-27 11:16:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1301 transitions. [2022-04-27 11:16:41,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:41,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:41,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:16:41,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:16:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 303 states have (on average 1.33003300330033) internal successors, (403), 303 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 407 transitions. [2022-04-27 11:16:41,310 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 407 transitions. Word has length 35 [2022-04-27 11:16:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:16:41,311 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 407 transitions. [2022-04-27 11:16:41,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.40625) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 407 transitions. [2022-04-27 11:16:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:16:41,311 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:16:41,311 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:16:41,327 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-27 11:16:41,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:41,522 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:16:41,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:16:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 10 times [2022-04-27 11:16:41,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:16:41,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639500622] [2022-04-27 11:16:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:16:41,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:16:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:41,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:16:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:41,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {24275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24262#true} is VALID [2022-04-27 11:16:41,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {24262#true} assume true; {24262#true} is VALID [2022-04-27 11:16:41,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24262#true} {24262#true} #83#return; {24262#true} is VALID [2022-04-27 11:16:41,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {24262#true} call ULTIMATE.init(); {24275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:16:41,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {24275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24262#true} is VALID [2022-04-27 11:16:41,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {24262#true} assume true; {24262#true} is VALID [2022-04-27 11:16:41,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24262#true} {24262#true} #83#return; {24262#true} is VALID [2022-04-27 11:16:41,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {24262#true} call #t~ret15 := main(); {24262#true} is VALID [2022-04-27 11:16:41,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {24262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24267#(= main_~y~0 0)} is VALID [2022-04-27 11:16:41,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {24267#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:41,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:41,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:41,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:41,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:41,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:41,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:41,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:41,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:41,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:41,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:41,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:41,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:41,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:41,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24267#(= main_~y~0 0)} is VALID [2022-04-27 11:16:41,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {24267#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {24267#(= main_~y~0 0)} is VALID [2022-04-27 11:16:41,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {24267#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:41,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:41,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:41,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:41,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:41,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:41,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:41,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:41,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24272#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:16:41,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {24272#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} assume !(~z~0 % 4294967296 > 0); {24272#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:16:41,712 INFO L272 TraceCheckUtils]: 32: Hoare triple {24272#(and (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (not (<= (+ (div main_~y~0 4294967296) 1) 0)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:16:41,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {24273#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24274#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:16:41,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {24274#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24263#false} is VALID [2022-04-27 11:16:41,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {24263#false} assume !false; {24263#false} is VALID [2022-04-27 11:16:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:16:41,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:16:41,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639500622] [2022-04-27 11:16:41,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639500622] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:16:41,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462624031] [2022-04-27 11:16:41,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:16:41,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:41,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:16:41,714 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-27 11:16:41,715 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-27 11:16:41,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:16:41,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:16:41,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 11:16:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:41,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:16:42,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {24262#true} call ULTIMATE.init(); {24262#true} is VALID [2022-04-27 11:16:42,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {24262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24262#true} is VALID [2022-04-27 11:16:42,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {24262#true} assume true; {24262#true} is VALID [2022-04-27 11:16:42,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24262#true} {24262#true} #83#return; {24262#true} is VALID [2022-04-27 11:16:42,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {24262#true} call #t~ret15 := main(); {24262#true} is VALID [2022-04-27 11:16:42,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {24262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24267#(= main_~y~0 0)} is VALID [2022-04-27 11:16:42,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {24267#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:42,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:42,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:42,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:42,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:42,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {24312#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:42,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {24312#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24316#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:16:42,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {24316#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24320#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:42,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {24320#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24324#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:42,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {24324#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24328#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:42,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {24328#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:42,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:42,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:42,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:42,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24267#(= main_~y~0 0)} is VALID [2022-04-27 11:16:42,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {24267#(= main_~y~0 0)} assume !(~y~0 % 4294967296 > 0); {24267#(= main_~y~0 0)} is VALID [2022-04-27 11:16:42,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {24267#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:42,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:42,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:42,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:42,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:42,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {24271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:42,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {24270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:42,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {24269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:42,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {24268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24267#(= main_~y~0 0)} is VALID [2022-04-27 11:16:42,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {24267#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {24267#(= main_~y~0 0)} is VALID [2022-04-27 11:16:42,082 INFO L272 TraceCheckUtils]: 32: Hoare triple {24267#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24380#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:16:42,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {24380#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24384#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:16:42,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {24384#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24263#false} is VALID [2022-04-27 11:16:42,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {24263#false} assume !false; {24263#false} is VALID [2022-04-27 11:16:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:16:42,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:16:42,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {24263#false} assume !false; {24263#false} is VALID [2022-04-27 11:16:42,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {24384#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24263#false} is VALID [2022-04-27 11:16:42,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {24380#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24384#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:16:42,368 INFO L272 TraceCheckUtils]: 32: Hoare triple {24400#(= (mod main_~y~0 4294967296) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24380#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:16:42,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {24400#(= (mod main_~y~0 4294967296) 0)} assume !(~z~0 % 4294967296 > 0); {24400#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:16:42,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {24407#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24400#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:16:42,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {24411#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24407#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-27 11:16:42,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {24415#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24411#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-27 11:16:42,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {24419#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24415#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-27 11:16:42,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {24419#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} assume !(~x~0 % 4294967296 > 0); {24419#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} is VALID [2022-04-27 11:16:42,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {24415#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24419#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} is VALID [2022-04-27 11:16:42,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {24411#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24415#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-27 11:16:42,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {24407#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24411#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-27 11:16:42,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {24400#(= (mod main_~y~0 4294967296) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24407#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-27 11:16:42,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {24400#(= (mod main_~y~0 4294967296) 0)} assume !(~y~0 % 4294967296 > 0); {24400#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:16:42,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {24407#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24400#(= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-27 11:16:42,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {24411#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24407#(= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-27 11:16:42,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {24415#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24411#(= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-27 11:16:42,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {24419#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24415#(= (mod (+ main_~y~0 4294967293) 4294967296) 0)} is VALID [2022-04-27 11:16:42,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {24453#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24419#(= (mod (+ 4294967292 main_~y~0) 4294967296) 0)} is VALID [2022-04-27 11:16:42,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {24457#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24453#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:16:42,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {24461#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24457#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:16:42,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {24465#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24461#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:16:42,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {24469#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 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; {24465#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:16:42,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {24262#true} ~z~0 := ~y~0; {24469#(or (= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-27 11:16:42,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {24262#true} assume !(~x~0 % 4294967296 > 0); {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {24262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {24262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {24262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {24262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {24262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {24262#true} call #t~ret15 := main(); {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24262#true} {24262#true} #83#return; {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {24262#true} assume true; {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {24262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {24262#true} call ULTIMATE.init(); {24262#true} is VALID [2022-04-27 11:16:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:16:42,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462624031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:16:42,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:16:42,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 28 [2022-04-27 11:16:42,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038769249] [2022-04-27 11:16:42,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:16:42,381 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 25 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-27 11:16:42,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:16:42,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 25 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:42,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:42,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 11:16:42,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:16:42,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 11:16:42,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:16:42,433 INFO L87 Difference]: Start difference. First operand 308 states and 407 transitions. Second operand has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 25 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:45,714 INFO L93 Difference]: Finished difference Result 385 states and 506 transitions. [2022-04-27 11:16:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-27 11:16:45,714 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 25 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-27 11:16:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:16:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 25 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 103 transitions. [2022-04-27 11:16:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 25 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 103 transitions. [2022-04-27 11:16:45,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 103 transitions. [2022-04-27 11:16:45,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:45,808 INFO L225 Difference]: With dead ends: 385 [2022-04-27 11:16:45,808 INFO L226 Difference]: Without dead ends: 339 [2022-04-27 11:16:45,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=472, Invalid=3434, Unknown=0, NotChecked=0, Total=3906 [2022-04-27 11:16:45,809 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:16:45,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 96 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 11:16:45,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-27 11:16:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 290. [2022-04-27 11:16:46,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:16:46,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 290 states, 285 states have (on average 1.3543859649122807) internal successors, (386), 285 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:46,416 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 290 states, 285 states have (on average 1.3543859649122807) internal successors, (386), 285 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:46,417 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 290 states, 285 states have (on average 1.3543859649122807) internal successors, (386), 285 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:46,421 INFO L93 Difference]: Finished difference Result 339 states and 450 transitions. [2022-04-27 11:16:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 450 transitions. [2022-04-27 11:16:46,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:46,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:46,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 285 states have (on average 1.3543859649122807) internal successors, (386), 285 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-27 11:16:46,422 INFO L87 Difference]: Start difference. First operand has 290 states, 285 states have (on average 1.3543859649122807) internal successors, (386), 285 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-27 11:16:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:46,426 INFO L93 Difference]: Finished difference Result 339 states and 450 transitions. [2022-04-27 11:16:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 450 transitions. [2022-04-27 11:16:46,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:46,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:46,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:16:46,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:16:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 285 states have (on average 1.3543859649122807) internal successors, (386), 285 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 390 transitions. [2022-04-27 11:16:46,430 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 390 transitions. Word has length 36 [2022-04-27 11:16:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:16:46,430 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 390 transitions. [2022-04-27 11:16:46,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 25 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 390 transitions. [2022-04-27 11:16:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 11:16:46,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:16:46,431 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:16:46,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-27 11:16:46,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-27 11:16:46,631 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:16:46,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:16:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1000596304, now seen corresponding path program 8 times [2022-04-27 11:16:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:16:46,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718687091] [2022-04-27 11:16:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:16:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:16:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:46,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:16:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:46,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {26190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26170#true} is VALID [2022-04-27 11:16:46,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {26170#true} assume true; {26170#true} is VALID [2022-04-27 11:16:46,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26170#true} {26170#true} #83#return; {26170#true} is VALID [2022-04-27 11:16:46,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {26170#true} call ULTIMATE.init(); {26190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:16:46,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {26190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26170#true} is VALID [2022-04-27 11:16:46,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {26170#true} assume true; {26170#true} is VALID [2022-04-27 11:16:46,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26170#true} {26170#true} #83#return; {26170#true} is VALID [2022-04-27 11:16:46,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {26170#true} call #t~ret15 := main(); {26170#true} is VALID [2022-04-27 11:16:46,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {26170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26175#(= main_~y~0 0)} is VALID [2022-04-27 11:16:46,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {26175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:46,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {26176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:46,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {26177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:46,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {26178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:46,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {26179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:46,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {26180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:46,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {26181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:46,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {26181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {26182#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:46,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {26182#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26183#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:16:46,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {26183#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26184#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:16:46,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {26184#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26185#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:16:46,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {26185#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26186#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:16:46,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {26186#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26187#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:16:46,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {26187#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26188#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:16:46,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {26188#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {26188#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:16:46,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {26188#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26187#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:16:46,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {26187#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26186#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:16:46,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {26186#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26185#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:16:46,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {26185#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26184#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:16:46,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {26184#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26183#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:16:46,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {26183#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:46,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:46,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:46,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:46,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:46,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:46,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {26189#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {26171#false} is VALID [2022-04-27 11:16:46,869 INFO L272 TraceCheckUtils]: 33: Hoare triple {26171#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26171#false} is VALID [2022-04-27 11:16:46,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {26171#false} ~cond := #in~cond; {26171#false} is VALID [2022-04-27 11:16:46,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {26171#false} assume 0 == ~cond; {26171#false} is VALID [2022-04-27 11:16:46,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {26171#false} assume !false; {26171#false} is VALID [2022-04-27 11:16:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:16:46,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:16:46,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718687091] [2022-04-27 11:16:46,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718687091] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:16:46,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603122342] [2022-04-27 11:16:46,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:16:46,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:46,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:16:46,871 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-27 11:16:46,887 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-27 11:16:46,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:16:46,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:16:46,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 11:16:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:46,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:16:47,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {26170#true} call ULTIMATE.init(); {26170#true} is VALID [2022-04-27 11:16:47,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {26170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26170#true} is VALID [2022-04-27 11:16:47,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {26170#true} assume true; {26170#true} is VALID [2022-04-27 11:16:47,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26170#true} {26170#true} #83#return; {26170#true} is VALID [2022-04-27 11:16:47,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {26170#true} call #t~ret15 := main(); {26170#true} is VALID [2022-04-27 11:16:47,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {26170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26170#true} is VALID [2022-04-27 11:16:47,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {26170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26170#true} is VALID [2022-04-27 11:16:47,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {26170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26170#true} is VALID [2022-04-27 11:16:47,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {26170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26170#true} is VALID [2022-04-27 11:16:47,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {26170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26221#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:16:47,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {26221#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26225#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:16:47,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {26225#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:16:47,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:16:47,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:16:47,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26225#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:16:47,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {26225#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26221#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:16:47,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {26221#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26245#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:47,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {26245#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26249#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:47,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {26249#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26253#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:16:47,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {26253#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !(~y~0 % 4294967296 > 0); {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26253#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:16:47,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {26253#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26249#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:47,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {26249#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26245#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:47,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {26245#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {26171#false} is VALID [2022-04-27 11:16:47,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {26171#false} assume !(~z~0 % 4294967296 > 0); {26171#false} is VALID [2022-04-27 11:16:47,159 INFO L272 TraceCheckUtils]: 33: Hoare triple {26171#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26171#false} is VALID [2022-04-27 11:16:47,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {26171#false} ~cond := #in~cond; {26171#false} is VALID [2022-04-27 11:16:47,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {26171#false} assume 0 == ~cond; {26171#false} is VALID [2022-04-27 11:16:47,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {26171#false} assume !false; {26171#false} is VALID [2022-04-27 11:16:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 11:16:47,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:16:47,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {26171#false} assume !false; {26171#false} is VALID [2022-04-27 11:16:47,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {26171#false} assume 0 == ~cond; {26171#false} is VALID [2022-04-27 11:16:47,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {26171#false} ~cond := #in~cond; {26171#false} is VALID [2022-04-27 11:16:47,268 INFO L272 TraceCheckUtils]: 33: Hoare triple {26171#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26171#false} is VALID [2022-04-27 11:16:47,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {26171#false} assume !(~z~0 % 4294967296 > 0); {26171#false} is VALID [2022-04-27 11:16:47,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {26245#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {26171#false} is VALID [2022-04-27 11:16:47,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {26249#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26245#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:47,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {26253#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26249#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:47,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26253#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:16:47,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !(~y~0 % 4294967296 > 0); {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {26253#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26257#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:16:47,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {26249#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26253#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:16:47,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {26245#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26249#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:16:47,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {26221#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26245#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:16:47,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {26225#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26221#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:16:47,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26225#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:16:47,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:16:47,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:16:47,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {26225#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26229#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:16:47,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {26221#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26225#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:16:47,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {26170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26221#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:16:47,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {26170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26170#true} is VALID [2022-04-27 11:16:47,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {26170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26170#true} is VALID [2022-04-27 11:16:47,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {26170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26170#true} is VALID [2022-04-27 11:16:47,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {26170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26170#true} is VALID [2022-04-27 11:16:47,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {26170#true} call #t~ret15 := main(); {26170#true} is VALID [2022-04-27 11:16:47,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26170#true} {26170#true} #83#return; {26170#true} is VALID [2022-04-27 11:16:47,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {26170#true} assume true; {26170#true} is VALID [2022-04-27 11:16:47,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {26170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26170#true} is VALID [2022-04-27 11:16:47,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {26170#true} call ULTIMATE.init(); {26170#true} is VALID [2022-04-27 11:16:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 11:16:47,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603122342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:16:47,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:16:47,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-27 11:16:47,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097817780] [2022-04-27 11:16:47,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:16:47,280 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:16:47,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:16:47,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:16:47,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:47,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 11:16:47,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:16:47,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 11:16:47,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:16:47,321 INFO L87 Difference]: Start difference. First operand 290 states and 390 transitions. Second operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:02,657 INFO L93 Difference]: Finished difference Result 455 states and 609 transitions. [2022-04-27 11:17:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-04-27 11:17:02,657 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:17:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 199 transitions. [2022-04-27 11:17:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 199 transitions. [2022-04-27 11:17:02,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 199 transitions. [2022-04-27 11:17:03,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:03,035 INFO L225 Difference]: With dead ends: 455 [2022-04-27 11:17:03,035 INFO L226 Difference]: Without dead ends: 394 [2022-04-27 11:17:03,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4540 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1486, Invalid=13034, Unknown=0, NotChecked=0, Total=14520 [2022-04-27 11:17:03,036 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 135 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:03,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 135 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-27 11:17:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-27 11:17:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 327. [2022-04-27 11:17:03,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:03,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 327 states, 322 states have (on average 1.31055900621118) internal successors, (422), 322 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:03,671 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 327 states, 322 states have (on average 1.31055900621118) internal successors, (422), 322 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:03,671 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 327 states, 322 states have (on average 1.31055900621118) internal successors, (422), 322 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:03,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:03,677 INFO L93 Difference]: Finished difference Result 394 states and 502 transitions. [2022-04-27 11:17:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2022-04-27 11:17:03,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:03,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:03,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 322 states have (on average 1.31055900621118) internal successors, (422), 322 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 394 states. [2022-04-27 11:17:03,678 INFO L87 Difference]: Start difference. First operand has 327 states, 322 states have (on average 1.31055900621118) internal successors, (422), 322 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 394 states. [2022-04-27 11:17:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:03,684 INFO L93 Difference]: Finished difference Result 394 states and 502 transitions. [2022-04-27 11:17:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2022-04-27 11:17:03,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:03,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:03,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:03,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 322 states have (on average 1.31055900621118) internal successors, (422), 322 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 426 transitions. [2022-04-27 11:17:03,690 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 426 transitions. Word has length 37 [2022-04-27 11:17:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:03,690 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 426 transitions. [2022-04-27 11:17:03,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 426 transitions. [2022-04-27 11:17:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 11:17:03,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:03,690 INFO L195 NwaCegarLoop]: trace histogram [10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:03,706 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-27 11:17:03,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:03,896 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:03,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash -916187166, now seen corresponding path program 9 times [2022-04-27 11:17:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:03,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622573609] [2022-04-27 11:17:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:04,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {28424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28403#true} is VALID [2022-04-27 11:17:04,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {28403#true} assume true; {28403#true} is VALID [2022-04-27 11:17:04,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28403#true} {28403#true} #83#return; {28403#true} is VALID [2022-04-27 11:17:04,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {28403#true} call ULTIMATE.init(); {28424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:04,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {28424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28403#true} is VALID [2022-04-27 11:17:04,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {28403#true} assume true; {28403#true} is VALID [2022-04-27 11:17:04,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28403#true} {28403#true} #83#return; {28403#true} is VALID [2022-04-27 11:17:04,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {28403#true} call #t~ret15 := main(); {28403#true} is VALID [2022-04-27 11:17:04,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {28403#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28408#(= main_~y~0 0)} is VALID [2022-04-27 11:17:04,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {28408#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28409#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:04,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {28409#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28410#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:04,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {28410#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28411#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:04,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {28411#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28412#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:04,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {28412#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28413#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:04,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {28413#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28414#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:04,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {28414#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28415#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:17:04,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {28415#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28416#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:17:04,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {28416#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28417#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:17:04,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {28417#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28418#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:17:04,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {28418#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28418#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:17:04,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {28418#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {28419#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:17:04,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {28419#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28420#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:17:04,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {28420#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28421#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:17:04,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {28421#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28422#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:17:04,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {28422#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28423#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:04,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {28423#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {28404#false} is VALID [2022-04-27 11:17:04,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {28404#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28404#false} is VALID [2022-04-27 11:17:04,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {28404#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28404#false} is VALID [2022-04-27 11:17:04,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {28404#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {28404#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {28404#false} assume !(~y~0 % 4294967296 > 0); {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {28404#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {28404#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {28404#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {28404#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {28404#false} assume !(~x~0 % 4294967296 > 0); {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {28404#false} assume !(~z~0 % 4294967296 > 0); {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L272 TraceCheckUtils]: 34: Hoare triple {28404#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {28404#false} ~cond := #in~cond; {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {28404#false} assume 0 == ~cond; {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {28404#false} assume !false; {28404#false} is VALID [2022-04-27 11:17:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-27 11:17:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:04,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622573609] [2022-04-27 11:17:04,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622573609] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:04,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68389465] [2022-04-27 11:17:04,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:17:04,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:04,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:04,126 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-27 11:17:04,126 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-27 11:17:04,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:17:04,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:04,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-27 11:17:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:04,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:04,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {28403#true} call ULTIMATE.init(); {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {28403#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {28403#true} assume true; {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28403#true} {28403#true} #83#return; {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {28403#true} call #t~ret15 := main(); {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {28403#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:04,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:04,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:04,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:04,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:04,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {28403#true} assume !(~x~0 % 4294967296 > 0); {28403#true} is VALID [2022-04-27 11:17:04,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {28403#true} ~z~0 := ~y~0; {28479#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:17:04,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {28479#(= 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; {28483#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-27 11:17:04,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {28483#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28487#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-27 11:17:04,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {28487#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28491#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-27 11:17:04,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {28491#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28495#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-27 11:17:04,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {28495#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {28495#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-27 11:17:04,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {28495#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28487#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-27 11:17:04,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {28487#(= main_~y~0 (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28479#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:17:04,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {28479#(= main_~z~0 main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28508#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-27 11:17:04,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {28508#(= (+ main_~y~0 2) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28512#(= (+ (- 1) main_~z~0) (+ main_~y~0 3))} is VALID [2022-04-27 11:17:04,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {28512#(= (+ (- 1) main_~z~0) (+ main_~y~0 3))} assume !(~y~0 % 4294967296 > 0); {28512#(= (+ (- 1) main_~z~0) (+ main_~y~0 3))} is VALID [2022-04-27 11:17:04,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {28512#(= (+ (- 1) main_~z~0) (+ main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28519#(= main_~y~0 (+ main_~z~0 (- 3)))} is VALID [2022-04-27 11:17:04,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {28519#(= main_~y~0 (+ main_~z~0 (- 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28508#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-27 11:17:04,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {28508#(= (+ main_~y~0 2) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28526#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-27 11:17:04,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {28526#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28479#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:17:04,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {28479#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {28479#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:17:04,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {28479#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {28536#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:17:04,613 INFO L272 TraceCheckUtils]: 34: Hoare triple {28536#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28540#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:17:04,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {28540#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28544#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:17:04,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {28544#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28404#false} is VALID [2022-04-27 11:17:04,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {28404#false} assume !false; {28404#false} is VALID [2022-04-27 11:17:04,614 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-27 11:17:04,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:05,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {28404#false} assume !false; {28404#false} is VALID [2022-04-27 11:17:05,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {28544#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28404#false} is VALID [2022-04-27 11:17:05,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {28540#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28544#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:17:05,199 INFO L272 TraceCheckUtils]: 34: Hoare triple {28536#(not (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28540#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:17:05,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {28563#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28536#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:17:05,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {28563#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {28563#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:17:05,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {28570#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28563#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:17:05,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {28574#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28570#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-27 11:17:05,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {28578#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28574#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} is VALID [2022-04-27 11:17:05,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {28582#(or (not (< 0 (mod (+ main_~y~0 4) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28578#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:17:05,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {28582#(or (not (< 0 (mod (+ main_~y~0 4) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28582#(or (not (< 0 (mod (+ main_~y~0 4) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:17:05,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {28589#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28582#(or (not (< 0 (mod (+ main_~y~0 4) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:17:05,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {28593#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28589#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-27 11:17:05,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {28597#(or (not (< 0 (mod (+ main_~y~0 1) 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28593#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} is VALID [2022-04-27 11:17:05,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {28601#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28597#(or (not (< 0 (mod (+ main_~y~0 1) 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-27 11:17:05,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {28601#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28601#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-27 11:17:05,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {28608#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28601#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-27 11:17:05,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {28612#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28608#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-27 11:17:05,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {28616#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28612#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:17:05,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {28563#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28616#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-27 11:17:05,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {28403#true} ~z~0 := ~y~0; {28563#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:17:05,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {28403#true} assume !(~x~0 % 4294967296 > 0); {28403#true} is VALID [2022-04-27 11:17:05,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:05,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {28403#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {28403#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {28403#true} call #t~ret15 := main(); {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28403#true} {28403#true} #83#return; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {28403#true} assume true; {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {28403#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {28403#true} call ULTIMATE.init(); {28403#true} is VALID [2022-04-27 11:17:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-27 11:17:05,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68389465] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:05,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:05,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 17] total 43 [2022-04-27 11:17:05,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48503154] [2022-04-27 11:17:05,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:05,211 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.619047619047619) internal successors, (68), 41 states have internal predecessors, (68), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 11:17:05,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:05,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 42 states have (on average 1.619047619047619) internal successors, (68), 41 states have internal predecessors, (68), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:05,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:05,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-27 11:17:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:05,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-27 11:17:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1643, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 11:17:05,261 INFO L87 Difference]: Start difference. First operand 327 states and 426 transitions. Second operand has 43 states, 42 states have (on average 1.619047619047619) internal successors, (68), 41 states have internal predecessors, (68), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:37,190 INFO L93 Difference]: Finished difference Result 775 states and 1082 transitions. [2022-04-27 11:17:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2022-04-27 11:17:37,190 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.619047619047619) internal successors, (68), 41 states have internal predecessors, (68), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 11:17:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.619047619047619) internal successors, (68), 41 states have internal predecessors, (68), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 365 transitions. [2022-04-27 11:17:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.619047619047619) internal successors, (68), 41 states have internal predecessors, (68), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 365 transitions. [2022-04-27 11:17:37,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 365 transitions. [2022-04-27 11:17:37,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:37,864 INFO L225 Difference]: With dead ends: 775 [2022-04-27 11:17:37,864 INFO L226 Difference]: Without dead ends: 687 [2022-04-27 11:17:37,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11926 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=3458, Invalid=35548, Unknown=0, NotChecked=0, Total=39006 [2022-04-27 11:17:37,866 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 240 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 6268 mSolverCounterSat, 951 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 7219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 951 IncrementalHoareTripleChecker+Valid, 6268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:37,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 207 Invalid, 7219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [951 Valid, 6268 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-04-27 11:17:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-04-27 11:17:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 406. [2022-04-27 11:17:38,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:38,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 687 states. Second operand has 406 states, 401 states have (on average 1.3591022443890275) internal successors, (545), 401 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:38,668 INFO L74 IsIncluded]: Start isIncluded. First operand 687 states. Second operand has 406 states, 401 states have (on average 1.3591022443890275) internal successors, (545), 401 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:38,668 INFO L87 Difference]: Start difference. First operand 687 states. Second operand has 406 states, 401 states have (on average 1.3591022443890275) internal successors, (545), 401 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:38,682 INFO L93 Difference]: Finished difference Result 687 states and 906 transitions. [2022-04-27 11:17:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 906 transitions. [2022-04-27 11:17:38,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:38,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:38,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 406 states, 401 states have (on average 1.3591022443890275) internal successors, (545), 401 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 687 states. [2022-04-27 11:17:38,683 INFO L87 Difference]: Start difference. First operand has 406 states, 401 states have (on average 1.3591022443890275) internal successors, (545), 401 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 687 states. [2022-04-27 11:17:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:38,696 INFO L93 Difference]: Finished difference Result 687 states and 906 transitions. [2022-04-27 11:17:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 906 transitions. [2022-04-27 11:17:38,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:38,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:38,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:38,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 401 states have (on average 1.3591022443890275) internal successors, (545), 401 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 549 transitions. [2022-04-27 11:17:38,704 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 549 transitions. Word has length 38 [2022-04-27 11:17:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:38,704 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 549 transitions. [2022-04-27 11:17:38,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.619047619047619) internal successors, (68), 41 states have internal predecessors, (68), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 549 transitions. [2022-04-27 11:17:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 11:17:38,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:38,705 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:38,721 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-27 11:17:38,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-27 11:17:38,921 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:38,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash 64930767, now seen corresponding path program 6 times [2022-04-27 11:17:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:38,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930474] [2022-04-27 11:17:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:38,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:39,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:39,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {31825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31804#true} is VALID [2022-04-27 11:17:39,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {31804#true} assume true; {31804#true} is VALID [2022-04-27 11:17:39,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31804#true} {31804#true} #83#return; {31804#true} is VALID [2022-04-27 11:17:39,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {31804#true} call ULTIMATE.init(); {31825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:39,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {31825#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31804#true} is VALID [2022-04-27 11:17:39,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {31804#true} assume true; {31804#true} is VALID [2022-04-27 11:17:39,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31804#true} {31804#true} #83#return; {31804#true} is VALID [2022-04-27 11:17:39,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {31804#true} call #t~ret15 := main(); {31804#true} is VALID [2022-04-27 11:17:39,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {31804#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31809#(= main_~y~0 0)} is VALID [2022-04-27 11:17:39,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {31809#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31810#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:39,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {31810#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31811#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:39,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {31811#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31812#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:39,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {31812#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31813#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:39,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {31813#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31814#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:39,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {31814#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31815#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:39,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {31815#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31816#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:17:39,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {31816#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {31816#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:17:39,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {31816#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {31817#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:17:39,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {31817#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31818#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:39,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {31818#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31819#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:17:39,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {31819#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31820#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:17:39,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {31820#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31821#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:17:39,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {31821#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31822#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:17:39,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {31822#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31823#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:17:39,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {31823#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31824#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:17:39,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {31824#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31805#false} is VALID [2022-04-27 11:17:39,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {31805#false} assume !(~z~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {31805#false} assume !(~y~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {31805#false} assume !(~x~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {31805#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {31805#false} assume !(~z~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L272 TraceCheckUtils]: 35: Hoare triple {31805#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {31805#false} ~cond := #in~cond; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {31805#false} assume 0 == ~cond; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {31805#false} assume !false; {31805#false} is VALID [2022-04-27 11:17:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 11:17:39,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:39,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930474] [2022-04-27 11:17:39,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930474] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:39,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710038016] [2022-04-27 11:17:39,164 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:17:39,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:39,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:39,165 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-27 11:17:39,166 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-27 11:17:39,273 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-27 11:17:39,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:39,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 11:17:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:39,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:39,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {31804#true} call ULTIMATE.init(); {31804#true} is VALID [2022-04-27 11:17:39,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {31804#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31804#true} is VALID [2022-04-27 11:17:39,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {31804#true} assume true; {31804#true} is VALID [2022-04-27 11:17:39,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31804#true} {31804#true} #83#return; {31804#true} is VALID [2022-04-27 11:17:39,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {31804#true} call #t~ret15 := main(); {31804#true} is VALID [2022-04-27 11:17:39,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {31804#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31809#(= main_~y~0 0)} is VALID [2022-04-27 11:17:39,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {31809#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31810#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:39,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {31810#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31811#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:39,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {31811#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31812#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:39,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {31812#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31813#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:39,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {31813#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31814#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:39,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {31814#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31815#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:39,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {31815#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31816#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:17:39,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {31816#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {31816#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:17:39,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {31816#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {31817#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:17:39,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {31817#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31818#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:39,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {31818#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31819#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:17:39,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {31819#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31820#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:17:39,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {31820#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31821#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:17:39,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {31821#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31822#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:17:39,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {31822#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31823#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:17:39,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {31823#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31824#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:17:39,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {31824#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31895#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {31895#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {31805#false} assume !(~y~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {31805#false} assume !(~x~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {31805#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {31805#false} is VALID [2022-04-27 11:17:39,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {31805#false} assume !(~z~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,549 INFO L272 TraceCheckUtils]: 35: Hoare triple {31805#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {31805#false} is VALID [2022-04-27 11:17:39,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {31805#false} ~cond := #in~cond; {31805#false} is VALID [2022-04-27 11:17:39,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {31805#false} assume 0 == ~cond; {31805#false} is VALID [2022-04-27 11:17:39,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {31805#false} assume !false; {31805#false} is VALID [2022-04-27 11:17:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 11:17:39,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:39,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {31805#false} assume !false; {31805#false} is VALID [2022-04-27 11:17:39,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {31805#false} assume 0 == ~cond; {31805#false} is VALID [2022-04-27 11:17:39,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {31805#false} ~cond := #in~cond; {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L272 TraceCheckUtils]: 35: Hoare triple {31805#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {31805#false} assume !(~z~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {31805#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {31805#false} assume !(~x~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {31805#false} assume !(~y~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {31805#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31805#false} is VALID [2022-04-27 11:17:39,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {31989#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31805#false} is VALID [2022-04-27 11:17:39,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {31993#(< 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; {31989#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:17:39,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {31997#(< 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; {31993#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:39,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {32001#(< 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; {31997#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:39,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {32005#(< 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; {32001#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:17:39,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {32009#(< 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; {32005#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-27 11:17:39,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {32013#(< 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; {32009#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-27 11:17:39,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {32017#(< 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; {32013#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-27 11:17:39,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {32021#(< 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; {32017#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-27 11:17:39,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {32025#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {32021#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-27 11:17:39,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {32025#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32025#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:39,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {32032#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32025#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:39,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {32036#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32032#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:17:39,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {32040#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32036#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:39,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {32044#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32040#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:39,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {32048#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32044#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:39,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {32052#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32048#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:17:39,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {32056#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32052#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:39,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {31804#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32056#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:39,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {31804#true} call #t~ret15 := main(); {31804#true} is VALID [2022-04-27 11:17:39,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31804#true} {31804#true} #83#return; {31804#true} is VALID [2022-04-27 11:17:39,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {31804#true} assume true; {31804#true} is VALID [2022-04-27 11:17:39,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {31804#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31804#true} is VALID [2022-04-27 11:17:39,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {31804#true} call ULTIMATE.init(); {31804#true} is VALID [2022-04-27 11:17:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 11:17:39,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710038016] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:39,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:39,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2022-04-27 11:17:39,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809179986] [2022-04-27 11:17:39,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:39,985 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:17:39,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:39,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:40,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:40,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-27 11:17:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-27 11:17:40,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 11:17:40,020 INFO L87 Difference]: Start difference. First operand 406 states and 549 transitions. Second operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:22,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:22:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:22:45,977 INFO L93 Difference]: Finished difference Result 1424 states and 2126 transitions. [2022-04-27 11:22:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 606 states. [2022-04-27 11:22:45,977 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 11:22:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:22:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1313 transitions. [2022-04-27 11:22:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:22:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1313 transitions. [2022-04-27 11:22:46,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 1313 transitions. [2022-04-27 11:22:59,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1313 edges. 1313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:22:59,132 INFO L225 Difference]: With dead ends: 1424 [2022-04-27 11:22:59,132 INFO L226 Difference]: Without dead ends: 1284 [2022-04-27 11:22:59,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 638 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196303 ImplicationChecksByTransitivity, 245.1s TimeCoverageRelationStatistics Valid=44975, Invalid=363985, Unknown=0, NotChecked=0, Total=408960 [2022-04-27 11:22:59,158 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1138 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 3215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 5848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3215 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:22:59,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 145 Invalid, 5848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3215 Valid, 2633 Invalid, 0 Unknown, 0 Unchecked, 30.2s Time] [2022-04-27 11:22:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2022-04-27 11:23:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 618. [2022-04-27 11:23:00,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:23:00,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1284 states. Second operand has 618 states, 613 states have (on average 1.4143556280587275) internal successors, (867), 613 states have internal predecessors, (867), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:00,441 INFO L74 IsIncluded]: Start isIncluded. First operand 1284 states. Second operand has 618 states, 613 states have (on average 1.4143556280587275) internal successors, (867), 613 states have internal predecessors, (867), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:00,442 INFO L87 Difference]: Start difference. First operand 1284 states. Second operand has 618 states, 613 states have (on average 1.4143556280587275) internal successors, (867), 613 states have internal predecessors, (867), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:00,485 INFO L93 Difference]: Finished difference Result 1284 states and 1811 transitions. [2022-04-27 11:23:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1811 transitions. [2022-04-27 11:23:00,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:00,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:00,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 618 states, 613 states have (on average 1.4143556280587275) internal successors, (867), 613 states have internal predecessors, (867), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1284 states. [2022-04-27 11:23:00,487 INFO L87 Difference]: Start difference. First operand has 618 states, 613 states have (on average 1.4143556280587275) internal successors, (867), 613 states have internal predecessors, (867), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1284 states. [2022-04-27 11:23:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:00,530 INFO L93 Difference]: Finished difference Result 1284 states and 1811 transitions. [2022-04-27 11:23:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1811 transitions. [2022-04-27 11:23:00,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:00,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:00,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:23:00,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:23:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 613 states have (on average 1.4143556280587275) internal successors, (867), 613 states have internal predecessors, (867), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 871 transitions. [2022-04-27 11:23:00,545 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 871 transitions. Word has length 39 [2022-04-27 11:23:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:23:00,545 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 871 transitions. [2022-04-27 11:23:00,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 871 transitions. [2022-04-27 11:23:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 11:23:00,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:00,546 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:00,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-27 11:23:00,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:00,749 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash -217359133, now seen corresponding path program 11 times [2022-04-27 11:23:00,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:00,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065345702] [2022-04-27 11:23:00,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:00,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:00,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:00,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {38270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38259#true} is VALID [2022-04-27 11:23:00,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-27 11:23:00,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38259#true} {38259#true} #83#return; {38259#true} is VALID [2022-04-27 11:23:00,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {38259#true} call ULTIMATE.init(); {38270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:00,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {38270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38259#true} is VALID [2022-04-27 11:23:00,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-27 11:23:00,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38259#true} {38259#true} #83#return; {38259#true} is VALID [2022-04-27 11:23:00,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {38259#true} call #t~ret15 := main(); {38259#true} is VALID [2022-04-27 11:23:00,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {38259#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38259#true} is VALID [2022-04-27 11:23:00,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:00,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:00,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:00,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:00,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38264#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:23:00,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {38264#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {38264#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:23:00,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {38264#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {38264#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:23:00,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {38264#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38265#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:00,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {38265#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38266#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:00,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {38266#(<= main_~x~0 (+ 4294967296 (* (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; {38267#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:00,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {38267#(<= main_~x~0 (+ 4294967297 (* (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; {38268#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-27 11:23:00,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {38268#(<= main_~x~0 (+ (* (div (+ main_~x~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; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:00,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !(~z~0 % 4294967296 > 0); {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:00,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:00,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:00,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:00,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:00,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:00,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !(~y~0 % 4294967296 > 0); {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:00,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38268#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-27 11:23:00,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {38268#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38267#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:00,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {38267#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38266#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:00,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {38266#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38265#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:00,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {38265#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {38260#false} is VALID [2022-04-27 11:23:00,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:00,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:00,879 INFO L290 TraceCheckUtils]: 32: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:00,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:00,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:00,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {38260#false} assume !(~z~0 % 4294967296 > 0); {38260#false} is VALID [2022-04-27 11:23:00,880 INFO L272 TraceCheckUtils]: 36: Hoare triple {38260#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {38260#false} is VALID [2022-04-27 11:23:00,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-27 11:23:00,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {38260#false} assume 0 == ~cond; {38260#false} is VALID [2022-04-27 11:23:00,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {38260#false} assume !false; {38260#false} is VALID [2022-04-27 11:23:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:23:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:00,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065345702] [2022-04-27 11:23:00,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065345702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:23:00,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150552744] [2022-04-27 11:23:00,880 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:23:00,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:00,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:23:00,881 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-27 11:23:00,882 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-27 11:23:01,205 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:23:01,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:23:01,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:23:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:01,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:23:01,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {38259#true} call ULTIMATE.init(); {38259#true} is VALID [2022-04-27 11:23:01,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {38259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38259#true} is VALID [2022-04-27 11:23:01,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-27 11:23:01,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38259#true} {38259#true} #83#return; {38259#true} is VALID [2022-04-27 11:23:01,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {38259#true} call #t~ret15 := main(); {38259#true} is VALID [2022-04-27 11:23:01,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {38259#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38259#true} is VALID [2022-04-27 11:23:01,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:01,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:01,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:01,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:01,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:01,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {38259#true} assume !(~x~0 % 4294967296 > 0); {38307#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:23:01,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {38307#(not (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {38307#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:23:01,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {38307#(not (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38314#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:23:01,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {38314#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38318#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:23:01,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {38318#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38322#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:23:01,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {38322#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38326#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:01,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {38326#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:01,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:01,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:01,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:01,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:01,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:01,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:01,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:01,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {38330#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38326#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:23:01,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {38326#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38322#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:23:01,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {38322#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38318#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:23:01,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {38318#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38314#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:23:01,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {38314#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {38260#false} is VALID [2022-04-27 11:23:01,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:01,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:01,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:01,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:01,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:01,477 INFO L290 TraceCheckUtils]: 35: Hoare triple {38260#false} assume !(~z~0 % 4294967296 > 0); {38260#false} is VALID [2022-04-27 11:23:01,477 INFO L272 TraceCheckUtils]: 36: Hoare triple {38260#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {38260#false} is VALID [2022-04-27 11:23:01,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-27 11:23:01,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {38260#false} assume 0 == ~cond; {38260#false} is VALID [2022-04-27 11:23:01,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {38260#false} assume !false; {38260#false} is VALID [2022-04-27 11:23:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 11:23:01,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:23:01,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {38260#false} assume !false; {38260#false} is VALID [2022-04-27 11:23:01,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {38260#false} assume 0 == ~cond; {38260#false} is VALID [2022-04-27 11:23:01,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {38260#false} ~cond := #in~cond; {38260#false} is VALID [2022-04-27 11:23:01,694 INFO L272 TraceCheckUtils]: 36: Hoare triple {38260#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {38260#false} is VALID [2022-04-27 11:23:01,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {38260#false} assume !(~z~0 % 4294967296 > 0); {38260#false} is VALID [2022-04-27 11:23:01,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:01,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:01,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:01,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:01,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {38260#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {38260#false} is VALID [2022-04-27 11:23:01,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {38265#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {38260#false} is VALID [2022-04-27 11:23:01,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {38266#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38265#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:01,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {38267#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38266#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:01,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {38268#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38267#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:01,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {38268#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-27 11:23:01,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !(~y~0 % 4294967296 > 0); {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:01,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:01,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:01,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:01,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:01,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:01,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} assume !(~z~0 % 4294967296 > 0); {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:01,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {38268#(<= main_~x~0 (+ (* (div (+ main_~x~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; {38269#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 4294967299))} is VALID [2022-04-27 11:23:01,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {38267#(<= main_~x~0 (+ 4294967297 (* (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; {38268#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-27 11:23:01,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {38266#(<= main_~x~0 (+ 4294967296 (* (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; {38267#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:01,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {38265#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38266#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:01,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {38264#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38265#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:23:01,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {38264#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {38264#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:23:01,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {38259#true} assume !(~x~0 % 4294967296 > 0); {38264#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:23:01,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:01,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:01,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:01,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:01,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {38259#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {38259#true} is VALID [2022-04-27 11:23:01,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {38259#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38259#true} is VALID [2022-04-27 11:23:01,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {38259#true} call #t~ret15 := main(); {38259#true} is VALID [2022-04-27 11:23:01,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38259#true} {38259#true} #83#return; {38259#true} is VALID [2022-04-27 11:23:01,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {38259#true} assume true; {38259#true} is VALID [2022-04-27 11:23:01,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {38259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {38259#true} is VALID [2022-04-27 11:23:01,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {38259#true} call ULTIMATE.init(); {38259#true} is VALID [2022-04-27 11:23:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 11:23:01,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150552744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:23:01,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:23:01,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-27 11:23:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186354994] [2022-04-27 11:23:01,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:23:01,707 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-27 11:23:01,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:01,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:01,740 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-27 11:23:01,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:23:01,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:01,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:23:01,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:23:01,740 INFO L87 Difference]: Start difference. First operand 618 states and 871 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:04,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:04,554 INFO L93 Difference]: Finished difference Result 908 states and 1343 transitions. [2022-04-27 11:23:04,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 11:23:04,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-27 11:23:04,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:23:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 107 transitions. [2022-04-27 11:23:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 107 transitions. [2022-04-27 11:23:04,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 107 transitions. [2022-04-27 11:23:04,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:04,864 INFO L225 Difference]: With dead ends: 908 [2022-04-27 11:23:04,864 INFO L226 Difference]: Without dead ends: 797 [2022-04-27 11:23:04,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:23:04,867 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 156 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:23:04,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 55 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:23:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-04-27 11:23:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 749. [2022-04-27 11:23:06,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:23:06,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 797 states. Second operand has 749 states, 744 states have (on average 1.446236559139785) internal successors, (1076), 744 states have internal predecessors, (1076), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:06,302 INFO L74 IsIncluded]: Start isIncluded. First operand 797 states. Second operand has 749 states, 744 states have (on average 1.446236559139785) internal successors, (1076), 744 states have internal predecessors, (1076), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:06,302 INFO L87 Difference]: Start difference. First operand 797 states. Second operand has 749 states, 744 states have (on average 1.446236559139785) internal successors, (1076), 744 states have internal predecessors, (1076), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:06,322 INFO L93 Difference]: Finished difference Result 797 states and 1136 transitions. [2022-04-27 11:23:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1136 transitions. [2022-04-27 11:23:06,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:06,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:06,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 749 states, 744 states have (on average 1.446236559139785) internal successors, (1076), 744 states have internal predecessors, (1076), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 797 states. [2022-04-27 11:23:06,324 INFO L87 Difference]: Start difference. First operand has 749 states, 744 states have (on average 1.446236559139785) internal successors, (1076), 744 states have internal predecessors, (1076), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 797 states. [2022-04-27 11:23:06,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:23:06,343 INFO L93 Difference]: Finished difference Result 797 states and 1136 transitions. [2022-04-27 11:23:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1136 transitions. [2022-04-27 11:23:06,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:23:06,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:23:06,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:23:06,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:23:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 744 states have (on average 1.446236559139785) internal successors, (1076), 744 states have internal predecessors, (1076), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1080 transitions. [2022-04-27 11:23:06,362 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1080 transitions. Word has length 40 [2022-04-27 11:23:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:23:06,362 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 1080 transitions. [2022-04-27 11:23:06,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:06,362 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1080 transitions. [2022-04-27 11:23:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 11:23:06,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:23:06,363 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:23:06,371 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-27 11:23:06,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:06,568 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:23:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:23:06,568 INFO L85 PathProgramCache]: Analyzing trace with hash -134128447, now seen corresponding path program 7 times [2022-04-27 11:23:06,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:23:06,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699255407] [2022-04-27 11:23:06,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:23:06,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:23:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:06,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:23:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:06,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {42146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42122#true} is VALID [2022-04-27 11:23:06,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {42122#true} assume true; {42122#true} is VALID [2022-04-27 11:23:06,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42122#true} {42122#true} #83#return; {42122#true} is VALID [2022-04-27 11:23:06,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {42122#true} call ULTIMATE.init(); {42146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:23:06,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {42146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42122#true} is VALID [2022-04-27 11:23:06,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {42122#true} assume true; {42122#true} is VALID [2022-04-27 11:23:06,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42122#true} {42122#true} #83#return; {42122#true} is VALID [2022-04-27 11:23:06,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {42122#true} call #t~ret15 := main(); {42122#true} is VALID [2022-04-27 11:23:06,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {42122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42127#(= main_~y~0 0)} is VALID [2022-04-27 11:23:06,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {42127#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:23:06,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {42128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:23:06,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {42129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:23:06,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {42130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:23:06,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {42131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:23:06,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {42132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:23:06,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {42133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:23:06,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {42134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:23:06,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {42135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {42135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:23:06,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {42135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {42136#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:23:06,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {42136#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42137#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:23:06,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {42137#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42138#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:23:06,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {42138#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42139#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:23:06,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {42139#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42140#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:23:06,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {42140#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42141#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:23:06,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {42141#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42142#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:23:06,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {42142#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42143#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:23:06,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {42143#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42144#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:23:06,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {42144#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {42144#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:23:06,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {42144#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42143#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:23:06,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {42143#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42142#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:23:06,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {42142#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42141#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:23:06,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {42141#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42140#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:23:06,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {42140#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42139#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:23:06,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {42139#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42138#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:23:06,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {42138#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42137#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:23:06,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {42137#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42136#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:23:06,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {42136#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~y~0 % 4294967296 > 0); {42136#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:23:06,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {42136#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~x~0 % 4294967296 > 0); {42136#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:23:06,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {42136#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42145#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:23:06,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {42145#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {42123#false} is VALID [2022-04-27 11:23:06,905 INFO L272 TraceCheckUtils]: 37: Hoare triple {42123#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42123#false} is VALID [2022-04-27 11:23:06,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {42123#false} ~cond := #in~cond; {42123#false} is VALID [2022-04-27 11:23:06,906 INFO L290 TraceCheckUtils]: 39: Hoare triple {42123#false} assume 0 == ~cond; {42123#false} is VALID [2022-04-27 11:23:06,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {42123#false} assume !false; {42123#false} is VALID [2022-04-27 11:23:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:23:06,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:23:06,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699255407] [2022-04-27 11:23:06,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699255407] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:23:06,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654182678] [2022-04-27 11:23:06,906 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:23:06,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:23:06,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:23:06,907 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-27 11:23:06,907 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-27 11:23:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:06,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 11:23:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:23:06,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:23:07,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {42122#true} call ULTIMATE.init(); {42122#true} is VALID [2022-04-27 11:23:07,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {42122#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42122#true} is VALID [2022-04-27 11:23:07,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {42122#true} assume true; {42122#true} is VALID [2022-04-27 11:23:07,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42122#true} {42122#true} #83#return; {42122#true} is VALID [2022-04-27 11:23:07,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {42122#true} call #t~ret15 := main(); {42122#true} is VALID [2022-04-27 11:23:07,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {42122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42122#true} is VALID [2022-04-27 11:23:07,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {42122#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42168#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:23:07,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {42168#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42172#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:23:07,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {42172#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42176#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:23:07,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {42176#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42180#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:23:07,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {42180#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42184#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:23:07,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {42184#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42188#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:23:07,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {42188#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42192#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:23:07,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {42192#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:23:07,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:23:07,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:23:07,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42192#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:23:07,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {42192#(< 0 (mod (+ 7 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; {42188#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:23:07,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {42188#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42184#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:23:07,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {42184#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42180#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:23:07,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {42180#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42176#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:23:07,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {42176#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42172#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:23:07,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {42172#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42168#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:23:07,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {42168#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {42123#false} is VALID [2022-04-27 11:23:07,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {42123#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42123#false} is VALID [2022-04-27 11:23:07,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {42123#false} assume !(~z~0 % 4294967296 > 0); {42123#false} is VALID [2022-04-27 11:23:07,271 INFO L272 TraceCheckUtils]: 37: Hoare triple {42123#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42123#false} is VALID [2022-04-27 11:23:07,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {42123#false} ~cond := #in~cond; {42123#false} is VALID [2022-04-27 11:23:07,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {42123#false} assume 0 == ~cond; {42123#false} is VALID [2022-04-27 11:23:07,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {42123#false} assume !false; {42123#false} is VALID [2022-04-27 11:23:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-27 11:23:07,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:23:07,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {42123#false} assume !false; {42123#false} is VALID [2022-04-27 11:23:07,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {42123#false} assume 0 == ~cond; {42123#false} is VALID [2022-04-27 11:23:07,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {42123#false} ~cond := #in~cond; {42123#false} is VALID [2022-04-27 11:23:07,405 INFO L272 TraceCheckUtils]: 37: Hoare triple {42123#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42123#false} is VALID [2022-04-27 11:23:07,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {42123#false} assume !(~z~0 % 4294967296 > 0); {42123#false} is VALID [2022-04-27 11:23:07,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {42123#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {42123#false} is VALID [2022-04-27 11:23:07,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {42123#false} is VALID [2022-04-27 11:23:07,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {42227#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {42168#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42227#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:23:07,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {42172#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42168#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:23:07,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {42176#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42172#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:23:07,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {42180#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42176#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:23:07,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {42184#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42180#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:23:07,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {42188#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42184#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:23:07,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {42192#(< 0 (mod (+ 7 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; {42188#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:23:07,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42192#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:23:07,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:23:07,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:23:07,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {42192#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42196#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:23:07,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {42188#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42192#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:23:07,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {42184#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42188#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:23:07,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {42180#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42184#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:23:07,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {42176#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42180#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:23:07,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {42172#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42176#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:23:07,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {42168#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42172#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:23:07,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {42122#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42168#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:23:07,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {42122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42122#true} is VALID [2022-04-27 11:23:07,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {42122#true} call #t~ret15 := main(); {42122#true} is VALID [2022-04-27 11:23:07,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42122#true} {42122#true} #83#return; {42122#true} is VALID [2022-04-27 11:23:07,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {42122#true} assume true; {42122#true} is VALID [2022-04-27 11:23:07,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {42122#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42122#true} is VALID [2022-04-27 11:23:07,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {42122#true} call ULTIMATE.init(); {42122#true} is VALID [2022-04-27 11:23:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-27 11:23:07,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654182678] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:23:07,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:23:07,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 31 [2022-04-27 11:23:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761910683] [2022-04-27 11:23:07,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:23:07,422 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:23:07,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:23:07,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:23:07,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:23:07,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 11:23:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:23:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 11:23:07,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:23:07,469 INFO L87 Difference]: Start difference. First operand 749 states and 1080 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:25:03,569 INFO L93 Difference]: Finished difference Result 1062 states and 1539 transitions. [2022-04-27 11:25:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-04-27 11:25:03,569 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:25:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:25:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 283 transitions. [2022-04-27 11:25:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 283 transitions. [2022-04-27 11:25:03,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 283 transitions. [2022-04-27 11:25:04,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:25:04,794 INFO L225 Difference]: With dead ends: 1062 [2022-04-27 11:25:04,795 INFO L226 Difference]: Without dead ends: 941 [2022-04-27 11:25:04,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9823 ImplicationChecksByTransitivity, 49.4s TimeCoverageRelationStatistics Valid=2556, Invalid=26856, Unknown=0, NotChecked=0, Total=29412 [2022-04-27 11:25:04,797 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 190 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:25:04,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 152 Invalid, 3660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 3254 Invalid, 0 Unknown, 0 Unchecked, 30.4s Time] [2022-04-27 11:25:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-04-27 11:25:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 731. [2022-04-27 11:25:06,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:25:06,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 941 states. Second operand has 731 states, 726 states have (on average 1.4338842975206612) internal successors, (1041), 726 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:06,396 INFO L74 IsIncluded]: Start isIncluded. First operand 941 states. Second operand has 731 states, 726 states have (on average 1.4338842975206612) internal successors, (1041), 726 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:06,396 INFO L87 Difference]: Start difference. First operand 941 states. Second operand has 731 states, 726 states have (on average 1.4338842975206612) internal successors, (1041), 726 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:25:06,422 INFO L93 Difference]: Finished difference Result 941 states and 1300 transitions. [2022-04-27 11:25:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1300 transitions. [2022-04-27 11:25:06,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:25:06,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:25:06,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 731 states, 726 states have (on average 1.4338842975206612) internal successors, (1041), 726 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 941 states. [2022-04-27 11:25:06,423 INFO L87 Difference]: Start difference. First operand has 731 states, 726 states have (on average 1.4338842975206612) internal successors, (1041), 726 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 941 states. [2022-04-27 11:25:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:25:06,448 INFO L93 Difference]: Finished difference Result 941 states and 1300 transitions. [2022-04-27 11:25:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1300 transitions. [2022-04-27 11:25:06,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:25:06,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:25:06,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:25:06,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:25:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 726 states have (on average 1.4338842975206612) internal successors, (1041), 726 states have internal predecessors, (1041), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1045 transitions. [2022-04-27 11:25:06,465 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1045 transitions. Word has length 41 [2022-04-27 11:25:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:25:06,466 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 1045 transitions. [2022-04-27 11:25:06,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1045 transitions. [2022-04-27 11:25:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 11:25:06,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:25:06,466 INFO L195 NwaCegarLoop]: trace histogram [11, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:25:06,484 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-27 11:25:06,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:25:06,679 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:25:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:25:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1889064288, now seen corresponding path program 8 times [2022-04-27 11:25:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:25:06,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748657005] [2022-04-27 11:25:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:25:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:25:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:25:07,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:25:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:25:07,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {46686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46659#true} is VALID [2022-04-27 11:25:07,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {46659#true} assume true; {46659#true} is VALID [2022-04-27 11:25:07,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46659#true} {46659#true} #83#return; {46659#true} is VALID [2022-04-27 11:25:07,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {46659#true} call ULTIMATE.init(); {46686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:25:07,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {46686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46659#true} is VALID [2022-04-27 11:25:07,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {46659#true} assume true; {46659#true} is VALID [2022-04-27 11:25:07,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46659#true} {46659#true} #83#return; {46659#true} is VALID [2022-04-27 11:25:07,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {46659#true} call #t~ret15 := main(); {46659#true} is VALID [2022-04-27 11:25:07,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {46659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46664#(= main_~y~0 0)} is VALID [2022-04-27 11:25:07,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {46664#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46665#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:25:07,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {46665#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46666#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:25:07,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {46666#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46667#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:25:07,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {46667#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46668#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:25:07,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {46668#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46669#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:25:07,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {46669#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46670#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:25:07,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {46670#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46671#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:25:07,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {46671#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46672#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:25:07,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {46672#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46673#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:25:07,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {46673#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46674#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:25:07,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {46674#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46675#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:25:07,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {46675#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46675#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:25:07,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {46675#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {46676#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:25:07,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {46676#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46677#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:25:07,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {46677#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46678#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:25:07,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {46678#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46679#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:25:07,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {46679#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46680#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:25:07,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {46680#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46681#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:25:07,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {46681#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46682#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:25:07,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {46682#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46683#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:25:07,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {46683#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46684#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:25:07,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {46684#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46685#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:25:07,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {46685#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {46660#false} is VALID [2022-04-27 11:25:07,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {46660#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46660#false} is VALID [2022-04-27 11:25:07,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {46660#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46660#false} is VALID [2022-04-27 11:25:07,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {46660#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46660#false} is VALID [2022-04-27 11:25:07,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {46660#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46660#false} is VALID [2022-04-27 11:25:07,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {46660#false} assume !(~y~0 % 4294967296 > 0); {46660#false} is VALID [2022-04-27 11:25:07,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {46660#false} assume !(~x~0 % 4294967296 > 0); {46660#false} is VALID [2022-04-27 11:25:07,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {46660#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {46660#false} is VALID [2022-04-27 11:25:07,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {46660#false} assume !(~z~0 % 4294967296 > 0); {46660#false} is VALID [2022-04-27 11:25:07,045 INFO L272 TraceCheckUtils]: 37: Hoare triple {46660#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {46660#false} is VALID [2022-04-27 11:25:07,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {46660#false} ~cond := #in~cond; {46660#false} is VALID [2022-04-27 11:25:07,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {46660#false} assume 0 == ~cond; {46660#false} is VALID [2022-04-27 11:25:07,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {46660#false} assume !false; {46660#false} is VALID [2022-04-27 11:25:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 11:25:07,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:25:07,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748657005] [2022-04-27 11:25:07,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748657005] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:25:07,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636042042] [2022-04-27 11:25:07,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:25:07,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:25:07,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:25:07,047 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-27 11:25:07,048 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-27 11:25:07,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:25:07,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:25:07,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 11:25:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:25:07,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:25:07,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {46659#true} call ULTIMATE.init(); {46659#true} is VALID [2022-04-27 11:25:07,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {46659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46659#true} is VALID [2022-04-27 11:25:07,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {46659#true} assume true; {46659#true} is VALID [2022-04-27 11:25:07,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46659#true} {46659#true} #83#return; {46659#true} is VALID [2022-04-27 11:25:07,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {46659#true} call #t~ret15 := main(); {46659#true} is VALID [2022-04-27 11:25:07,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {46659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46659#true} is VALID [2022-04-27 11:25:07,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {46659#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46659#true} is VALID [2022-04-27 11:25:07,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {46659#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46659#true} is VALID [2022-04-27 11:25:07,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {46659#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46714#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:25:07,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {46714#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46718#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:25:07,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {46718#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46722#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:25:07,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {46722#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46726#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:25:07,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {46726#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46730#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:25:07,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {46730#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46734#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:25:07,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {46734#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46738#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:25:07,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {46738#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46742#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:25:07,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {46742#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-27 11:25:07,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-27 11:25:07,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} ~z~0 := ~y~0; {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-27 11:25:07,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46742#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:25:07,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {46742#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46738#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:25:07,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {46738#(< 0 (mod (+ 7 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; {46734#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:25:07,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {46734#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46730#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:25:07,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {46730#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46726#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:25:07,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {46726#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46722#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:25:07,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {46722#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46718#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:25:07,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {46718#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46714#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:25:07,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {46714#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {46660#false} is VALID [2022-04-27 11:25:07,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {46660#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {46660#false} is VALID [2022-04-27 11:25:07,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {46660#false} assume !(~z~0 % 4294967296 > 0); {46660#false} is VALID [2022-04-27 11:25:07,522 INFO L272 TraceCheckUtils]: 37: Hoare triple {46660#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {46660#false} is VALID [2022-04-27 11:25:07,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {46660#false} ~cond := #in~cond; {46660#false} is VALID [2022-04-27 11:25:07,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {46660#false} assume 0 == ~cond; {46660#false} is VALID [2022-04-27 11:25:07,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {46660#false} assume !false; {46660#false} is VALID [2022-04-27 11:25:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 27 proven. 81 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 11:25:07,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:25:07,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {46660#false} assume !false; {46660#false} is VALID [2022-04-27 11:25:07,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {46660#false} assume 0 == ~cond; {46660#false} is VALID [2022-04-27 11:25:07,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {46660#false} ~cond := #in~cond; {46660#false} is VALID [2022-04-27 11:25:07,652 INFO L272 TraceCheckUtils]: 37: Hoare triple {46660#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {46660#false} is VALID [2022-04-27 11:25:07,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {46660#false} assume !(~z~0 % 4294967296 > 0); {46660#false} is VALID [2022-04-27 11:25:07,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {46660#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {46660#false} is VALID [2022-04-27 11:25:07,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {46660#false} is VALID [2022-04-27 11:25:07,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {46780#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {46714#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46780#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:25:07,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {46718#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46714#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:25:07,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {46722#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46718#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:25:07,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {46726#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46722#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:25:07,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {46730#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46726#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:25:07,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {46734#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46730#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:25:07,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {46738#(< 0 (mod (+ 7 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; {46734#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:25:07,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {46742#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46738#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:25:07,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46742#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:25:07,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} ~z~0 := ~y~0; {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-27 11:25:07,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-27 11:25:07,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {46742#(< 0 (mod (+ main_~x~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46746#(< 0 (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-27 11:25:07,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {46738#(< 0 (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46742#(< 0 (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-27 11:25:07,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {46734#(< 0 (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46738#(< 0 (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-27 11:25:07,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {46730#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46734#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-27 11:25:07,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {46726#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46730#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:25:07,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {46722#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46726#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:25:07,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {46718#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46722#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:25:07,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {46714#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46718#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:25:07,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {46659#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46714#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:25:07,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {46659#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46659#true} is VALID [2022-04-27 11:25:07,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {46659#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46659#true} is VALID [2022-04-27 11:25:07,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {46659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46659#true} is VALID [2022-04-27 11:25:07,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {46659#true} call #t~ret15 := main(); {46659#true} is VALID [2022-04-27 11:25:07,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46659#true} {46659#true} #83#return; {46659#true} is VALID [2022-04-27 11:25:07,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {46659#true} assume true; {46659#true} is VALID [2022-04-27 11:25:07,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {46659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46659#true} is VALID [2022-04-27 11:25:07,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {46659#true} call ULTIMATE.init(); {46659#true} is VALID [2022-04-27 11:25:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 27 proven. 81 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 11:25:07,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636042042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:25:07,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:25:07,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 35 [2022-04-27 11:25:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448479598] [2022-04-27 11:25:07,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:25:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:25:07,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:25:07,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:25:07,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:25:07,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-27 11:25:07,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:25:07,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-27 11:25:07,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1114, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 11:25:07,716 INFO L87 Difference]: Start difference. First operand 731 states and 1045 transitions. Second operand has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)