/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-de42.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:12:57,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:12:57,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:12:57,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:12:57,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:12:57,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:12:57,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:12:57,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:12:57,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:12:57,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:12:57,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:12:57,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:12:57,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:12:57,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:12:57,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:12:57,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:12:57,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:12:57,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:12:57,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:12:57,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:12:57,363 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:12:57,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:12:57,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:12:57,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:12:57,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:12:57,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:12:57,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:12:57,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:12:57,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:12:57,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:12:57,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:12:57,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:12:57,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:12:57,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:12:57,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:12:57,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:12:57,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:12:57,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:12:57,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:12:57,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:12:57,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:12:57,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:12:57,377 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:12:57,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:12:57,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:12:57,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:12:57,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:12:57,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:12:57,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:12:57,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:12:57,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:12:57,397 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:12:57,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:12:57,397 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:12:57,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:12:57,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:12:57,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:12:57,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:12:57,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:12:57,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:12:57,398 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:12:57,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:12:57,399 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:12:57,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:12:57,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:12:57,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:12:57,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:12:57,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:12:57,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:12:57,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:12:57,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:12:57,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:12:57,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:12:57,400 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:12:57,400 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:12:57,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:12:57,401 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:12:57,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:12:57,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:12:57,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:12:57,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:12:57,659 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:12:57,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-27 11:12:57,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e22c1ba/8b71904838524dfcb2199f6a1ff9fb45/FLAGa9934b856 [2022-04-27 11:12:58,091 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:12:58,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-04-27 11:12:58,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e22c1ba/8b71904838524dfcb2199f6a1ff9fb45/FLAGa9934b856 [2022-04-27 11:12:58,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e22c1ba/8b71904838524dfcb2199f6a1ff9fb45 [2022-04-27 11:12:58,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:12:58,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:12:58,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:12:58,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:12:58,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:12:58,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:12:58" (1/1) ... [2022-04-27 11:12:58,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa4229c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58, skipping insertion in model container [2022-04-27 11:12:58,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:12:58" (1/1) ... [2022-04-27 11:12:58,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:12:58,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:12:58,686 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-de42.c[368,381] [2022-04-27 11:12:58,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:12:58,726 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:12:58,736 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-de42.c[368,381] [2022-04-27 11:12:58,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:12:58,752 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:12:58,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58 WrapperNode [2022-04-27 11:12:58,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:12:58,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:12:58,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:12:58,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:12:58,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58" (1/1) ... [2022-04-27 11:12:58,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58" (1/1) ... [2022-04-27 11:12:58,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58" (1/1) ... [2022-04-27 11:12:58,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58" (1/1) ... [2022-04-27 11:12:58,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58" (1/1) ... [2022-04-27 11:12:58,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58" (1/1) ... [2022-04-27 11:12:58,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58" (1/1) ... [2022-04-27 11:12:58,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:12:58,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:12:58,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:12:58,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:12:58,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58" (1/1) ... [2022-04-27 11:12:58,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:12:58,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:12:58,836 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:12:58,851 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:12:58,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:12:58,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:12:58,871 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:12:58,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:12:58,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:12:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:12:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:12:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:12:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:12:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:12:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:12:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:12:58,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:12:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:12:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:12:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:12:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:12:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:12:58,924 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:12:58,926 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:12:59,071 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:12:59,077 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:12:59,077 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-27 11:12:59,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:12:59 BoogieIcfgContainer [2022-04-27 11:12:59,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:12:59,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:12:59,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:12:59,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:12:59,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:12:58" (1/3) ... [2022-04-27 11:12:59,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d0bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:12:59, skipping insertion in model container [2022-04-27 11:12:59,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:12:58" (2/3) ... [2022-04-27 11:12:59,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d0bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:12:59, skipping insertion in model container [2022-04-27 11:12:59,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:12:59" (3/3) ... [2022-04-27 11:12:59,095 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de42.c [2022-04-27 11:12:59,124 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:12:59,125 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:12:59,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:12:59,198 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@14e73ad3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@449c775f [2022-04-27 11:12:59,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:12:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:12:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:12:59,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:12:59,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:12:59,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:12:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:12:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-27 11:12:59,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:12:59,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100717718] [2022-04-27 11:12:59,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:12:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:12:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:12:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:59,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-27 11:12:59,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 11:12:59,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-27 11:12:59,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:12:59,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-27 11:12:59,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 11:12:59,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-27 11:12:59,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-27 11:12:59,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26#true} is VALID [2022-04-27 11:12:59,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-27 11:12:59,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-27 11:12:59,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-27 11:12:59,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-27 11:12:59,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 11:12:59,464 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-27 11:12:59,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 11:12:59,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 11:12:59,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 11:12:59,465 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:12:59,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:12:59,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100717718] [2022-04-27 11:12:59,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100717718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:12:59,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:12:59,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:12:59,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23183335] [2022-04-27 11:12:59,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:12:59,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:12:59,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:12:59,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:59,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:59,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:12:59,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:12:59,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:12:59,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:12:59,539 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:59,607 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 11:12:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:12:59,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:12:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:12:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-27 11:12:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:59,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-27 11:12:59,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-27 11:12:59,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:59,693 INFO L225 Difference]: With dead ends: 39 [2022-04-27 11:12:59,693 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 11:12:59,696 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:12:59,699 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:12:59,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:12:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 11:12:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 11:12:59,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:12:59,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:59,725 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:59,725 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:59,729 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-27 11:12:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-27 11:12:59,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:59,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:59,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:12:59,731 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:12:59,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:59,733 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-27 11:12:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-27 11:12:59,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:59,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:59,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:12:59,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:12:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-27 11:12:59,738 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-27 11:12:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:12:59,738 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-27 11:12:59,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-27 11:12:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:12:59,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:12:59,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:12:59,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:12:59,740 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:12:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:12:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-27 11:12:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:12:59,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959134165] [2022-04-27 11:12:59,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:12:59,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:12:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:00,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {140#true} is VALID [2022-04-27 11:13:00,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume true; {140#true} is VALID [2022-04-27 11:13:00,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {140#true} {140#true} #72#return; {140#true} is VALID [2022-04-27 11:13:00,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {140#true} call ULTIMATE.init(); {152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:00,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {140#true} is VALID [2022-04-27 11:13:00,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume true; {140#true} is VALID [2022-04-27 11:13:00,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140#true} {140#true} #72#return; {140#true} is VALID [2022-04-27 11:13:00,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {140#true} call #t~ret13 := main(); {140#true} is VALID [2022-04-27 11:13:00,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {145#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:00,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {146#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:00,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {147#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID [2022-04-27 11:13:00,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {147#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {148#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:00,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {148#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:00,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {149#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:00,152 INFO L272 TraceCheckUtils]: 11: Hoare triple {149#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {150#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:00,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {150#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {151#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:00,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {151#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {141#false} is VALID [2022-04-27 11:13:00,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-04-27 11:13:00,153 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:00,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:00,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959134165] [2022-04-27 11:13:00,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959134165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:00,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:00,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-27 11:13:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041604598] [2022-04-27 11:13:00,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:00,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:13:00,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:00,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:00,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:00,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:13:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:13:00,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:13:00,183 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:00,681 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-04-27 11:13:00,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:13:00,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:13:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-27 11:13:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-27 11:13:00,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-27 11:13:00,764 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:00,765 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:13:00,766 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 11:13:00,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:13:00,767 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:00,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 45 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:13:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 11:13:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-27 11:13:00,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:00,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:00,775 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:00,776 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:00,778 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-27 11:13:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 11:13:00,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:00,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:00,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:13:00,783 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:13:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:00,790 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-27 11:13:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 11:13:00,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:00,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:00,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:00,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-27 11:13:00,797 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-27 11:13:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:00,797 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-27 11:13:00,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 11:13:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:13:00,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:00,798 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:00,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:13:00,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 1 times [2022-04-27 11:13:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:00,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105508128] [2022-04-27 11:13:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:00,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:00,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:00,943 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:00,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-27 11:13:00,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291#true} {291#true} #72#return; {291#true} is VALID [2022-04-27 11:13:00,944 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:00,945 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:00,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-27 11:13:00,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #72#return; {291#true} is VALID [2022-04-27 11:13:00,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret13 := main(); {291#true} is VALID [2022-04-27 11:13:00,946 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; {296#(= main_~y~0 0)} is VALID [2022-04-27 11:13:00,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {296#(= main_~y~0 0)} is VALID [2022-04-27 11:13:00,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#(= main_~y~0 0)} ~z~0 := ~y~0; {296#(= main_~y~0 0)} is VALID [2022-04-27 11:13:00,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {296#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {296#(= main_~y~0 0)} is VALID [2022-04-27 11:13:00,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#(= main_~y~0 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; {292#false} is VALID [2022-04-27 11:13:00,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {292#false} assume !(~y~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:13:00,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(~x~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:13:00,953 INFO L272 TraceCheckUtils]: 12: Hoare triple {292#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {292#false} is VALID [2022-04-27 11:13:00,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2022-04-27 11:13:00,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2022-04-27 11:13:00,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-27 11:13:00,954 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:00,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:00,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105508128] [2022-04-27 11:13:00,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105508128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:00,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:00,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:13:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126945188] [2022-04-27 11:13:00,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:00,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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:00,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:00,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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:00,970 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:00,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:13:00,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:00,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:13:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:13:00,972 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:01,061 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 11:13:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:13:01,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-27 11:13:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-27 11:13:01,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-27 11:13:01,108 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:01,109 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:13:01,109 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 11:13:01,110 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:01,111 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 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:01,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 23 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:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 11:13:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-04-27 11:13:01,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:01,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:01,117 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:01,118 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:01,119 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-27 11:13:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 11:13:01,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:01,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:01,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:13:01,120 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:13:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:01,122 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-27 11:13:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 11:13:01,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:01,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:01,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:01,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-27 11:13:01,124 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 16 [2022-04-27 11:13:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:01,124 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-27 11:13:01,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-27 11:13:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:13:01,125 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:01,125 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:01,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:13:01,126 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:01,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:01,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1509444864, now seen corresponding path program 1 times [2022-04-27 11:13:01,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:01,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958034755] [2022-04-27 11:13:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:01,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:01,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {434#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {427#true} is VALID [2022-04-27 11:13:01,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume true; {427#true} is VALID [2022-04-27 11:13:01,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {427#true} {427#true} #72#return; {427#true} is VALID [2022-04-27 11:13:01,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {427#true} call ULTIMATE.init(); {434#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:01,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {427#true} is VALID [2022-04-27 11:13:01,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} assume true; {427#true} is VALID [2022-04-27 11:13:01,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {427#true} {427#true} #72#return; {427#true} is VALID [2022-04-27 11:13:01,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {427#true} call #t~ret13 := main(); {427#true} is VALID [2022-04-27 11:13:01,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {427#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {432#(= main_~y~0 0)} is VALID [2022-04-27 11:13:01,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {432#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {432#(= main_~y~0 0)} is VALID [2022-04-27 11:13:01,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {432#(= main_~y~0 0)} ~z~0 := ~y~0; {433#(= main_~z~0 0)} is VALID [2022-04-27 11:13:01,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(= 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; {428#false} is VALID [2022-04-27 11:13:01,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#false} assume !(~z~0 % 4294967296 > 0); {428#false} is VALID [2022-04-27 11:13:01,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#false} assume !(~y~0 % 4294967296 > 0); {428#false} is VALID [2022-04-27 11:13:01,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {428#false} assume !(~x~0 % 4294967296 > 0); {428#false} is VALID [2022-04-27 11:13:01,177 INFO L272 TraceCheckUtils]: 12: Hoare triple {428#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {428#false} is VALID [2022-04-27 11:13:01,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#false} ~cond := #in~cond; {428#false} is VALID [2022-04-27 11:13:01,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {428#false} assume 0 == ~cond; {428#false} is VALID [2022-04-27 11:13:01,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-04-27 11:13:01,177 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:01,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:01,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958034755] [2022-04-27 11:13:01,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958034755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:01,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:01,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:13:01,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522521087] [2022-04-27 11:13:01,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:01,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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:01,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:01,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 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:01,192 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:01,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:13:01,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:01,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:13:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:01,194 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:01,287 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-27 11:13:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:13:01,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) 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:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 11:13:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) 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:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 11:13:01,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 11:13:01,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:01,324 INFO L225 Difference]: With dead ends: 27 [2022-04-27 11:13:01,324 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:13:01,325 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:01,326 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:01,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:13:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 11:13:01,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:01,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:01,331 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:01,331 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:01,332 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-27 11:13:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 11:13:01,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:01,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:01,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:13:01,333 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:13:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:01,334 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-27 11:13:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 11:13:01,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:01,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:01,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:01,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-27 11:13:01,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 16 [2022-04-27 11:13:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:01,336 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-27 11:13:01,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 11:13:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:13:01,337 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:01,337 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:01,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 11:13:01,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:01,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-27 11:13:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:01,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111550544] [2022-04-27 11:13:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:01,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:01,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {541#true} is VALID [2022-04-27 11:13:01,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {541#true} assume true; {541#true} is VALID [2022-04-27 11:13:01,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {541#true} {541#true} #72#return; {541#true} is VALID [2022-04-27 11:13:01,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:01,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {541#true} is VALID [2022-04-27 11:13:01,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2022-04-27 11:13:01,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #72#return; {541#true} is VALID [2022-04-27 11:13:01,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret13 := main(); {541#true} is VALID [2022-04-27 11:13:01,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {541#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {546#(= main_~y~0 0)} is VALID [2022-04-27 11:13:01,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {546#(= 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; {547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:01,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:01,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {548#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:01,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {542#false} is VALID [2022-04-27 11:13:01,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {542#false} assume !(~y~0 % 4294967296 > 0); {542#false} is VALID [2022-04-27 11:13:01,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {542#false} assume !(~x~0 % 4294967296 > 0); {542#false} is VALID [2022-04-27 11:13:01,437 INFO L272 TraceCheckUtils]: 12: Hoare triple {542#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {542#false} is VALID [2022-04-27 11:13:01,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2022-04-27 11:13:01,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {542#false} assume 0 == ~cond; {542#false} is VALID [2022-04-27 11:13:01,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {542#false} assume !false; {542#false} is VALID [2022-04-27 11:13:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:01,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:01,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111550544] [2022-04-27 11:13:01,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111550544] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:01,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159614215] [2022-04-27 11:13:01,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:01,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:01,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:01,440 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:01,452 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:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:01,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:13:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:01,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:01,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {541#true} is VALID [2022-04-27 11:13:01,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {541#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {541#true} is VALID [2022-04-27 11:13:01,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2022-04-27 11:13:01,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #72#return; {541#true} is VALID [2022-04-27 11:13:01,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret13 := main(); {541#true} is VALID [2022-04-27 11:13:01,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {541#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {546#(= main_~y~0 0)} is VALID [2022-04-27 11:13:01,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {546#(= 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; {547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:01,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:01,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {577#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:01,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {577#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {542#false} is VALID [2022-04-27 11:13:01,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {542#false} assume !(~y~0 % 4294967296 > 0); {542#false} is VALID [2022-04-27 11:13:01,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {542#false} assume !(~x~0 % 4294967296 > 0); {542#false} is VALID [2022-04-27 11:13:01,823 INFO L272 TraceCheckUtils]: 12: Hoare triple {542#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {542#false} is VALID [2022-04-27 11:13:01,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2022-04-27 11:13:01,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {542#false} assume 0 == ~cond; {542#false} is VALID [2022-04-27 11:13:01,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {542#false} assume !false; {542#false} is VALID [2022-04-27 11:13:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:01,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:01,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {542#false} assume !false; {542#false} is VALID [2022-04-27 11:13:01,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {542#false} assume 0 == ~cond; {542#false} is VALID [2022-04-27 11:13:01,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#false} ~cond := #in~cond; {542#false} is VALID [2022-04-27 11:13:01,931 INFO L272 TraceCheckUtils]: 12: Hoare triple {542#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {542#false} is VALID [2022-04-27 11:13:01,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {542#false} assume !(~x~0 % 4294967296 > 0); {542#false} is VALID [2022-04-27 11:13:01,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {542#false} assume !(~y~0 % 4294967296 > 0); {542#false} is VALID [2022-04-27 11:13:01,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {617#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {542#false} is VALID [2022-04-27 11:13:01,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {617#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:01,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {621#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:01,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(< 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; {621#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:01,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {541#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {628#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:01,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {541#true} call #t~ret13 := main(); {541#true} is VALID [2022-04-27 11:13:01,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {541#true} {541#true} #72#return; {541#true} is VALID [2022-04-27 11:13:01,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {541#true} assume true; {541#true} is VALID [2022-04-27 11:13:01,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {541#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {541#true} is VALID [2022-04-27 11:13:01,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {541#true} is VALID [2022-04-27 11:13:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:01,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159614215] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:01,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:01,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-27 11:13:01,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542080078] [2022-04-27 11:13:01,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:01,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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 16 [2022-04-27 11:13:01,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:01,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:01,955 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:01,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:13:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:01,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:13:01,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:13:01,956 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:02,285 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2022-04-27 11:13:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:13:02,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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 16 [2022-04-27 11:13:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-04-27 11:13:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-04-27 11:13:02,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 62 transitions. [2022-04-27 11:13:02,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:02,356 INFO L225 Difference]: With dead ends: 43 [2022-04-27 11:13:02,356 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 11:13:02,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:13:02,357 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 55 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:02,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 36 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 11:13:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-04-27 11:13:02,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:02,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 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:02,375 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 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:02,376 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 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:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:02,377 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 11:13:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 11:13:02,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:02,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:02,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 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 36 states. [2022-04-27 11:13:02,378 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 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 36 states. [2022-04-27 11:13:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:02,380 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 11:13:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 11:13:02,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:02,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:02,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:02,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 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:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-27 11:13:02,382 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2022-04-27 11:13:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:02,382 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-27 11:13:02,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 11:13:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 11:13:02,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:02,383 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:02,411 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:02,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:02,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-27 11:13:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:02,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552349155] [2022-04-27 11:13:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:02,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:02,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {846#true} is VALID [2022-04-27 11:13:02,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {846#true} assume true; {846#true} is VALID [2022-04-27 11:13:02,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {846#true} {846#true} #72#return; {846#true} is VALID [2022-04-27 11:13:02,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {846#true} call ULTIMATE.init(); {853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:02,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {846#true} is VALID [2022-04-27 11:13:02,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {846#true} assume true; {846#true} is VALID [2022-04-27 11:13:02,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {846#true} {846#true} #72#return; {846#true} is VALID [2022-04-27 11:13:02,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {846#true} call #t~ret13 := main(); {846#true} is VALID [2022-04-27 11:13:02,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {846#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {846#true} is VALID [2022-04-27 11:13:02,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {846#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:02,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:02,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:02,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#(<= 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; {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:02,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:02,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {852#(<= (+ (* 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; {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:02,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:02,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {847#false} is VALID [2022-04-27 11:13:02,715 INFO L272 TraceCheckUtils]: 14: Hoare triple {847#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {847#false} is VALID [2022-04-27 11:13:02,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {847#false} ~cond := #in~cond; {847#false} is VALID [2022-04-27 11:13:02,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {847#false} assume 0 == ~cond; {847#false} is VALID [2022-04-27 11:13:02,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {847#false} assume !false; {847#false} is VALID [2022-04-27 11:13:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:02,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552349155] [2022-04-27 11:13:02,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552349155] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:02,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833559626] [2022-04-27 11:13:02,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:02,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:02,717 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:02,735 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:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:02,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 11:13:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:02,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:03,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {846#true} call ULTIMATE.init(); {846#true} is VALID [2022-04-27 11:13:03,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {846#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {846#true} is VALID [2022-04-27 11:13:03,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {846#true} assume true; {846#true} is VALID [2022-04-27 11:13:03,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {846#true} {846#true} #72#return; {846#true} is VALID [2022-04-27 11:13:03,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {846#true} call #t~ret13 := main(); {846#true} is VALID [2022-04-27 11:13:03,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {846#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {846#true} is VALID [2022-04-27 11:13:03,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {846#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:03,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:03,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:03,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#(<= 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; {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:03,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:03,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {852#(<= (+ (* 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; {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:03,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:03,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {847#false} is VALID [2022-04-27 11:13:03,091 INFO L272 TraceCheckUtils]: 14: Hoare triple {847#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {847#false} is VALID [2022-04-27 11:13:03,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {847#false} ~cond := #in~cond; {847#false} is VALID [2022-04-27 11:13:03,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {847#false} assume 0 == ~cond; {847#false} is VALID [2022-04-27 11:13:03,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {847#false} assume !false; {847#false} is VALID [2022-04-27 11:13:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:03,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:03,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {847#false} assume !false; {847#false} is VALID [2022-04-27 11:13:03,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {847#false} assume 0 == ~cond; {847#false} is VALID [2022-04-27 11:13:03,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {847#false} ~cond := #in~cond; {847#false} is VALID [2022-04-27 11:13:03,373 INFO L272 TraceCheckUtils]: 14: Hoare triple {847#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {847#false} is VALID [2022-04-27 11:13:03,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {847#false} is VALID [2022-04-27 11:13:03,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:03,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {852#(<= (+ (* 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; {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:03,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:03,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#(<= 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; {852#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:13:03,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:03,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:03,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {846#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {851#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:03,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {846#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {846#true} is VALID [2022-04-27 11:13:03,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {846#true} call #t~ret13 := main(); {846#true} is VALID [2022-04-27 11:13:03,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {846#true} {846#true} #72#return; {846#true} is VALID [2022-04-27 11:13:03,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {846#true} assume true; {846#true} is VALID [2022-04-27 11:13:03,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {846#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {846#true} is VALID [2022-04-27 11:13:03,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {846#true} call ULTIMATE.init(); {846#true} is VALID [2022-04-27 11:13:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:03,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833559626] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:03,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:03,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-27 11:13:03,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133731323] [2022-04-27 11:13:03,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:03,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 18 [2022-04-27 11:13:03,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:03,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:03,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:03,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:13:03,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:03,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:13:03,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:03,405 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:03,562 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 11:13:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:13:03,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 18 [2022-04-27 11:13:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 11:13:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 11:13:03,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-27 11:13:03,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:03,606 INFO L225 Difference]: With dead ends: 45 [2022-04-27 11:13:03,607 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 11:13:03,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 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:03,608 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:03,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 11:13:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-04-27 11:13:03,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:03,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:03,634 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:03,634 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:03,635 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-27 11:13:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-04-27 11:13:03,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:03,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:03,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 11:13:03,636 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 11:13:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:03,638 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-27 11:13:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-04-27 11:13:03,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:03,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:03,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:03,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2022-04-27 11:13:03,641 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 18 [2022-04-27 11:13:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:03,641 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-04-27 11:13:03,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-04-27 11:13:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:13:03,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:03,642 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:03,669 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:03,863 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,SelfDestructingSolverStorable5 [2022-04-27 11:13:03,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:03,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-27 11:13:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:03,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556963037] [2022-04-27 11:13:03,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:03,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:04,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1170#true} is VALID [2022-04-27 11:13:04,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-27 11:13:04,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1170#true} {1170#true} #72#return; {1170#true} is VALID [2022-04-27 11:13:04,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:04,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1170#true} is VALID [2022-04-27 11:13:04,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-27 11:13:04,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #72#return; {1170#true} is VALID [2022-04-27 11:13:04,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret13 := main(); {1170#true} is VALID [2022-04-27 11:13:04,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {1170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1175#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:13:04,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1176#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-27 11:13:04,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {1176#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1177#(and (<= (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 1) (* main_~n~0 2)) (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1)) (<= 1 main_~y~0))} is VALID [2022-04-27 11:13:04,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {1177#(and (<= (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 1) (* main_~n~0 2)) (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1)) (<= 1 main_~y~0))} ~z~0 := ~y~0; {1178#(and (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 1) (* main_~n~0 2)) (<= 1 main_~z~0) (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 1)))} is VALID [2022-04-27 11:13:04,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(and (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 1) (* main_~n~0 2)) (<= 1 main_~z~0) (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 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; {1179#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:04,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {1179#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1179#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:04,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 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; {1180#(and (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:04,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {1180#(and (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1180#(and (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:04,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {1180#(and (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 1)) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1181#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:04,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {1181#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1181#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:04,195 INFO L272 TraceCheckUtils]: 15: Hoare triple {1181#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1182#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:04,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {1182#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1183#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:04,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1171#false} is VALID [2022-04-27 11:13:04,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2022-04-27 11:13:04,196 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:04,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:04,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556963037] [2022-04-27 11:13:04,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556963037] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:04,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766752173] [2022-04-27 11:13:04,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:04,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:04,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:04,200 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:04,213 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:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:04,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 11:13:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:04,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:05,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2022-04-27 11:13:05,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1170#true} is VALID [2022-04-27 11:13:05,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-27 11:13:05,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #72#return; {1170#true} is VALID [2022-04-27 11:13:05,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret13 := main(); {1170#true} is VALID [2022-04-27 11:13:05,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {1170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1175#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:13:05,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1176#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-27 11:13:05,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {1176#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1209#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-27 11:13:05,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {1209#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} ~z~0 := ~y~0; {1213#(and (<= (+ (* main_~x~0 2) main_~z~0 1) (* main_~n~0 2)) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:05,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {1213#(and (<= (+ (* main_~x~0 2) main_~z~0 1) (* main_~n~0 2)) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~n~0 (+ main_~x~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; {1217#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-27 11:13:05,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {1217#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} assume !(~z~0 % 4294967296 > 0); {1217#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-27 11:13:05,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {1217#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~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; {1224#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:05,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {1224#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1224#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:05,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1231#(and (<= (mod main_~x~0 4294967296) 0) (<= main_~n~0 (+ main_~x~0 1)) (<= 2 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-27 11:13:05,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {1231#(and (<= (mod main_~x~0 4294967296) 0) (<= main_~n~0 (+ main_~x~0 1)) (<= 2 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} assume !(~x~0 % 4294967296 > 0); {1235#(and (<= (div (+ (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (div (* (- 1) main_~z~0) 2) main_~n~0) 4294967296)) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:05,857 INFO L272 TraceCheckUtils]: 15: Hoare triple {1235#(and (<= (div (+ (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (div (* (- 1) main_~z~0) 2) main_~n~0) 4294967296)) (<= 2 main_~z~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1239#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:05,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1243#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:05,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {1243#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1171#false} is VALID [2022-04-27 11:13:05,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2022-04-27 11:13:05,858 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:05,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:06,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2022-04-27 11:13:06,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {1243#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1171#false} is VALID [2022-04-27 11:13:06,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1243#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:06,610 INFO L272 TraceCheckUtils]: 15: Hoare triple {1181#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1239#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:06,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {1181#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:06,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {1266#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {1262#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:13:06,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {1266#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !(~y~0 % 4294967296 > 0); {1266#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-27 11:13:06,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {1273#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~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; {1266#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-27 11:13:06,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {1273#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~z~0 % 4294967296 > 0); {1273#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:13:06,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {1280#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 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; {1273#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:13:06,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {1284#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {1280#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:06,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {1284#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1284#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:06,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {1291#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1284#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 1) (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:06,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {1170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1291#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))))} is VALID [2022-04-27 11:13:06,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret13 := main(); {1170#true} is VALID [2022-04-27 11:13:06,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #72#return; {1170#true} is VALID [2022-04-27 11:13:06,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2022-04-27 11:13:06,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1170#true} is VALID [2022-04-27 11:13:06,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2022-04-27 11:13:06,625 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:06,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766752173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:06,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:06,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 26 [2022-04-27 11:13:06,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015337175] [2022-04-27 11:13:06,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:06,627 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 23 states have internal predecessors, (36), 3 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 19 [2022-04-27 11:13:06,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:06,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.44) internal successors, (36), 23 states have internal predecessors, (36), 3 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:06,690 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:06,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 11:13:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:06,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 11:13:06,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:13:06,692 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 23 states have internal predecessors, (36), 3 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:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:08,062 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-04-27 11:13:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 11:13:08,063 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 23 states have internal predecessors, (36), 3 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 19 [2022-04-27 11:13:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 23 states have internal predecessors, (36), 3 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:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-04-27 11:13:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 23 states have internal predecessors, (36), 3 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:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-04-27 11:13:08,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 52 transitions. [2022-04-27 11:13:08,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:08,130 INFO L225 Difference]: With dead ends: 52 [2022-04-27 11:13:08,130 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 11:13:08,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 11:13:08,131 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:08,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 79 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:13:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 11:13:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 11:13:08,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:08,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:08,154 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:08,154 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:08,155 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-27 11:13:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-27 11:13:08,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:08,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:08,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 11:13:08,156 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 11:13:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:08,157 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-27 11:13:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-27 11:13:08,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:08,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:08,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:08,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-27 11:13:08,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 19 [2022-04-27 11:13:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:08,159 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-04-27 11:13:08,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 23 states have internal predecessors, (36), 3 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:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-04-27 11:13:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:13:08,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:08,160 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:08,186 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:08,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:08,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash 146579608, now seen corresponding path program 2 times [2022-04-27 11:13:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:08,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702863656] [2022-04-27 11:13:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:08,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {1536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1525#true} is VALID [2022-04-27 11:13:08,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-27 11:13:08,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1525#true} {1525#true} #72#return; {1525#true} is VALID [2022-04-27 11:13:08,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:08,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {1536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1525#true} is VALID [2022-04-27 11:13:08,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-27 11:13:08,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1525#true} {1525#true} #72#return; {1525#true} is VALID [2022-04-27 11:13:08,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {1525#true} call #t~ret13 := main(); {1525#true} is VALID [2022-04-27 11:13:08,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {1525#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1530#(= main_~y~0 0)} is VALID [2022-04-27 11:13:08,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {1530#(= 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; {1531#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:08,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {1531#(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; {1532#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:08,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {1532#(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; {1533#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:08,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {1533#(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; {1534#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:08,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {1534#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1534#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:08,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {1534#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {1535#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:08,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {1535#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1526#false} is VALID [2022-04-27 11:13:08,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {1526#false} assume !(~y~0 % 4294967296 > 0); {1526#false} is VALID [2022-04-27 11:13:08,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {1526#false} assume !(~x~0 % 4294967296 > 0); {1526#false} is VALID [2022-04-27 11:13:08,491 INFO L272 TraceCheckUtils]: 15: Hoare triple {1526#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1526#false} is VALID [2022-04-27 11:13:08,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-27 11:13:08,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-27 11:13:08,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-27 11:13:08,491 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:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:08,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702863656] [2022-04-27 11:13:08,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702863656] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:08,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732795139] [2022-04-27 11:13:08,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:08,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:08,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:08,493 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:08,500 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:08,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:08,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:08,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:13:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:08,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:08,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-27 11:13:08,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1525#true} is VALID [2022-04-27 11:13:08,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-27 11:13:08,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1525#true} {1525#true} #72#return; {1525#true} is VALID [2022-04-27 11:13:08,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {1525#true} call #t~ret13 := main(); {1525#true} is VALID [2022-04-27 11:13:08,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {1525#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1530#(= main_~y~0 0)} is VALID [2022-04-27 11:13:08,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {1530#(= 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; {1531#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:08,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {1531#(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; {1532#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:08,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {1532#(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; {1533#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:08,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {1533#(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; {1534#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:08,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {1534#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1534#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:08,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {1534#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {1573#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:08,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {1573#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {1526#false} is VALID [2022-04-27 11:13:08,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {1526#false} assume !(~y~0 % 4294967296 > 0); {1526#false} is VALID [2022-04-27 11:13:08,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {1526#false} assume !(~x~0 % 4294967296 > 0); {1526#false} is VALID [2022-04-27 11:13:08,772 INFO L272 TraceCheckUtils]: 15: Hoare triple {1526#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1526#false} is VALID [2022-04-27 11:13:08,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-27 11:13:08,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-27 11:13:08,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-27 11:13:08,772 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:08,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:08,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-27 11:13:08,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-27 11:13:08,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-27 11:13:08,906 INFO L272 TraceCheckUtils]: 15: Hoare triple {1526#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {1526#false} is VALID [2022-04-27 11:13:08,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {1526#false} assume !(~x~0 % 4294967296 > 0); {1526#false} is VALID [2022-04-27 11:13:08,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {1526#false} assume !(~y~0 % 4294967296 > 0); {1526#false} is VALID [2022-04-27 11:13:08,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {1613#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1526#false} is VALID [2022-04-27 11:13:08,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {1617#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1613#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:08,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {1617#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1617#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:08,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {1624#(< 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; {1617#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:08,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {1628#(< 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; {1624#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:08,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {1632#(< 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; {1628#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:13:08,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {1636#(< 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; {1632#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:13:08,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {1525#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1636#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:13:08,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {1525#true} call #t~ret13 := main(); {1525#true} is VALID [2022-04-27 11:13:08,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1525#true} {1525#true} #72#return; {1525#true} is VALID [2022-04-27 11:13:08,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-27 11:13:08,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1525#true} is VALID [2022-04-27 11:13:08,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-27 11:13:08,917 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:08,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732795139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:08,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:08,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 11:13:08,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314995764] [2022-04-27 11:13:08,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:08,918 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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 19 [2022-04-27 11:13:08,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:08,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:08,939 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:08,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:13:08,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:08,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:13:08,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:13:08,941 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:10,388 INFO L93 Difference]: Finished difference Result 112 states and 185 transitions. [2022-04-27 11:13:10,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 11:13:10,388 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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 19 [2022-04-27 11:13:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 116 transitions. [2022-04-27 11:13:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 116 transitions. [2022-04-27 11:13:10,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 116 transitions. [2022-04-27 11:13:10,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:10,547 INFO L225 Difference]: With dead ends: 112 [2022-04-27 11:13:10,547 INFO L226 Difference]: Without dead ends: 101 [2022-04-27 11:13:10,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=391, Invalid=1091, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 11:13:10,548 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 176 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:10,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 55 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:13:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-27 11:13:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 59. [2022-04-27 11:13:10,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:10,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 59 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 3 states have call successors, (3), 3 states 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:10,616 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 59 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 3 states have call successors, (3), 3 states 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:10,617 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 59 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 3 states have call successors, (3), 3 states 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:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:10,620 INFO L93 Difference]: Finished difference Result 101 states and 145 transitions. [2022-04-27 11:13:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 145 transitions. [2022-04-27 11:13:10,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:10,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:10,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-27 11:13:10,621 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-27 11:13:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:10,625 INFO L93 Difference]: Finished difference Result 101 states and 145 transitions. [2022-04-27 11:13:10,625 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 145 transitions. [2022-04-27 11:13:10,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:10,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:10,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:10,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 3 states have call successors, (3), 3 states 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:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2022-04-27 11:13:10,627 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 19 [2022-04-27 11:13:10,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:10,627 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2022-04-27 11:13:10,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 states have internal predecessors, (26), 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:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2022-04-27 11:13:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:13:10,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:10,628 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:10,652 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:10,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:10,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:10,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:10,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1586904504, now seen corresponding path program 2 times [2022-04-27 11:13:10,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:10,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353621141] [2022-04-27 11:13:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:10,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:10,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:10,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {2165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-27 11:13:10,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-27 11:13:10,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #72#return; {2155#true} is VALID [2022-04-27 11:13:10,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:10,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {2165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-27 11:13:10,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-27 11:13:10,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #72#return; {2155#true} is VALID [2022-04-27 11:13:10,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret13 := main(); {2155#true} is VALID [2022-04-27 11:13:10,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2160#(= main_~y~0 0)} is VALID [2022-04-27 11:13:10,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#(= 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; {2161#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:10,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {2161#(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; {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:10,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:10,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2163#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:10,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {2163#(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; {2164#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:10,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {2164#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-27 11:13:10,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID [2022-04-27 11:13:10,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID [2022-04-27 11:13:10,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#false} assume !(~y~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-27 11:13:10,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {2156#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2156#false} is VALID [2022-04-27 11:13:10,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {2156#false} assume !(~x~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-27 11:13:10,964 INFO L272 TraceCheckUtils]: 17: Hoare triple {2156#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2156#false} is VALID [2022-04-27 11:13:10,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID [2022-04-27 11:13:10,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID [2022-04-27 11:13:10,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-27 11:13:10,964 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:10,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:10,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353621141] [2022-04-27 11:13:10,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353621141] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:10,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126977362] [2022-04-27 11:13:10,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:10,966 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:10,967 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:11,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:11,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:11,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:13:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:11,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:11,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-27 11:13:11,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-27 11:13:11,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-27 11:13:11,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #72#return; {2155#true} is VALID [2022-04-27 11:13:11,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret13 := main(); {2155#true} is VALID [2022-04-27 11:13:11,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2160#(= main_~y~0 0)} is VALID [2022-04-27 11:13:11,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#(= 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; {2161#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:11,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {2161#(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; {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:11,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:11,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2196#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:11,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {2196#(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; {2200#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:13:11,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {2200#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-27 11:13:11,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID [2022-04-27 11:13:11,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID [2022-04-27 11:13:11,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#false} assume !(~y~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-27 11:13:11,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {2156#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2156#false} is VALID [2022-04-27 11:13:11,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {2156#false} assume !(~x~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-27 11:13:11,120 INFO L272 TraceCheckUtils]: 17: Hoare triple {2156#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2156#false} is VALID [2022-04-27 11:13:11,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID [2022-04-27 11:13:11,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID [2022-04-27 11:13:11,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-27 11:13:11,120 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:11,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:11,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-27 11:13:11,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID [2022-04-27 11:13:11,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID [2022-04-27 11:13:11,245 INFO L272 TraceCheckUtils]: 17: Hoare triple {2156#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2156#false} is VALID [2022-04-27 11:13:11,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {2156#false} assume !(~x~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-27 11:13:11,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {2156#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {2156#false} is VALID [2022-04-27 11:13:11,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#false} assume !(~y~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-27 11:13:11,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {2252#(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; {2156#false} is VALID [2022-04-27 11:13:11,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {2256#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2252#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:13:11,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {2260#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2256#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:13:11,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {2264#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2260#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:13:11,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} ~z~0 := ~y~0; {2264#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:13:11,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(~x~0 % 4294967296 > 0); {2155#true} is VALID [2022-04-27 11:13:11,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2155#true} is VALID [2022-04-27 11:13:11,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {2155#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2155#true} is VALID [2022-04-27 11:13:11,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2155#true} is VALID [2022-04-27 11:13:11,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret13 := main(); {2155#true} is VALID [2022-04-27 11:13:11,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #72#return; {2155#true} is VALID [2022-04-27 11:13:11,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-27 11:13:11,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-27 11:13:11,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-27 11:13:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:13:11,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126977362] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:11,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:11,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-27 11:13:11,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409273473] [2022-04-27 11:13:11,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:11,251 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (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 21 [2022-04-27 11:13:11,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:11,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (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:11,279 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:11,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:13:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:11,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:13:11,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:13:11,280 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (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:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:11,879 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2022-04-27 11:13:11,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:13:11,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (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 21 [2022-04-27 11:13:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (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:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2022-04-27 11:13:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (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:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2022-04-27 11:13:11,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 60 transitions. [2022-04-27 11:13:11,942 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:11,944 INFO L225 Difference]: With dead ends: 85 [2022-04-27 11:13:11,944 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 11:13:11,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:13:11,945 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 35 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:11,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 42 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:13:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 11:13:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2022-04-27 11:13:12,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:12,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:12,035 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:12,036 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:12,038 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2022-04-27 11:13:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2022-04-27 11:13:12,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:12,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:12,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-27 11:13:12,039 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-27 11:13:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:12,040 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2022-04-27 11:13:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2022-04-27 11:13:12,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:12,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:12,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:12,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2022-04-27 11:13:12,042 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 21 [2022-04-27 11:13:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:12,042 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2022-04-27 11:13:12,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (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:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-27 11:13:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:13:12,043 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:12,043 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:12,071 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:12,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:12,263 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 323810136, now seen corresponding path program 2 times [2022-04-27 11:13:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:12,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99131668] [2022-04-27 11:13:12,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:12,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {2685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2676#true} is VALID [2022-04-27 11:13:12,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {2676#true} assume true; {2676#true} is VALID [2022-04-27 11:13:12,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2676#true} {2676#true} #72#return; {2676#true} is VALID [2022-04-27 11:13:12,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {2676#true} call ULTIMATE.init(); {2685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:12,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {2685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2676#true} is VALID [2022-04-27 11:13:12,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {2676#true} assume true; {2676#true} is VALID [2022-04-27 11:13:12,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2676#true} {2676#true} #72#return; {2676#true} is VALID [2022-04-27 11:13:12,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {2676#true} call #t~ret13 := main(); {2676#true} is VALID [2022-04-27 11:13:12,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {2676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2676#true} is VALID [2022-04-27 11:13:12,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {2676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2681#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:12,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {2681#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2682#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:13:12,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {2682#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2682#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:13:12,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {2682#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {2682#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:13:12,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {2682#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2683#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:13:12,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {2683#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2684#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:12,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {2684#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2684#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:12,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {2684#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2684#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:12,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {2684#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2684#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:12,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {2684#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2684#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:12,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {2684#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2677#false} is VALID [2022-04-27 11:13:12,367 INFO L272 TraceCheckUtils]: 17: Hoare triple {2677#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2677#false} is VALID [2022-04-27 11:13:12,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {2677#false} ~cond := #in~cond; {2677#false} is VALID [2022-04-27 11:13:12,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {2677#false} assume 0 == ~cond; {2677#false} is VALID [2022-04-27 11:13:12,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {2677#false} assume !false; {2677#false} is VALID [2022-04-27 11:13:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:12,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:12,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99131668] [2022-04-27 11:13:12,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99131668] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:12,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155895814] [2022-04-27 11:13:12,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:12,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:12,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:12,374 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:12,401 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:12,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:12,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:12,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:13:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:12,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:12,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {2676#true} call ULTIMATE.init(); {2676#true} is VALID [2022-04-27 11:13:12,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {2676#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2676#true} is VALID [2022-04-27 11:13:12,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {2676#true} assume true; {2676#true} is VALID [2022-04-27 11:13:12,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2676#true} {2676#true} #72#return; {2676#true} is VALID [2022-04-27 11:13:12,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {2676#true} call #t~ret13 := main(); {2676#true} is VALID [2022-04-27 11:13:12,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {2676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2676#true} is VALID [2022-04-27 11:13:12,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {2676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2681#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:12,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {2681#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:13:12,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:13:12,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:13:12,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2681#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:12,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {2681#(<= 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; {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:12,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:12,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:12,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:12,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:12,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2677#false} is VALID [2022-04-27 11:13:12,684 INFO L272 TraceCheckUtils]: 17: Hoare triple {2677#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2677#false} is VALID [2022-04-27 11:13:12,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {2677#false} ~cond := #in~cond; {2677#false} is VALID [2022-04-27 11:13:12,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {2677#false} assume 0 == ~cond; {2677#false} is VALID [2022-04-27 11:13:12,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {2677#false} assume !false; {2677#false} is VALID [2022-04-27 11:13:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:12,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:12,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {2677#false} assume !false; {2677#false} is VALID [2022-04-27 11:13:12,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {2677#false} assume 0 == ~cond; {2677#false} is VALID [2022-04-27 11:13:12,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {2677#false} ~cond := #in~cond; {2677#false} is VALID [2022-04-27 11:13:12,958 INFO L272 TraceCheckUtils]: 17: Hoare triple {2677#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {2677#false} is VALID [2022-04-27 11:13:12,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2677#false} is VALID [2022-04-27 11:13:12,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:12,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:12,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:12,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:12,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {2681#(<= 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; {2723#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:12,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2681#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:12,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} ~z~0 := ~y~0; {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:13:12,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !(~x~0 % 4294967296 > 0); {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:13:12,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {2681#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2710#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:13:12,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {2676#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2681#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:12,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {2676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2676#true} is VALID [2022-04-27 11:13:12,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {2676#true} call #t~ret13 := main(); {2676#true} is VALID [2022-04-27 11:13:12,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2676#true} {2676#true} #72#return; {2676#true} is VALID [2022-04-27 11:13:12,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {2676#true} assume true; {2676#true} is VALID [2022-04-27 11:13:12,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {2676#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2676#true} is VALID [2022-04-27 11:13:12,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {2676#true} call ULTIMATE.init(); {2676#true} is VALID [2022-04-27 11:13:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:12,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155895814] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:12,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:12,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-27 11:13:12,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770198942] [2022-04-27 11:13:12,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:12,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 21 [2022-04-27 11:13:12,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:12,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:12,998 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:12,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:13:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:13:12,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:13:13,000 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:13,343 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2022-04-27 11:13:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:13:13,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 21 [2022-04-27 11:13:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-27 11:13:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-27 11:13:13,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-27 11:13:13,390 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:13,391 INFO L225 Difference]: With dead ends: 78 [2022-04-27 11:13:13,391 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 11:13:13,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:13:13,392 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:13,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 38 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 11:13:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2022-04-27 11:13:13,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:13,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 69 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 3 states have call successors, (3), 3 states 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:13,489 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 69 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 3 states have call successors, (3), 3 states 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:13,489 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 69 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 3 states have call successors, (3), 3 states 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:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:13,492 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2022-04-27 11:13:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2022-04-27 11:13:13,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:13,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:13,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-27 11:13:13,493 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-27 11:13:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:13,494 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2022-04-27 11:13:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2022-04-27 11:13:13,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:13,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:13,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:13,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 3 states have call successors, (3), 3 states 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:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2022-04-27 11:13:13,496 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 21 [2022-04-27 11:13:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:13,496 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2022-04-27 11:13:13,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2022-04-27 11:13:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:13:13,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:13,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:13,517 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:13,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:13,712 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:13,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:13,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 3 times [2022-04-27 11:13:13,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:13,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135067867] [2022-04-27 11:13:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:14,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:14,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {3209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3192#true} is VALID [2022-04-27 11:13:14,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {3192#true} assume true; {3192#true} is VALID [2022-04-27 11:13:14,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3192#true} {3192#true} #72#return; {3192#true} is VALID [2022-04-27 11:13:14,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {3192#true} call ULTIMATE.init(); {3209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:14,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {3209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3192#true} is VALID [2022-04-27 11:13:14,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {3192#true} assume true; {3192#true} is VALID [2022-04-27 11:13:14,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3192#true} {3192#true} #72#return; {3192#true} is VALID [2022-04-27 11:13:14,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {3192#true} call #t~ret13 := main(); {3192#true} is VALID [2022-04-27 11:13:14,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {3192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3197#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:13:14,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {3197#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3198#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-27 11:13:14,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {3198#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3199#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:14,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {3199#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {3200#(and (<= main_~n~0 (+ 2 (* 4294967296 (div main_~x~0 4294967296)))) (<= 2 main_~y~0) (<= (+ main_~y~0 2 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} is VALID [2022-04-27 11:13:14,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {3200#(and (<= main_~n~0 (+ 2 (* 4294967296 (div main_~x~0 4294967296)))) (<= 2 main_~y~0) (<= (+ main_~y~0 2 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} ~z~0 := ~y~0; {3201#(and (<= main_~n~0 (+ 2 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~z~0 2 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:14,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {3201#(and (<= main_~n~0 (+ 2 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~z~0 2 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~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; {3202#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 2147483648))) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:14,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {3202#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 2147483648))) (<= 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; {3203#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296) 2147483648))) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:14,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {3203#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296) 2147483648))) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3203#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296) 2147483648))) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:14,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {3203#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296) 2147483648))) (<= 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; {3202#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 2147483648))) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:14,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {3202#(and (<= main_~n~0 (+ 2 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 2147483648))) (<= 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; {3204#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:14,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {3204#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {3204#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:14,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {3204#(and (<= main_~n~0 (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)) (<= 2 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3205#(and (<= 3 main_~z~0) (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)))} is VALID [2022-04-27 11:13:14,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {3205#(and (<= 3 main_~z~0) (<= main_~n~0 (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 2147483648) 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3206#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:14,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {3206#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3206#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:14,103 INFO L272 TraceCheckUtils]: 19: Hoare triple {3206#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3207#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:14,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {3207#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3208#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:14,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {3208#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3193#false} is VALID [2022-04-27 11:13:14,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {3193#false} assume !false; {3193#false} is VALID [2022-04-27 11:13:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:14,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135067867] [2022-04-27 11:13:14,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135067867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115650468] [2022-04-27 11:13:14,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:14,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:14,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:14,105 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:14,106 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:14,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:13:14,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:14,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 11:13:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:14,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:44,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {3192#true} call ULTIMATE.init(); {3192#true} is VALID [2022-04-27 11:13:44,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {3192#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3192#true} is VALID [2022-04-27 11:13:44,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {3192#true} assume true; {3192#true} is VALID [2022-04-27 11:13:44,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3192#true} {3192#true} #72#return; {3192#true} is VALID [2022-04-27 11:13:44,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {3192#true} call #t~ret13 := main(); {3192#true} is VALID [2022-04-27 11:13:44,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {3192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3197#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:13:44,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {3197#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3198#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-27 11:13:44,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {3198#(and (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3199#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:44,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {3199#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {3199#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:44,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {3199#(and (<= 2 main_~y~0) (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {3240#(and (<= (+ (* main_~x~0 2) main_~z~0 2) (* main_~n~0 2)) (<= 2 main_~z~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:44,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {3240#(and (<= (+ (* main_~x~0 2) main_~z~0 2) (* main_~n~0 2)) (<= 2 main_~z~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3244#(and (<= (+ (* main_~x~0 2) main_~z~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~0 1)) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:44,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(and (<= (+ (* main_~x~0 2) main_~z~0 1) (* main_~n~0 2)) (<= main_~n~0 (+ main_~x~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; {3248#(and (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-27 11:13:44,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {3248#(and (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} assume !(~z~0 % 4294967296 > 0); {3248#(and (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-27 11:13:44,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {3248#(and (<= main_~n~0 main_~x~0) (<= 0 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~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; {3255#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (<= main_~n~0 main_~x~0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:44,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {3255#(and (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (<= main_~n~0 main_~x~0) (<= 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; {3259#(and (<= main_~n~0 main_~x~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ 2 (* main_~n~0 2))) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:44,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {3259#(and (<= main_~n~0 main_~x~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ 2 (* main_~n~0 2))) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {3259#(and (<= main_~n~0 main_~x~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ 2 (* main_~n~0 2))) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:44,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {3259#(and (<= main_~n~0 main_~x~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ 2 (* main_~n~0 2))) (<= 2 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3266#(and (<= 3 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:13:44,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {3266#(and (<= 3 main_~z~0) (<= (+ (* main_~x~0 2) main_~z~0) (+ (* main_~n~0 2) 1)) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3270#(and (<= 4 main_~z~0) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~n~0 (+ main_~x~0 2)) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} is VALID [2022-04-27 11:13:44,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {3270#(and (<= 4 main_~z~0) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~n~0 (+ main_~x~0 2)) (<= (+ (* main_~x~0 2) main_~z~0) (* main_~n~0 2)))} assume !(~x~0 % 4294967296 > 0); {3274#(and (<= 4 main_~z~0) (< (+ (div (+ 4294967296 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 4294967294) (* (- 1) main_~n~0)) (- 4294967296))) (+ (div (+ main_~n~0 (- 4294967296) (div (+ 8589934592 (* (- 1) main_~z~0)) 2)) 4294967296) (div (+ main_~n~0 (div (+ 8589934592 (* (- 1) main_~z~0)) 2)) 4294967296) 1)))} is VALID [2022-04-27 11:13:44,402 INFO L272 TraceCheckUtils]: 19: Hoare triple {3274#(and (<= 4 main_~z~0) (< (+ (div (+ 4294967296 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 4294967294) (* (- 1) main_~n~0)) (- 4294967296))) (+ (div (+ main_~n~0 (- 4294967296) (div (+ 8589934592 (* (- 1) main_~z~0)) 2)) 4294967296) (div (+ main_~n~0 (div (+ 8589934592 (* (- 1) main_~z~0)) 2)) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3278#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:44,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {3278#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3282#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:44,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {3282#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3193#false} is VALID [2022-04-27 11:13:44,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {3193#false} assume !false; {3193#false} is VALID [2022-04-27 11:13:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:44,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:45,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {3193#false} assume !false; {3193#false} is VALID [2022-04-27 11:13:45,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {3282#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3193#false} is VALID [2022-04-27 11:13:45,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {3278#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3282#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:45,696 INFO L272 TraceCheckUtils]: 19: Hoare triple {3206#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3278#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:45,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {3301#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {3206#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:45,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {3305#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3301#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:13:45,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {3309#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3305#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-27 11:13:45,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {3309#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~y~0 % 4294967296 > 0); {3309#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:13:45,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {3316#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 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; {3309#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:13:45,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {3320#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 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; {3316#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:13:45,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {3320#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3320#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:13:45,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {3327#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3320#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:13:45,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {3331#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~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; {3327#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-27 11:13:45,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {3335#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {3331#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:13:45,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {3335#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3335#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:45,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {3342#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~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; {3335#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 2) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:45,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {3346#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ 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; {3342#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:13:45,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {3192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3346#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-27 11:13:45,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {3192#true} call #t~ret13 := main(); {3192#true} is VALID [2022-04-27 11:13:45,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3192#true} {3192#true} #72#return; {3192#true} is VALID [2022-04-27 11:13:45,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {3192#true} assume true; {3192#true} is VALID [2022-04-27 11:13:45,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {3192#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3192#true} is VALID [2022-04-27 11:13:45,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {3192#true} call ULTIMATE.init(); {3192#true} is VALID [2022-04-27 11:13:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:45,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115650468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:45,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:45,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2022-04-27 11:13:45,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001954912] [2022-04-27 11:13:45,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:45,716 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 32 states have internal predecessors, (47), 3 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 23 [2022-04-27 11:13:45,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:45,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 32 states have internal predecessors, (47), 3 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:46,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:46,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-27 11:13:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:46,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-27 11:13:46,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1094, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 11:13:46,356 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 32 states have internal predecessors, (47), 3 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:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:53,824 INFO L93 Difference]: Finished difference Result 93 states and 124 transitions. [2022-04-27 11:13:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 11:13:53,825 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 32 states have internal predecessors, (47), 3 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 23 [2022-04-27 11:13:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 32 states have internal predecessors, (47), 3 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:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 67 transitions. [2022-04-27 11:13:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 32 states have internal predecessors, (47), 3 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:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 67 transitions. [2022-04-27 11:13:53,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 67 transitions. [2022-04-27 11:13:53,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:53,991 INFO L225 Difference]: With dead ends: 93 [2022-04-27 11:13:53,991 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 11:13:53,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=351, Invalid=2729, Unknown=0, NotChecked=0, Total=3080 [2022-04-27 11:13:53,993 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 80 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:53,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 113 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 11:13:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 11:13:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-27 11:13:54,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:54,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 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:54,097 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 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:54,098 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 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:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:54,099 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2022-04-27 11:13:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2022-04-27 11:13:54,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:54,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:54,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 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 79 states. [2022-04-27 11:13:54,100 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 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 79 states. [2022-04-27 11:13:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:54,102 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2022-04-27 11:13:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2022-04-27 11:13:54,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:54,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:54,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:54,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 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:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2022-04-27 11:13:54,103 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 23 [2022-04-27 11:13:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:54,104 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2022-04-27 11:13:54,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 32 states have internal predecessors, (47), 3 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:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2022-04-27 11:13:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:13:54,104 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:54,104 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:54,108 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:54,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:54,305 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:54,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1493658120, now seen corresponding path program 4 times [2022-04-27 11:13:54,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:54,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882173613] [2022-04-27 11:13:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:54,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:54,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {3827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3814#true} is VALID [2022-04-27 11:13:54,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {3814#true} assume true; {3814#true} is VALID [2022-04-27 11:13:54,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3814#true} {3814#true} #72#return; {3814#true} is VALID [2022-04-27 11:13:54,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {3814#true} call ULTIMATE.init(); {3827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:54,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {3827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3814#true} is VALID [2022-04-27 11:13:54,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {3814#true} assume true; {3814#true} is VALID [2022-04-27 11:13:54,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3814#true} {3814#true} #72#return; {3814#true} is VALID [2022-04-27 11:13:54,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {3814#true} call #t~ret13 := main(); {3814#true} is VALID [2022-04-27 11:13:54,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {3814#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3819#(= main_~y~0 0)} is VALID [2022-04-27 11:13:54,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {3819#(= 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; {3820#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:54,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {3820#(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; {3821#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:54,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {3821#(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; {3822#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:54,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {3822#(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; {3823#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:54,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {3823#(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; {3824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:54,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {3824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:54,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {3824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3825#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:54,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {3825#(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; {3826#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:54,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {3826#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3815#false} is VALID [2022-04-27 11:13:54,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {3815#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3815#false} is VALID [2022-04-27 11:13:54,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {3815#false} assume !(~y~0 % 4294967296 > 0); {3815#false} is VALID [2022-04-27 11:13:54,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {3815#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3815#false} is VALID [2022-04-27 11:13:54,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {3815#false} assume !(~x~0 % 4294967296 > 0); {3815#false} is VALID [2022-04-27 11:13:54,455 INFO L272 TraceCheckUtils]: 19: Hoare triple {3815#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3815#false} is VALID [2022-04-27 11:13:54,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {3815#false} ~cond := #in~cond; {3815#false} is VALID [2022-04-27 11:13:54,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {3815#false} assume 0 == ~cond; {3815#false} is VALID [2022-04-27 11:13:54,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {3815#false} assume !false; {3815#false} is VALID [2022-04-27 11:13:54,455 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:54,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:54,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882173613] [2022-04-27 11:13:54,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882173613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:54,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946086329] [2022-04-27 11:13:54,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:13:54,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:54,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:54,456 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:54,457 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:54,494 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:13:54,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:54,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 11:13:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:54,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:54,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {3814#true} call ULTIMATE.init(); {3814#true} is VALID [2022-04-27 11:13:54,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {3814#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3814#true} is VALID [2022-04-27 11:13:54,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {3814#true} assume true; {3814#true} is VALID [2022-04-27 11:13:54,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3814#true} {3814#true} #72#return; {3814#true} is VALID [2022-04-27 11:13:54,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {3814#true} call #t~ret13 := main(); {3814#true} is VALID [2022-04-27 11:13:54,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {3814#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3819#(= main_~y~0 0)} is VALID [2022-04-27 11:13:54,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {3819#(= 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; {3820#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:54,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {3820#(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; {3821#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:54,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {3821#(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; {3822#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:54,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {3822#(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; {3823#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:54,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {3823#(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; {3824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:54,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {3824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:54,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {3824#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3825#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:54,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {3825#(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; {3870#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:54,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {3870#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {3815#false} is VALID [2022-04-27 11:13:54,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {3815#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3815#false} is VALID [2022-04-27 11:13:54,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {3815#false} assume !(~y~0 % 4294967296 > 0); {3815#false} is VALID [2022-04-27 11:13:54,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {3815#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3815#false} is VALID [2022-04-27 11:13:54,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {3815#false} assume !(~x~0 % 4294967296 > 0); {3815#false} is VALID [2022-04-27 11:13:54,717 INFO L272 TraceCheckUtils]: 19: Hoare triple {3815#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3815#false} is VALID [2022-04-27 11:13:54,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {3815#false} ~cond := #in~cond; {3815#false} is VALID [2022-04-27 11:13:54,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {3815#false} assume 0 == ~cond; {3815#false} is VALID [2022-04-27 11:13:54,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {3815#false} assume !false; {3815#false} is VALID [2022-04-27 11:13:54,717 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:54,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:54,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {3815#false} assume !false; {3815#false} is VALID [2022-04-27 11:13:54,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {3815#false} assume 0 == ~cond; {3815#false} is VALID [2022-04-27 11:13:54,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {3815#false} ~cond := #in~cond; {3815#false} is VALID [2022-04-27 11:13:54,892 INFO L272 TraceCheckUtils]: 19: Hoare triple {3815#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {3815#false} is VALID [2022-04-27 11:13:54,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {3815#false} assume !(~x~0 % 4294967296 > 0); {3815#false} is VALID [2022-04-27 11:13:54,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {3815#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {3815#false} is VALID [2022-04-27 11:13:54,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {3815#false} assume !(~y~0 % 4294967296 > 0); {3815#false} is VALID [2022-04-27 11:13:54,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {3815#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3815#false} is VALID [2022-04-27 11:13:54,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {3922#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3815#false} is VALID [2022-04-27 11:13:54,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {3926#(< 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; {3922#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:54,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {3930#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {3926#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:54,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {3930#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3930#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:54,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {3937#(< 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; {3930#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:54,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {3941#(< 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; {3937#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:54,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {3945#(< 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; {3941#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:54,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {3949#(< 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; {3945#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:13:54,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {3953#(< 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; {3949#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:13:54,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {3814#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3953#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:13:54,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {3814#true} call #t~ret13 := main(); {3814#true} is VALID [2022-04-27 11:13:54,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3814#true} {3814#true} #72#return; {3814#true} is VALID [2022-04-27 11:13:54,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {3814#true} assume true; {3814#true} is VALID [2022-04-27 11:13:54,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {3814#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3814#true} is VALID [2022-04-27 11:13:54,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {3814#true} call ULTIMATE.init(); {3814#true} is VALID [2022-04-27 11:13:54,907 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:54,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946086329] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:54,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:54,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-27 11:13:54,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716904715] [2022-04-27 11:13:54,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:54,908 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:54,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:54,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:54,933 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:54,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 11:13:54,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:54,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 11:13:54,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:13:54,934 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:59,037 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2022-04-27 11:13:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-27 11:13:59,038 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 157 transitions. [2022-04-27 11:13:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 157 transitions. [2022-04-27 11:13:59,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 157 transitions. [2022-04-27 11:13:59,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:59,344 INFO L225 Difference]: With dead ends: 178 [2022-04-27 11:13:59,344 INFO L226 Difference]: Without dead ends: 155 [2022-04-27 11:13:59,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1843 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1367, Invalid=4183, Unknown=0, NotChecked=0, Total=5550 [2022-04-27 11:13:59,346 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 211 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:59,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 64 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 11:13:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-27 11:13:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 95. [2022-04-27 11:13:59,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:59,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 95 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 3 states have call successors, (3), 3 states 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:59,486 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 95 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 3 states have call successors, (3), 3 states 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:59,486 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 95 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 3 states have call successors, (3), 3 states 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:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:59,489 INFO L93 Difference]: Finished difference Result 155 states and 210 transitions. [2022-04-27 11:13:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 210 transitions. [2022-04-27 11:13:59,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:59,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:59,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-27 11:13:59,490 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 155 states. [2022-04-27 11:13:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:59,493 INFO L93 Difference]: Finished difference Result 155 states and 210 transitions. [2022-04-27 11:13:59,493 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 210 transitions. [2022-04-27 11:13:59,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:59,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:59,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:59,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 3 states have call successors, (3), 3 states 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:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2022-04-27 11:13:59,496 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 23 [2022-04-27 11:13:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:59,496 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2022-04-27 11:13:59,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 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:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2022-04-27 11:13:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:13:59,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:59,497 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:59,518 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:59,711 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,SelfDestructingSolverStorable11 [2022-04-27 11:13:59,711 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:59,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1347388208, now seen corresponding path program 3 times [2022-04-27 11:13:59,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:59,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525201605] [2022-04-27 11:13:59,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:59,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {4792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4781#true} is VALID [2022-04-27 11:13:59,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {4781#true} assume true; {4781#true} is VALID [2022-04-27 11:13:59,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4781#true} {4781#true} #72#return; {4781#true} is VALID [2022-04-27 11:13:59,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {4781#true} call ULTIMATE.init(); {4792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:59,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {4792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4781#true} is VALID [2022-04-27 11:13:59,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {4781#true} assume true; {4781#true} is VALID [2022-04-27 11:13:59,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4781#true} {4781#true} #72#return; {4781#true} is VALID [2022-04-27 11:13:59,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {4781#true} call #t~ret13 := main(); {4781#true} is VALID [2022-04-27 11:13:59,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {4781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4781#true} is VALID [2022-04-27 11:13:59,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {4781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4786#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:59,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {4786#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4787#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:13:59,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {4787#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4788#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:13:59,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {4788#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4788#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:13:59,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {4788#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {4788#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:13:59,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {4788#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4789#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:13:59,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {4789#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4790#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:13:59,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {4790#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {4791#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4782#false} is VALID [2022-04-27 11:13:59,831 INFO L272 TraceCheckUtils]: 20: Hoare triple {4782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4782#false} is VALID [2022-04-27 11:13:59,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {4782#false} ~cond := #in~cond; {4782#false} is VALID [2022-04-27 11:13:59,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {4782#false} assume 0 == ~cond; {4782#false} is VALID [2022-04-27 11:13:59,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {4782#false} assume !false; {4782#false} is VALID [2022-04-27 11:13:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:59,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:59,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525201605] [2022-04-27 11:13:59,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525201605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:59,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307396124] [2022-04-27 11:13:59,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:59,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:59,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:59,833 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:59,856 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:59,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:13:59,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:59,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:13:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:59,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:00,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {4781#true} call ULTIMATE.init(); {4781#true} is VALID [2022-04-27 11:14:00,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {4781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4781#true} is VALID [2022-04-27 11:14:00,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {4781#true} assume true; {4781#true} is VALID [2022-04-27 11:14:00,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4781#true} {4781#true} #72#return; {4781#true} is VALID [2022-04-27 11:14:00,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {4781#true} call #t~ret13 := main(); {4781#true} is VALID [2022-04-27 11:14:00,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {4781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4781#true} is VALID [2022-04-27 11:14:00,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {4781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4786#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:00,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {4786#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4817#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:14:00,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {4817#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4817#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:14:00,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {4817#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4786#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:00,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {4786#(<= 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; {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4782#false} is VALID [2022-04-27 11:14:00,165 INFO L272 TraceCheckUtils]: 20: Hoare triple {4782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4782#false} is VALID [2022-04-27 11:14:00,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {4782#false} ~cond := #in~cond; {4782#false} is VALID [2022-04-27 11:14:00,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {4782#false} assume 0 == ~cond; {4782#false} is VALID [2022-04-27 11:14:00,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {4782#false} assume !false; {4782#false} is VALID [2022-04-27 11:14:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:14:00,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:00,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {4782#false} assume !false; {4782#false} is VALID [2022-04-27 11:14:00,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {4782#false} assume 0 == ~cond; {4782#false} is VALID [2022-04-27 11:14:00,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {4782#false} ~cond := #in~cond; {4782#false} is VALID [2022-04-27 11:14:00,395 INFO L272 TraceCheckUtils]: 20: Hoare triple {4782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {4782#false} is VALID [2022-04-27 11:14:00,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4782#false} is VALID [2022-04-27 11:14:00,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {4786#(<= 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; {4837#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {4817#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4786#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:00,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4817#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:14:00,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {4817#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4821#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:00,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {4786#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4817#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:14:00,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {4781#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4786#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:00,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {4781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4781#true} is VALID [2022-04-27 11:14:00,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {4781#true} call #t~ret13 := main(); {4781#true} is VALID [2022-04-27 11:14:00,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4781#true} {4781#true} #72#return; {4781#true} is VALID [2022-04-27 11:14:00,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {4781#true} assume true; {4781#true} is VALID [2022-04-27 11:14:00,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {4781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4781#true} is VALID [2022-04-27 11:14:00,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {4781#true} call ULTIMATE.init(); {4781#true} is VALID [2022-04-27 11:14:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:14:00,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307396124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:00,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:00,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-27 11:14:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498291435] [2022-04-27 11:14:00,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:00,413 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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 24 [2022-04-27 11:14:00,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:00,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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:00,442 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:14:00,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:14:00,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:00,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:14:00,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:14:00,443 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:01,043 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2022-04-27 11:14:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:14:01,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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 24 [2022-04-27 11:14:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-27 11:14:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-27 11:14:01,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-27 11:14:01,113 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:01,115 INFO L225 Difference]: With dead ends: 122 [2022-04-27 11:14:01,115 INFO L226 Difference]: Without dead ends: 117 [2022-04-27 11:14:01,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:14:01,116 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 42 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:01,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 56 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:14:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-27 11:14:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2022-04-27 11:14:01,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:01,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 109 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 3 states have call successors, (3), 3 states 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:01,279 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 109 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 3 states have call successors, (3), 3 states 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:01,287 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 109 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 3 states have call successors, (3), 3 states 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:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:01,289 INFO L93 Difference]: Finished difference Result 117 states and 159 transitions. [2022-04-27 11:14:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 159 transitions. [2022-04-27 11:14:01,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:01,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:01,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-27 11:14:01,290 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-27 11:14:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:01,292 INFO L93 Difference]: Finished difference Result 117 states and 159 transitions. [2022-04-27 11:14:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 159 transitions. [2022-04-27 11:14:01,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:01,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:01,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:01,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 3 states have call successors, (3), 3 states 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:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 148 transitions. [2022-04-27 11:14:01,295 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 148 transitions. Word has length 24 [2022-04-27 11:14:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:01,295 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 148 transitions. [2022-04-27 11:14:01,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 148 transitions. [2022-04-27 11:14:01,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:14:01,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:01,298 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:01,322 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:14:01,511 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,SelfDestructingSolverStorable12 [2022-04-27 11:14:01,512 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:01,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash 467119846, now seen corresponding path program 5 times [2022-04-27 11:14:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:01,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046235888] [2022-04-27 11:14:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:01,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:01,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {5534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5522#true} is VALID [2022-04-27 11:14:01,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {5522#true} assume true; {5522#true} is VALID [2022-04-27 11:14:01,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5522#true} {5522#true} #72#return; {5522#true} is VALID [2022-04-27 11:14:01,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {5522#true} call ULTIMATE.init(); {5534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:01,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {5534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5522#true} is VALID [2022-04-27 11:14:01,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {5522#true} assume true; {5522#true} is VALID [2022-04-27 11:14:01,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5522#true} {5522#true} #72#return; {5522#true} is VALID [2022-04-27 11:14:01,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {5522#true} call #t~ret13 := main(); {5522#true} is VALID [2022-04-27 11:14:01,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {5522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5527#(= main_~y~0 0)} is VALID [2022-04-27 11:14:01,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {5527#(= 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; {5528#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:01,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {5528#(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; {5529#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:01,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {5529#(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; {5530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:01,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {5530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:01,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {5530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5531#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:01,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {5531#(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; {5532#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:01,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {5532#(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; {5533#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:14:01,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {5533#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5523#false} is VALID [2022-04-27 11:14:01,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {5523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5523#false} is VALID [2022-04-27 11:14:01,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {5523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5523#false} is VALID [2022-04-27 11:14:01,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {5523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5523#false} is VALID [2022-04-27 11:14:01,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {5523#false} assume !(~y~0 % 4294967296 > 0); {5523#false} is VALID [2022-04-27 11:14:01,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {5523#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5523#false} is VALID [2022-04-27 11:14:01,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5523#false} is VALID [2022-04-27 11:14:01,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {5523#false} assume !(~x~0 % 4294967296 > 0); {5523#false} is VALID [2022-04-27 11:14:01,656 INFO L272 TraceCheckUtils]: 21: Hoare triple {5523#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5523#false} is VALID [2022-04-27 11:14:01,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {5523#false} ~cond := #in~cond; {5523#false} is VALID [2022-04-27 11:14:01,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {5523#false} assume 0 == ~cond; {5523#false} is VALID [2022-04-27 11:14:01,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {5523#false} assume !false; {5523#false} is VALID [2022-04-27 11:14:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:14:01,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:01,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046235888] [2022-04-27 11:14:01,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046235888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:01,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201901374] [2022-04-27 11:14:01,657 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:14:01,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:01,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:01,660 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:14:01,696 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:14:01,739 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-27 11:14:01,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:01,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:14:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:01,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:01,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {5522#true} call ULTIMATE.init(); {5522#true} is VALID [2022-04-27 11:14:01,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {5522#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5522#true} is VALID [2022-04-27 11:14:01,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {5522#true} assume true; {5522#true} is VALID [2022-04-27 11:14:01,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5522#true} {5522#true} #72#return; {5522#true} is VALID [2022-04-27 11:14:01,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {5522#true} call #t~ret13 := main(); {5522#true} is VALID [2022-04-27 11:14:01,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {5522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5527#(= main_~y~0 0)} is VALID [2022-04-27 11:14:01,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {5527#(= 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; {5528#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:01,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {5528#(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; {5529#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:01,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {5529#(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; {5530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:01,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {5530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:01,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {5530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5568#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:01,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {5568#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5572#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:14:01,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {5572#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5576#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:14:01,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {5576#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !(~z~0 % 4294967296 > 0); {5523#false} is VALID [2022-04-27 11:14:01,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {5523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5523#false} is VALID [2022-04-27 11:14:01,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {5523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5523#false} is VALID [2022-04-27 11:14:01,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {5523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5523#false} is VALID [2022-04-27 11:14:01,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {5523#false} assume !(~y~0 % 4294967296 > 0); {5523#false} is VALID [2022-04-27 11:14:01,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {5523#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5523#false} is VALID [2022-04-27 11:14:01,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5523#false} is VALID [2022-04-27 11:14:01,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {5523#false} assume !(~x~0 % 4294967296 > 0); {5523#false} is VALID [2022-04-27 11:14:01,897 INFO L272 TraceCheckUtils]: 21: Hoare triple {5523#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5523#false} is VALID [2022-04-27 11:14:01,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {5523#false} ~cond := #in~cond; {5523#false} is VALID [2022-04-27 11:14:01,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {5523#false} assume 0 == ~cond; {5523#false} is VALID [2022-04-27 11:14:01,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {5523#false} assume !false; {5523#false} is VALID [2022-04-27 11:14:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:14:01,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:02,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {5523#false} assume !false; {5523#false} is VALID [2022-04-27 11:14:02,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {5523#false} assume 0 == ~cond; {5523#false} is VALID [2022-04-27 11:14:02,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {5523#false} ~cond := #in~cond; {5523#false} is VALID [2022-04-27 11:14:02,068 INFO L272 TraceCheckUtils]: 21: Hoare triple {5523#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {5523#false} is VALID [2022-04-27 11:14:02,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {5523#false} assume !(~x~0 % 4294967296 > 0); {5523#false} is VALID [2022-04-27 11:14:02,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5523#false} is VALID [2022-04-27 11:14:02,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {5523#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {5523#false} is VALID [2022-04-27 11:14:02,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {5523#false} assume !(~y~0 % 4294967296 > 0); {5523#false} is VALID [2022-04-27 11:14:02,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {5637#(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; {5523#false} is VALID [2022-04-27 11:14:02,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {5641#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5637#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:14:02,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {5645#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5641#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:14:02,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {5649#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5645#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:14:02,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {5653#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5649#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:14:02,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {5657#(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; {5653#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:14:02,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {5522#true} ~z~0 := ~y~0; {5657#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:14:02,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {5522#true} assume !(~x~0 % 4294967296 > 0); {5522#true} is VALID [2022-04-27 11:14:02,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {5522#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5522#true} is VALID [2022-04-27 11:14:02,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {5522#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5522#true} is VALID [2022-04-27 11:14:02,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {5522#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5522#true} is VALID [2022-04-27 11:14:02,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {5522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5522#true} is VALID [2022-04-27 11:14:02,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {5522#true} call #t~ret13 := main(); {5522#true} is VALID [2022-04-27 11:14:02,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5522#true} {5522#true} #72#return; {5522#true} is VALID [2022-04-27 11:14:02,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {5522#true} assume true; {5522#true} is VALID [2022-04-27 11:14:02,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {5522#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5522#true} is VALID [2022-04-27 11:14:02,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {5522#true} call ULTIMATE.init(); {5522#true} is VALID [2022-04-27 11:14:02,081 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:14:02,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201901374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:02,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:02,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-27 11:14:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090680548] [2022-04-27 11:14:02,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:02,082 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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 25 [2022-04-27 11:14:02,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:02,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:14:02,117 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:14:02,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:14:02,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:02,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:14:02,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:14:02,118 INFO L87 Difference]: Start difference. First operand 109 states and 148 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:14:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:03,263 INFO L93 Difference]: Finished difference Result 150 states and 201 transitions. [2022-04-27 11:14:03,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 11:14:03,263 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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 25 [2022-04-27 11:14:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:14:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 77 transitions. [2022-04-27 11:14:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:14:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 77 transitions. [2022-04-27 11:14:03,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 77 transitions. [2022-04-27 11:14:03,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:03,342 INFO L225 Difference]: With dead ends: 150 [2022-04-27 11:14:03,342 INFO L226 Difference]: Without dead ends: 133 [2022-04-27 11:14:03,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 11:14:03,344 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:03,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 54 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:14:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-27 11:14:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 106. [2022-04-27 11:14:03,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:03,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 106 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 3 states have call successors, (3), 3 states 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:03,539 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 106 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 3 states have call successors, (3), 3 states 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:03,539 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 106 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 3 states have call successors, (3), 3 states 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:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:03,541 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2022-04-27 11:14:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 176 transitions. [2022-04-27 11:14:03,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:03,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:03,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 133 states. [2022-04-27 11:14:03,542 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 133 states. [2022-04-27 11:14:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:03,545 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2022-04-27 11:14:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 176 transitions. [2022-04-27 11:14:03,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:03,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:03,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:03,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 101 states have internal predecessors, (138), 3 states have call successors, (3), 3 states 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:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 142 transitions. [2022-04-27 11:14:03,547 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 142 transitions. Word has length 25 [2022-04-27 11:14:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:03,547 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 142 transitions. [2022-04-27 11:14:03,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 18 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:14:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 142 transitions. [2022-04-27 11:14:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:14:03,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:03,548 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:03,566 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:14:03,755 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,SelfDestructingSolverStorable13 [2022-04-27 11:14:03,756 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 415342529, now seen corresponding path program 3 times [2022-04-27 11:14:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:03,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503763842] [2022-04-27 11:14:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:03,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {6392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6374#true} is VALID [2022-04-27 11:14:03,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {6374#true} assume true; {6374#true} is VALID [2022-04-27 11:14:03,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6374#true} {6374#true} #72#return; {6374#true} is VALID [2022-04-27 11:14:03,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {6374#true} call ULTIMATE.init(); {6392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:03,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {6392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6374#true} is VALID [2022-04-27 11:14:03,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {6374#true} assume true; {6374#true} is VALID [2022-04-27 11:14:03,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6374#true} {6374#true} #72#return; {6374#true} is VALID [2022-04-27 11:14:03,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {6374#true} call #t~ret13 := main(); {6374#true} is VALID [2022-04-27 11:14:03,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {6374#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6379#(= main_~y~0 0)} is VALID [2022-04-27 11:14:03,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {6379#(= 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; {6380#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:03,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {6380#(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; {6381#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:03,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {6381#(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; {6382#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:03,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {6382#(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; {6383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:03,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {6383#(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; {6384#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:03,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {6384#(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; {6385#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:14:03,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {6385#(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; {6386#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:03,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {6386#(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; {6387#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:03,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {6387#(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; {6388#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:14:03,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {6388#(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; {6389#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:14:03,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {6389#(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; {6390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:14:04,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {6390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:14:04,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {6390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {6391#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-27 11:14:04,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {6391#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6375#false} is VALID [2022-04-27 11:14:04,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {6375#false} assume !(~y~0 % 4294967296 > 0); {6375#false} is VALID [2022-04-27 11:14:04,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {6375#false} assume !(~x~0 % 4294967296 > 0); {6375#false} is VALID [2022-04-27 11:14:04,001 INFO L272 TraceCheckUtils]: 22: Hoare triple {6375#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6375#false} is VALID [2022-04-27 11:14:04,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {6375#false} ~cond := #in~cond; {6375#false} is VALID [2022-04-27 11:14:04,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {6375#false} assume 0 == ~cond; {6375#false} is VALID [2022-04-27 11:14:04,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {6375#false} assume !false; {6375#false} is VALID [2022-04-27 11:14:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:14:04,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:04,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503763842] [2022-04-27 11:14:04,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503763842] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:04,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436861768] [2022-04-27 11:14:04,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:14:04,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:04,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:04,003 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:14:04,003 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:14:04,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-27 11:14:04,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:04,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 11:14:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:04,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:04,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {6374#true} call ULTIMATE.init(); {6374#true} is VALID [2022-04-27 11:14:04,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {6374#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6374#true} is VALID [2022-04-27 11:14:04,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {6374#true} assume true; {6374#true} is VALID [2022-04-27 11:14:04,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6374#true} {6374#true} #72#return; {6374#true} is VALID [2022-04-27 11:14:04,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {6374#true} call #t~ret13 := main(); {6374#true} is VALID [2022-04-27 11:14:04,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {6374#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6379#(= main_~y~0 0)} is VALID [2022-04-27 11:14:04,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {6379#(= 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; {6380#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:04,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {6380#(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; {6381#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:04,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {6381#(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; {6382#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:04,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {6382#(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; {6383#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:04,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {6383#(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; {6384#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:04,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {6384#(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; {6385#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:14:04,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {6385#(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; {6386#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:04,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {6386#(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; {6387#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:04,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {6387#(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; {6388#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:14:04,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {6388#(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; {6389#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:14:04,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {6389#(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; {6390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:14:04,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {6390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:14:04,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {6390#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {6450#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:14:04,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {6450#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6375#false} is VALID [2022-04-27 11:14:04,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {6375#false} assume !(~y~0 % 4294967296 > 0); {6375#false} is VALID [2022-04-27 11:14:04,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {6375#false} assume !(~x~0 % 4294967296 > 0); {6375#false} is VALID [2022-04-27 11:14:04,426 INFO L272 TraceCheckUtils]: 22: Hoare triple {6375#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6375#false} is VALID [2022-04-27 11:14:04,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {6375#false} ~cond := #in~cond; {6375#false} is VALID [2022-04-27 11:14:04,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {6375#false} assume 0 == ~cond; {6375#false} is VALID [2022-04-27 11:14:04,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {6375#false} assume !false; {6375#false} is VALID [2022-04-27 11:14:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:14:04,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:04,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {6375#false} assume !false; {6375#false} is VALID [2022-04-27 11:14:04,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {6375#false} assume 0 == ~cond; {6375#false} is VALID [2022-04-27 11:14:04,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {6375#false} ~cond := #in~cond; {6375#false} is VALID [2022-04-27 11:14:04,840 INFO L272 TraceCheckUtils]: 22: Hoare triple {6375#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {6375#false} is VALID [2022-04-27 11:14:04,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {6375#false} assume !(~x~0 % 4294967296 > 0); {6375#false} is VALID [2022-04-27 11:14:04,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {6375#false} assume !(~y~0 % 4294967296 > 0); {6375#false} is VALID [2022-04-27 11:14:04,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {6490#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6375#false} is VALID [2022-04-27 11:14:04,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {6494#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {6490#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:14:04,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {6494#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6494#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:14:04,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {6501#(< 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; {6494#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:14:04,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {6505#(< 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; {6501#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:14:04,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {6509#(< 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; {6505#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:14:04,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {6513#(< 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; {6509#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:14:04,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {6517#(< 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; {6513#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:14:04,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {6521#(< 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; {6517#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:14:04,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {6525#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6521#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:14:04,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {6529#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6525#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:14:04,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {6533#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6529#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:14:04,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {6537#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6533#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:14:04,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {6541#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6537#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:14:04,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {6374#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6541#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:14:04,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {6374#true} call #t~ret13 := main(); {6374#true} is VALID [2022-04-27 11:14:04,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6374#true} {6374#true} #72#return; {6374#true} is VALID [2022-04-27 11:14:04,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {6374#true} assume true; {6374#true} is VALID [2022-04-27 11:14:04,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {6374#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6374#true} is VALID [2022-04-27 11:14:04,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {6374#true} call ULTIMATE.init(); {6374#true} is VALID [2022-04-27 11:14:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:14:04,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436861768] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:04,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:04,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-27 11:14:04,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961507276] [2022-04-27 11:14:04,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:04,853 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 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:14:04,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:04,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 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,893 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,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 11:14:04,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:04,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 11:14:04,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-27 11:14:04,895 INFO L87 Difference]: Start difference. First operand 106 states and 142 transitions. Second operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 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:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:32,548 INFO L93 Difference]: Finished difference Result 398 states and 600 transitions. [2022-04-27 11:14:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-27 11:14:32,549 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 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:14:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 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:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2022-04-27 11:14:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 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:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2022-04-27 11:14:32,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 247 transitions. [2022-04-27 11:14:34,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:34,342 INFO L225 Difference]: With dead ends: 398 [2022-04-27 11:14:34,342 INFO L226 Difference]: Without dead ends: 365 [2022-04-27 11:14:34,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=1980, Invalid=5676, Unknown=0, NotChecked=0, Total=7656 [2022-04-27 11:14:34,345 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 740 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:34,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 99 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 11:14:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-04-27 11:14:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 155. [2022-04-27 11:14:34,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:34,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 155 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 150 states have internal predecessors, (205), 3 states have call successors, (3), 3 states 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:34,754 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 155 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 150 states have internal predecessors, (205), 3 states have call successors, (3), 3 states 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:34,754 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 155 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 150 states have internal predecessors, (205), 3 states have call successors, (3), 3 states 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:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:34,762 INFO L93 Difference]: Finished difference Result 365 states and 497 transitions. [2022-04-27 11:14:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 497 transitions. [2022-04-27 11:14:34,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:34,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:34,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 150 states have internal predecessors, (205), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-27 11:14:34,764 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 150 states have internal predecessors, (205), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-27 11:14:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:34,772 INFO L93 Difference]: Finished difference Result 365 states and 497 transitions. [2022-04-27 11:14:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 497 transitions. [2022-04-27 11:14:34,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:34,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:34,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:34,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 150 states have internal predecessors, (205), 3 states have call successors, (3), 3 states 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:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 209 transitions. [2022-04-27 11:14:34,776 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 209 transitions. Word has length 26 [2022-04-27 11:14:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:34,777 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 209 transitions. [2022-04-27 11:14:34,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 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:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2022-04-27 11:14:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:14:34,777 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:34,777 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:34,788 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:14:34,982 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,SelfDestructingSolverStorable14 [2022-04-27 11:14:34,982 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:34,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash 523877976, now seen corresponding path program 6 times [2022-04-27 11:14:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:34,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608790753] [2022-04-27 11:14:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:34,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:35,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:35,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {8209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8201#true} is VALID [2022-04-27 11:14:35,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {8201#true} assume true; {8201#true} is VALID [2022-04-27 11:14:35,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8201#true} {8201#true} #72#return; {8201#true} is VALID [2022-04-27 11:14:35,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {8201#true} call ULTIMATE.init(); {8209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:35,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {8209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8201#true} is VALID [2022-04-27 11:14:35,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {8201#true} assume true; {8201#true} is VALID [2022-04-27 11:14:35,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8201#true} {8201#true} #72#return; {8201#true} is VALID [2022-04-27 11:14:35,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {8201#true} call #t~ret13 := main(); {8201#true} is VALID [2022-04-27 11:14:35,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {8201#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8201#true} is VALID [2022-04-27 11:14:35,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {8201#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8201#true} is VALID [2022-04-27 11:14:35,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {8201#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8201#true} is VALID [2022-04-27 11:14:35,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {8201#true} assume !(~x~0 % 4294967296 > 0); {8206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:35,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {8206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:35,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {8206#(<= 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; {8207#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:14:35,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {8207#(<= 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; {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:35,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:35,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {8208#(<= 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; {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:35,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {8208#(<= 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; {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:35,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:35,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {8208#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8207#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:14:35,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {8207#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:35,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {8206#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8202#false} is VALID [2022-04-27 11:14:35,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {8202#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8202#false} is VALID [2022-04-27 11:14:35,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {8202#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8202#false} is VALID [2022-04-27 11:14:35,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {8202#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8202#false} is VALID [2022-04-27 11:14:35,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {8202#false} assume !(~x~0 % 4294967296 > 0); {8202#false} is VALID [2022-04-27 11:14:35,074 INFO L272 TraceCheckUtils]: 23: Hoare triple {8202#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {8202#false} is VALID [2022-04-27 11:14:35,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {8202#false} ~cond := #in~cond; {8202#false} is VALID [2022-04-27 11:14:35,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {8202#false} assume 0 == ~cond; {8202#false} is VALID [2022-04-27 11:14:35,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {8202#false} assume !false; {8202#false} is VALID [2022-04-27 11:14:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:14:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:35,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608790753] [2022-04-27 11:14:35,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608790753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:35,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284432537] [2022-04-27 11:14:35,075 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:14:35,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:35,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:35,080 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:14:35,084 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:14:35,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-27 11:14:35,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:35,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:14:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:35,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:35,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {8201#true} call ULTIMATE.init(); {8201#true} is VALID [2022-04-27 11:14:35,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {8201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8201#true} is VALID [2022-04-27 11:14:35,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {8201#true} assume true; {8201#true} is VALID [2022-04-27 11:14:35,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8201#true} {8201#true} #72#return; {8201#true} is VALID [2022-04-27 11:14:35,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {8201#true} call #t~ret13 := main(); {8201#true} is VALID [2022-04-27 11:14:35,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {8201#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8201#true} is VALID [2022-04-27 11:14:35,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {8201#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8201#true} is VALID [2022-04-27 11:14:35,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {8201#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8201#true} is VALID [2022-04-27 11:14:35,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {8201#true} assume !(~x~0 % 4294967296 > 0); {8206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:35,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {8206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:35,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {8206#(<= 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; {8207#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:14:35,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {8207#(<= 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; {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:35,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:35,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {8208#(<= 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; {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:35,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {8208#(<= 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; {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:35,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8208#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:35,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {8208#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8207#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:14:35,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {8207#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8206#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:35,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {8206#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8267#(<= (+ main_~x~0 1) (* (div (+ main_~x~0 1) 4294967296) 4294967296))} is VALID [2022-04-27 11:14:35,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {8267#(<= (+ main_~x~0 1) (* (div (+ main_~x~0 1) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8271#(<= (+ main_~x~0 2) (* (div (+ main_~x~0 2) 4294967296) 4294967296))} is VALID [2022-04-27 11:14:35,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {8271#(<= (+ main_~x~0 2) (* (div (+ main_~x~0 2) 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8275#(<= (+ main_~x~0 3) (* 4294967296 (div (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 11:14:35,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {8275#(<= (+ main_~x~0 3) (* 4294967296 (div (+ main_~x~0 3) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8279#(<= (+ main_~x~0 4) (* (div (+ main_~x~0 4) 4294967296) 4294967296))} is VALID [2022-04-27 11:14:35,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {8279#(<= (+ main_~x~0 4) (* (div (+ main_~x~0 4) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8202#false} is VALID [2022-04-27 11:14:35,420 INFO L272 TraceCheckUtils]: 23: Hoare triple {8202#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {8202#false} is VALID [2022-04-27 11:14:35,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {8202#false} ~cond := #in~cond; {8202#false} is VALID [2022-04-27 11:14:35,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {8202#false} assume 0 == ~cond; {8202#false} is VALID [2022-04-27 11:14:35,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {8202#false} assume !false; {8202#false} is VALID [2022-04-27 11:14:35,420 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:14:35,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:35,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {8202#false} assume !false; {8202#false} is VALID [2022-04-27 11:14:35,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {8202#false} assume 0 == ~cond; {8202#false} is VALID [2022-04-27 11:14:35,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {8202#false} ~cond := #in~cond; {8202#false} is VALID [2022-04-27 11:14:35,735 INFO L272 TraceCheckUtils]: 23: Hoare triple {8202#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {8202#false} is VALID [2022-04-27 11:14:35,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {8307#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8202#false} is VALID [2022-04-27 11:14:35,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {8311#(< 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8307#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:35,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {8315#(< 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8311#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:35,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {8319#(< 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8315#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:35,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {8323#(< 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8319#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:35,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {8327#(< 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8323#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:35,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {8331#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {8327#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:35,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {8331#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !(~y~0 % 4294967296 > 0); {8331#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:35,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {8331#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8331#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:35,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {8331#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8331#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:35,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {8331#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {8331#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:35,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {8327#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8331#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:35,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {8323#(< 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; {8327#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:35,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {8323#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} ~z~0 := ~y~0; {8323#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:35,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {8201#true} assume !(~x~0 % 4294967296 > 0); {8323#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:35,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {8201#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8201#true} is VALID [2022-04-27 11:14:35,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {8201#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8201#true} is VALID [2022-04-27 11:14:35,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {8201#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8201#true} is VALID [2022-04-27 11:14:35,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {8201#true} call #t~ret13 := main(); {8201#true} is VALID [2022-04-27 11:14:35,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8201#true} {8201#true} #72#return; {8201#true} is VALID [2022-04-27 11:14:35,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {8201#true} assume true; {8201#true} is VALID [2022-04-27 11:14:35,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {8201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8201#true} is VALID [2022-04-27 11:14:35,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {8201#true} call ULTIMATE.init(); {8201#true} is VALID [2022-04-27 11:14:35,745 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:14:35,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284432537] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:35,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:35,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 17 [2022-04-27 11:14:35,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926467592] [2022-04-27 11:14:35,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:35,745 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:14:35,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:35,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:35,780 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:35,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 11:14:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:35,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 11:14:35,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:14:35,780 INFO L87 Difference]: Start difference. First operand 155 states and 209 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:39,265 INFO L93 Difference]: Finished difference Result 342 states and 494 transitions. [2022-04-27 11:14:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-27 11:14:39,265 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:14:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 126 transitions. [2022-04-27 11:14:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 126 transitions. [2022-04-27 11:14:39,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 126 transitions. [2022-04-27 11:14:39,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:39,584 INFO L225 Difference]: With dead ends: 342 [2022-04-27 11:14:39,585 INFO L226 Difference]: Without dead ends: 323 [2022-04-27 11:14:39,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=464, Invalid=1986, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 11:14:39,586 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 136 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:39,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 73 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:14:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-27 11:14:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2022-04-27 11:14:40,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:40,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 320 states, 315 states have (on average 1.4444444444444444) internal successors, (455), 315 states have internal predecessors, (455), 3 states have call successors, (3), 3 states 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:40,422 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 320 states, 315 states have (on average 1.4444444444444444) internal successors, (455), 315 states have internal predecessors, (455), 3 states have call successors, (3), 3 states 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:40,423 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 320 states, 315 states have (on average 1.4444444444444444) internal successors, (455), 315 states have internal predecessors, (455), 3 states have call successors, (3), 3 states 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:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:40,429 INFO L93 Difference]: Finished difference Result 323 states and 462 transitions. [2022-04-27 11:14:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 462 transitions. [2022-04-27 11:14:40,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:40,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:40,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 320 states, 315 states have (on average 1.4444444444444444) internal successors, (455), 315 states have internal predecessors, (455), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 323 states. [2022-04-27 11:14:40,430 INFO L87 Difference]: Start difference. First operand has 320 states, 315 states have (on average 1.4444444444444444) internal successors, (455), 315 states have internal predecessors, (455), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 323 states. [2022-04-27 11:14:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:40,437 INFO L93 Difference]: Finished difference Result 323 states and 462 transitions. [2022-04-27 11:14:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 462 transitions. [2022-04-27 11:14:40,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:40,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:40,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:40,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.4444444444444444) internal successors, (455), 315 states have internal predecessors, (455), 3 states have call successors, (3), 3 states 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:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 459 transitions. [2022-04-27 11:14:40,447 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 459 transitions. Word has length 27 [2022-04-27 11:14:40,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:40,447 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 459 transitions. [2022-04-27 11:14:40,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:40,447 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 459 transitions. [2022-04-27 11:14:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:14:40,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:40,448 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:40,459 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:14:40,655 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,SelfDestructingSolverStorable15 [2022-04-27 11:14:40,655 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:40,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash -828351928, now seen corresponding path program 7 times [2022-04-27 11:14:40,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:40,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073254342] [2022-04-27 11:14:40,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:40,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:41,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:41,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {10085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10065#true} is VALID [2022-04-27 11:14:41,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {10065#true} assume true; {10065#true} is VALID [2022-04-27 11:14:41,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10065#true} {10065#true} #72#return; {10065#true} is VALID [2022-04-27 11:14:41,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {10065#true} call ULTIMATE.init(); {10085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:41,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {10085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10065#true} is VALID [2022-04-27 11:14:41,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {10065#true} assume true; {10065#true} is VALID [2022-04-27 11:14:41,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10065#true} {10065#true} #72#return; {10065#true} is VALID [2022-04-27 11:14:41,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {10065#true} call #t~ret13 := main(); {10065#true} is VALID [2022-04-27 11:14:41,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {10065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:14:41,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {10070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10071#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 11:14:41,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {10071#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~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; {10072#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 2)))} is VALID [2022-04-27 11:14:41,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {10072#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) 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; {10073#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} is VALID [2022-04-27 11:14:41,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {10073#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} assume !(~x~0 % 4294967296 > 0); {10074#(and (<= (* main_~n~0 2) (+ main_~y~0 3 (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 3 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} is VALID [2022-04-27 11:14:41,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {10074#(and (<= (* main_~n~0 2) (+ main_~y~0 3 (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 3 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} ~z~0 := ~y~0; {10075#(and (<= (+ main_~z~0 3 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~z~0 3 (* 8589934592 (div main_~x~0 4294967296)))))} is VALID [2022-04-27 11:14:41,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {10075#(and (<= (+ main_~z~0 3 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~z~0 3 (* 8589934592 (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; {10076#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-27 11:14:41,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {10076#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) 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; {10077#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-27 11:14:41,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {10077#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) 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; {10078#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:41,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {10078#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10078#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:41,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {10078#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10077#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-27 11:14:41,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {10077#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10076#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-27 11:14:41,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {10076#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) 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; {10079#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:41,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {10079#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10079#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:41,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {10079#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10080#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} is VALID [2022-04-27 11:14:41,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {10080#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10081#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-27 11:14:41,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {10081#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10082#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:41,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {10082#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {10082#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:41,058 INFO L272 TraceCheckUtils]: 23: Hoare triple {10082#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {10083#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:14:41,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {10083#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10084#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:14:41,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {10084#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10066#false} is VALID [2022-04-27 11:14:41,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {10066#false} assume !false; {10066#false} is VALID [2022-04-27 11:14:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:14:41,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:41,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073254342] [2022-04-27 11:14:41,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073254342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:41,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390015299] [2022-04-27 11:14:41,059 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:14:41,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:41,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:41,064 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:14:41,088 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:14:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:41,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-27 11:14:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:41,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:42,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {10065#true} call ULTIMATE.init(); {10065#true} is VALID [2022-04-27 11:14:42,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {10065#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10065#true} is VALID [2022-04-27 11:14:42,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {10065#true} assume true; {10065#true} is VALID [2022-04-27 11:14:42,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10065#true} {10065#true} #72#return; {10065#true} is VALID [2022-04-27 11:14:42,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {10065#true} call #t~ret13 := main(); {10065#true} is VALID [2022-04-27 11:14:42,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {10065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:14:42,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {10070#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10107#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 11:14:42,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {10107#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10111#(and (= (+ (- 2) main_~y~0) 0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:42,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {10111#(and (= (+ (- 2) main_~y~0) 0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10115#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:14:42,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {10115#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10115#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:14:42,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {10115#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)))} ~z~0 := ~y~0; {10122#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 3))} is VALID [2022-04-27 11:14:42,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {10122#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10126#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ main_~z~0 1)) (= (+ (- 2) main_~n~0) main_~x~0) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:14:42,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {10126#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ main_~z~0 1)) (= (+ (- 2) main_~n~0) main_~x~0) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10130#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 3 (+ main_~z~0 2)))} is VALID [2022-04-27 11:14:42,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {10130#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 3 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10134#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= (+ main_~z~0 1) 1))} is VALID [2022-04-27 11:14:42,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {10134#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {10134#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= (+ main_~z~0 1) 1))} is VALID [2022-04-27 11:14:42,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {10134#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= (+ main_~z~0 1) 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; {10141#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 1) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:14:42,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {10141#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 1) (< 0 (mod (+ main_~n~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; {10145#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 2))} is VALID [2022-04-27 11:14:42,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {10145#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 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; {10149#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 3))} is VALID [2022-04-27 11:14:42,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {10149#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 3))} assume !(~y~0 % 4294967296 > 0); {10149#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 3))} is VALID [2022-04-27 11:14:42,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {10149#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10156#(and (= (+ main_~x~0 1) main_~n~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 3 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:14:42,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {10156#(and (= (+ main_~x~0 1) main_~n~0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 3 (+ (- 1) main_~z~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10160#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~n~0 (+ main_~x~0 2)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 5 main_~z~0))} is VALID [2022-04-27 11:14:42,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {10160#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~n~0 (+ main_~x~0 2)) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= 5 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10164#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 3) main_~n~0) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 6))} is VALID [2022-04-27 11:14:42,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {10164#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 3) main_~n~0) (< 0 (mod (+ main_~n~0 4294967294) 4294967296)) (= main_~z~0 6))} assume !(~x~0 % 4294967296 > 0); {10168#(and (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= main_~z~0 6))} is VALID [2022-04-27 11:14:42,262 INFO L272 TraceCheckUtils]: 23: Hoare triple {10168#(and (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {10172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:14:42,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {10172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:14:42,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {10176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10066#false} is VALID [2022-04-27 11:14:42,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {10066#false} assume !false; {10066#false} is VALID [2022-04-27 11:14:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:14:42,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:43,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {10066#false} assume !false; {10066#false} is VALID [2022-04-27 11:14:43,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {10176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10066#false} is VALID [2022-04-27 11:14:43,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {10172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:14:43,837 INFO L272 TraceCheckUtils]: 23: Hoare triple {10082#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {10172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:14:43,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {10195#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {10082#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:43,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {10199#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10195#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:14:43,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {10203#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10199#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-27 11:14:43,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {10207#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {10203#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:14:43,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {10207#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !(~y~0 % 4294967296 > 0); {10207#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-27 11:14:43,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {10214#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 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; {10207#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-27 11:14:43,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {10218#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~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; {10214#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} is VALID [2022-04-27 11:14:43,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {10222#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~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; {10218#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:14:43,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {10222#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !(~z~0 % 4294967296 > 0); {10222#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:14:43,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {10229#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~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; {10222#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:14:43,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {10233#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 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; {10229#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:14:43,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {10237#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 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; {10233#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))))} is VALID [2022-04-27 11:14:43,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {10241#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {10237#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:43,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {10241#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10241#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:43,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {10248#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ 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; {10241#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 3) (+ (* main_~n~0 2) (* (div (+ main_~y~0 3) 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:43,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {10252#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10248#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-27 11:14:43,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {10256#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10252#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:14:43,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {10065#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10256#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:14:43,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {10065#true} call #t~ret13 := main(); {10065#true} is VALID [2022-04-27 11:14:43,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10065#true} {10065#true} #72#return; {10065#true} is VALID [2022-04-27 11:14:43,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {10065#true} assume true; {10065#true} is VALID [2022-04-27 11:14:43,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {10065#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10065#true} is VALID [2022-04-27 11:14:43,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {10065#true} call ULTIMATE.init(); {10065#true} is VALID [2022-04-27 11:14:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:14:43,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390015299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:43,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:43,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 48 [2022-04-27 11:14:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90862858] [2022-04-27 11:14:43,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:43,857 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 45 states have internal predecessors, (61), 3 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 27 [2022-04-27 11:14:43,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:43,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 45 states have internal predecessors, (61), 3 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:14:43,941 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:14:43,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-27 11:14:43,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:43,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-27 11:14:43,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2079, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 11:14:43,943 INFO L87 Difference]: Start difference. First operand 320 states and 459 transitions. Second operand has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 45 states have internal predecessors, (61), 3 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:14:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:53,664 INFO L93 Difference]: Finished difference Result 382 states and 538 transitions. [2022-04-27 11:14:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-27 11:14:53,664 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 45 states have internal predecessors, (61), 3 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 27 [2022-04-27 11:14:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 45 states have internal predecessors, (61), 3 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:14:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 75 transitions. [2022-04-27 11:14:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 45 states have internal predecessors, (61), 3 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:14:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 75 transitions. [2022-04-27 11:14:53,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 75 transitions. [2022-04-27 11:14:53,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:53,824 INFO L225 Difference]: With dead ends: 382 [2022-04-27 11:14:53,824 INFO L226 Difference]: Without dead ends: 328 [2022-04-27 11:14:53,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=634, Invalid=5218, Unknown=0, NotChecked=0, Total=5852 [2022-04-27 11:14:53,829 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 114 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:53,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 158 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 11:14:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-04-27 11:14:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2022-04-27 11:14:54,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:54,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 322 states, 317 states have (on average 1.4227129337539433) internal successors, (451), 317 states have internal predecessors, (451), 3 states have call successors, (3), 3 states 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:54,580 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 322 states, 317 states have (on average 1.4227129337539433) internal successors, (451), 317 states have internal predecessors, (451), 3 states have call successors, (3), 3 states 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:54,580 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 322 states, 317 states have (on average 1.4227129337539433) internal successors, (451), 317 states have internal predecessors, (451), 3 states have call successors, (3), 3 states 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:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:54,587 INFO L93 Difference]: Finished difference Result 328 states and 461 transitions. [2022-04-27 11:14:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 461 transitions. [2022-04-27 11:14:54,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:54,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:54,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 322 states, 317 states have (on average 1.4227129337539433) internal successors, (451), 317 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 328 states. [2022-04-27 11:14:54,589 INFO L87 Difference]: Start difference. First operand has 322 states, 317 states have (on average 1.4227129337539433) internal successors, (451), 317 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 328 states. [2022-04-27 11:14:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:54,597 INFO L93 Difference]: Finished difference Result 328 states and 461 transitions. [2022-04-27 11:14:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 461 transitions. [2022-04-27 11:14:54,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:54,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:54,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:54,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 317 states have (on average 1.4227129337539433) internal successors, (451), 317 states have internal predecessors, (451), 3 states have call successors, (3), 3 states 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:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 455 transitions. [2022-04-27 11:14:54,606 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 455 transitions. Word has length 27 [2022-04-27 11:14:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:54,606 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 455 transitions. [2022-04-27 11:14:54,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 45 states have internal predecessors, (61), 3 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:14:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 455 transitions. [2022-04-27 11:14:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:14:54,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:54,607 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:54,615 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:14:54,816 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,SelfDestructingSolverStorable16 [2022-04-27 11:14:54,816 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash -734568360, now seen corresponding path program 4 times [2022-04-27 11:14:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:54,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560260646] [2022-04-27 11:14:54,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:54,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:54,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:54,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {12009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11996#true} is VALID [2022-04-27 11:14:54,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {11996#true} assume true; {11996#true} is VALID [2022-04-27 11:14:54,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11996#true} {11996#true} #72#return; {11996#true} is VALID [2022-04-27 11:14:54,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {11996#true} call ULTIMATE.init(); {12009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:54,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {12009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11996#true} is VALID [2022-04-27 11:14:54,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {11996#true} assume true; {11996#true} is VALID [2022-04-27 11:14:54,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11996#true} {11996#true} #72#return; {11996#true} is VALID [2022-04-27 11:14:54,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {11996#true} call #t~ret13 := main(); {11996#true} is VALID [2022-04-27 11:14:54,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {11996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11996#true} is VALID [2022-04-27 11:14:54,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {11996#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12001#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:54,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {12001#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12002#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:14:54,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {12002#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12003#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:54,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {12003#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12004#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:14:54,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {12004#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {12004#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:14:54,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {12004#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {12004#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:14:54,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {12004#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12005#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:14:54,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {12005#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12006#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:14:54,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {12006#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12007#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:14:54,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {12007#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:14:54,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:14:54,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:14:54,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:14:54,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:14:54,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:14:54,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:14:54,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {12008#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {11997#false} is VALID [2022-04-27 11:14:54,989 INFO L272 TraceCheckUtils]: 23: Hoare triple {11997#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {11997#false} is VALID [2022-04-27 11:14:54,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {11997#false} ~cond := #in~cond; {11997#false} is VALID [2022-04-27 11:14:54,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {11997#false} assume 0 == ~cond; {11997#false} is VALID [2022-04-27 11:14:54,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {11997#false} assume !false; {11997#false} is VALID [2022-04-27 11:14:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:14:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:54,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560260646] [2022-04-27 11:14:54,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560260646] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:54,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071268133] [2022-04-27 11:14:54,990 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:14:54,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:54,992 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:14:55,018 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:14:55,043 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:14:55,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:55,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:14:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:55,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:55,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {11996#true} call ULTIMATE.init(); {11996#true} is VALID [2022-04-27 11:14:55,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {11996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11996#true} is VALID [2022-04-27 11:14:55,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {11996#true} assume true; {11996#true} is VALID [2022-04-27 11:14:55,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11996#true} {11996#true} #72#return; {11996#true} is VALID [2022-04-27 11:14:55,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {11996#true} call #t~ret13 := main(); {11996#true} is VALID [2022-04-27 11:14:55,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {11996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11996#true} is VALID [2022-04-27 11:14:55,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {11996#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12001#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:55,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {12001#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12034#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:14:55,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {12034#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12038#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {12038#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:14:55,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:14:55,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:14:55,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12038#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {12038#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12034#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:14:55,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {12034#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12001#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:55,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {12001#(<= 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; {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11997#false} is VALID [2022-04-27 11:14:55,390 INFO L272 TraceCheckUtils]: 23: Hoare triple {11997#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {11997#false} is VALID [2022-04-27 11:14:55,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {11997#false} ~cond := #in~cond; {11997#false} is VALID [2022-04-27 11:14:55,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {11997#false} assume 0 == ~cond; {11997#false} is VALID [2022-04-27 11:14:55,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {11997#false} assume !false; {11997#false} is VALID [2022-04-27 11:14:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:14:55,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:55,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {11997#false} assume !false; {11997#false} is VALID [2022-04-27 11:14:55,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {11997#false} assume 0 == ~cond; {11997#false} is VALID [2022-04-27 11:14:55,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {11997#false} ~cond := #in~cond; {11997#false} is VALID [2022-04-27 11:14:55,653 INFO L272 TraceCheckUtils]: 23: Hoare triple {11997#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {11997#false} is VALID [2022-04-27 11:14:55,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11997#false} is VALID [2022-04-27 11:14:55,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {12001#(<= 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; {12061#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {12034#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12001#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:55,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {12038#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12034#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:14:55,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12038#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:14:55,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:14:55,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {12038#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12042#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:14:55,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {12034#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12038#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:55,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {12001#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12034#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:14:55,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {11996#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12001#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:55,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {11996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11996#true} is VALID [2022-04-27 11:14:55,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {11996#true} call #t~ret13 := main(); {11996#true} is VALID [2022-04-27 11:14:55,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11996#true} {11996#true} #72#return; {11996#true} is VALID [2022-04-27 11:14:55,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {11996#true} assume true; {11996#true} is VALID [2022-04-27 11:14:55,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {11996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11996#true} is VALID [2022-04-27 11:14:55,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {11996#true} call ULTIMATE.init(); {11996#true} is VALID [2022-04-27 11:14:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:14:55,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071268133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:55,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:55,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-27 11:14:55,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375038302] [2022-04-27 11:14:55,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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:14:55,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:55,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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:55,695 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:14:55,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:14:55,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:55,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:14:55,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:14:55,696 INFO L87 Difference]: Start difference. First operand 322 states and 455 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:57,073 INFO L93 Difference]: Finished difference Result 336 states and 476 transitions. [2022-04-27 11:14:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:14:57,073 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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:14:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-04-27 11:14:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-04-27 11:14:57,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2022-04-27 11:14:57,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:57,155 INFO L225 Difference]: With dead ends: 336 [2022-04-27 11:14:57,156 INFO L226 Difference]: Without dead ends: 331 [2022-04-27 11:14:57,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:14:57,156 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 55 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:57,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 65 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:14:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-27 11:14:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 322. [2022-04-27 11:14:57,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:57,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 322 states, 317 states have (on average 1.4195583596214512) internal successors, (450), 317 states have internal predecessors, (450), 3 states have call successors, (3), 3 states 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:57,982 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 322 states, 317 states have (on average 1.4195583596214512) internal successors, (450), 317 states have internal predecessors, (450), 3 states have call successors, (3), 3 states 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:57,982 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 322 states, 317 states have (on average 1.4195583596214512) internal successors, (450), 317 states have internal predecessors, (450), 3 states have call successors, (3), 3 states 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:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:57,989 INFO L93 Difference]: Finished difference Result 331 states and 471 transitions. [2022-04-27 11:14:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 471 transitions. [2022-04-27 11:14:57,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:57,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:57,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 322 states, 317 states have (on average 1.4195583596214512) internal successors, (450), 317 states have internal predecessors, (450), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-27 11:14:57,991 INFO L87 Difference]: Start difference. First operand has 322 states, 317 states have (on average 1.4195583596214512) internal successors, (450), 317 states have internal predecessors, (450), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 331 states. [2022-04-27 11:14:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:57,999 INFO L93 Difference]: Finished difference Result 331 states and 471 transitions. [2022-04-27 11:14:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 471 transitions. [2022-04-27 11:14:57,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:57,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:57,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:57,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 317 states have (on average 1.4195583596214512) internal successors, (450), 317 states have internal predecessors, (450), 3 states have call successors, (3), 3 states 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:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 454 transitions. [2022-04-27 11:14:58,009 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 454 transitions. Word has length 27 [2022-04-27 11:14:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:58,009 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 454 transitions. [2022-04-27 11:14:58,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 454 transitions. [2022-04-27 11:14:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:14:58,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:58,010 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:58,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-27 11:14:58,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:58,224 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:58,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2010729856, now seen corresponding path program 5 times [2022-04-27 11:14:58,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:58,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571795046] [2022-04-27 11:14:58,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:58,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:58,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {13818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13803#true} is VALID [2022-04-27 11:14:58,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {13803#true} assume true; {13803#true} is VALID [2022-04-27 11:14:58,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13803#true} {13803#true} #72#return; {13803#true} is VALID [2022-04-27 11:14:58,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {13803#true} call ULTIMATE.init(); {13818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:58,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {13818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13803#true} is VALID [2022-04-27 11:14:58,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {13803#true} assume true; {13803#true} is VALID [2022-04-27 11:14:58,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13803#true} {13803#true} #72#return; {13803#true} is VALID [2022-04-27 11:14:58,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {13803#true} call #t~ret13 := main(); {13803#true} is VALID [2022-04-27 11:14:58,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {13803#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13808#(= main_~y~0 0)} is VALID [2022-04-27 11:14:58,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {13808#(= 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; {13809#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:58,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {13809#(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; {13810#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:58,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {13810#(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; {13811#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:58,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {13811#(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; {13812#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:58,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {13812#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13812#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:58,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {13812#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {13813#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:14:58,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {13813#(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; {13814#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:58,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {13814#(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; {13815#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:58,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {13815#(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; {13816#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:14:58,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {13816#(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; {13817#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:14:58,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {13817#(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; {13804#false} is VALID [2022-04-27 11:14:58,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {13804#false} assume !(~z~0 % 4294967296 > 0); {13804#false} is VALID [2022-04-27 11:14:58,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {13804#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13804#false} is VALID [2022-04-27 11:14:58,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {13804#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13804#false} is VALID [2022-04-27 11:14:58,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {13804#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13804#false} is VALID [2022-04-27 11:14:58,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {13804#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13804#false} is VALID [2022-04-27 11:14:58,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {13804#false} assume !(~y~0 % 4294967296 > 0); {13804#false} is VALID [2022-04-27 11:14:58,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {13804#false} assume !(~x~0 % 4294967296 > 0); {13804#false} is VALID [2022-04-27 11:14:58,423 INFO L272 TraceCheckUtils]: 24: Hoare triple {13804#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {13804#false} is VALID [2022-04-27 11:14:58,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {13804#false} ~cond := #in~cond; {13804#false} is VALID [2022-04-27 11:14:58,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {13804#false} assume 0 == ~cond; {13804#false} is VALID [2022-04-27 11:14:58,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {13804#false} assume !false; {13804#false} is VALID [2022-04-27 11:14:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:14:58,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:58,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571795046] [2022-04-27 11:14:58,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571795046] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:58,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38213774] [2022-04-27 11:14:58,424 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:14:58,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:58,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:58,425 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:14:58,448 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:14:58,525 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:14:58,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:58,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 11:14:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:58,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:58,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {13803#true} call ULTIMATE.init(); {13803#true} is VALID [2022-04-27 11:14:58,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {13803#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13803#true} is VALID [2022-04-27 11:14:58,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {13803#true} assume true; {13803#true} is VALID [2022-04-27 11:14:58,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13803#true} {13803#true} #72#return; {13803#true} is VALID [2022-04-27 11:14:58,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {13803#true} call #t~ret13 := main(); {13803#true} is VALID [2022-04-27 11:14:58,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {13803#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13808#(= main_~y~0 0)} is VALID [2022-04-27 11:14:58,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {13808#(= 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; {13809#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:58,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {13809#(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; {13810#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:58,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {13810#(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; {13811#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:58,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {13811#(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; {13812#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:58,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {13812#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13812#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:58,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {13812#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {13855#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:58,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {13855#(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; {13859#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:14:58,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {13859#(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; {13863#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:58,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {13863#(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; {13867#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:58,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {13867#(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; {13871#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {13871#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {13804#false} assume !(~z~0 % 4294967296 > 0); {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {13804#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {13804#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {13804#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {13804#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {13804#false} assume !(~y~0 % 4294967296 > 0); {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {13804#false} assume !(~x~0 % 4294967296 > 0); {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L272 TraceCheckUtils]: 24: Hoare triple {13804#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {13804#false} ~cond := #in~cond; {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {13804#false} assume 0 == ~cond; {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {13804#false} assume !false; {13804#false} is VALID [2022-04-27 11:14:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:14:58,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:59,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {13804#false} assume !false; {13804#false} is VALID [2022-04-27 11:14:59,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {13804#false} assume 0 == ~cond; {13804#false} is VALID [2022-04-27 11:14:59,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {13804#false} ~cond := #in~cond; {13804#false} is VALID [2022-04-27 11:14:59,057 INFO L272 TraceCheckUtils]: 24: Hoare triple {13804#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {13804#false} is VALID [2022-04-27 11:14:59,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {13804#false} assume !(~x~0 % 4294967296 > 0); {13804#false} is VALID [2022-04-27 11:14:59,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {13923#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {13804#false} is VALID [2022-04-27 11:14:59,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {13927#(< 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; {13923#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:14:59,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {13931#(< 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; {13927#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:59,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {13935#(< 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; {13931#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:14:59,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {13939#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13935#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:14:59,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {13939#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {13939#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:14:59,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {13946#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13939#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:14:59,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {13950#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13946#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:14:59,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {13954#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13950#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:14:59,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {13958#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13954#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:14:59,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {13962#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13958#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:14:59,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {13803#true} ~z~0 := ~y~0; {13962#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:14:59,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {13803#true} assume !(~x~0 % 4294967296 > 0); {13803#true} is VALID [2022-04-27 11:14:59,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {13803#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13803#true} is VALID [2022-04-27 11:14:59,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {13803#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13803#true} is VALID [2022-04-27 11:14:59,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {13803#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13803#true} is VALID [2022-04-27 11:14:59,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {13803#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13803#true} is VALID [2022-04-27 11:14:59,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {13803#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13803#true} is VALID [2022-04-27 11:14:59,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {13803#true} call #t~ret13 := main(); {13803#true} is VALID [2022-04-27 11:14:59,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13803#true} {13803#true} #72#return; {13803#true} is VALID [2022-04-27 11:14:59,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {13803#true} assume true; {13803#true} is VALID [2022-04-27 11:14:59,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {13803#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13803#true} is VALID [2022-04-27 11:14:59,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {13803#true} call ULTIMATE.init(); {13803#true} is VALID [2022-04-27 11:14:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:14:59,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38213774] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:59,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:59,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-04-27 11:14:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502845961] [2022-04-27 11:14:59,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:59,066 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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 28 [2022-04-27 11:14:59,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:59,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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:59,103 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:14:59,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 11:14:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:59,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 11:14:59,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:14:59,104 INFO L87 Difference]: Start difference. First operand 322 states and 454 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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:15:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:02,564 INFO L93 Difference]: Finished difference Result 677 states and 869 transitions. [2022-04-27 11:15:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 11:15:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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 28 [2022-04-27 11:15:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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:15:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 118 transitions. [2022-04-27 11:15:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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:15:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 118 transitions. [2022-04-27 11:15:02,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 118 transitions. [2022-04-27 11:15:02,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:02,776 INFO L225 Difference]: With dead ends: 677 [2022-04-27 11:15:02,776 INFO L226 Difference]: Without dead ends: 603 [2022-04-27 11:15:02,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=852, Invalid=3704, Unknown=0, NotChecked=0, Total=4556 [2022-04-27 11:15:02,778 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 172 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:02,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 90 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 11:15:02,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-27 11:15:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 356. [2022-04-27 11:15:03,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:03,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 356 states, 351 states have (on average 1.4472934472934473) internal successors, (508), 351 states have internal predecessors, (508), 3 states have call successors, (3), 3 states 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:15:03,619 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 356 states, 351 states have (on average 1.4472934472934473) internal successors, (508), 351 states have internal predecessors, (508), 3 states have call successors, (3), 3 states 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:15:03,619 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 356 states, 351 states have (on average 1.4472934472934473) internal successors, (508), 351 states have internal predecessors, (508), 3 states have call successors, (3), 3 states 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:15:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:03,642 INFO L93 Difference]: Finished difference Result 603 states and 762 transitions. [2022-04-27 11:15:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 762 transitions. [2022-04-27 11:15:03,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:03,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:03,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 356 states, 351 states have (on average 1.4472934472934473) internal successors, (508), 351 states have internal predecessors, (508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-27 11:15:03,644 INFO L87 Difference]: Start difference. First operand has 356 states, 351 states have (on average 1.4472934472934473) internal successors, (508), 351 states have internal predecessors, (508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-27 11:15:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:03,660 INFO L93 Difference]: Finished difference Result 603 states and 762 transitions. [2022-04-27 11:15:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 762 transitions. [2022-04-27 11:15:03,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:03,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:03,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:03,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 351 states have (on average 1.4472934472934473) internal successors, (508), 351 states have internal predecessors, (508), 3 states have call successors, (3), 3 states 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:15:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 512 transitions. [2022-04-27 11:15:03,670 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 512 transitions. Word has length 28 [2022-04-27 11:15:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:03,670 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 512 transitions. [2022-04-27 11:15:03,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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:15:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 512 transitions. [2022-04-27 11:15:03,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 11:15:03,671 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:03,671 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:03,682 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:15:03,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:03,876 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:03,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:03,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1541621168, now seen corresponding path program 6 times [2022-04-27 11:15:03,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:03,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397514474] [2022-04-27 11:15:03,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:03,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:04,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {16628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16613#true} is VALID [2022-04-27 11:15:04,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {16613#true} assume true; {16613#true} is VALID [2022-04-27 11:15:04,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16613#true} {16613#true} #72#return; {16613#true} is VALID [2022-04-27 11:15:04,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {16613#true} call ULTIMATE.init(); {16628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:04,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {16628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16613#true} is VALID [2022-04-27 11:15:04,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {16613#true} assume true; {16613#true} is VALID [2022-04-27 11:15:04,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16613#true} {16613#true} #72#return; {16613#true} is VALID [2022-04-27 11:15:04,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {16613#true} call #t~ret13 := main(); {16613#true} is VALID [2022-04-27 11:15:04,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {16613#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16613#true} is VALID [2022-04-27 11:15:04,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {16613#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16618#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:04,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {16618#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16619#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:15:04,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {16619#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16620#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:04,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {16620#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16621#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:04,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {16621#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16622#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:04,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {16622#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {16622#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:04,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {16622#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {16622#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:15:04,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {16622#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16623#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:15:04,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {16623#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16624#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-27 11:15:04,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {16624#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16625#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:15:04,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {16625#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16626#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:15:04,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {16626#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:04,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:04,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:04,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:04,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:04,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:04,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:04,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:15:04,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {16627#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {16614#false} is VALID [2022-04-27 11:15:04,088 INFO L272 TraceCheckUtils]: 26: Hoare triple {16614#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {16614#false} is VALID [2022-04-27 11:15:04,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {16614#false} ~cond := #in~cond; {16614#false} is VALID [2022-04-27 11:15:04,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {16614#false} assume 0 == ~cond; {16614#false} is VALID [2022-04-27 11:15:04,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {16614#false} assume !false; {16614#false} is VALID [2022-04-27 11:15:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:15:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:04,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397514474] [2022-04-27 11:15:04,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397514474] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:04,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719183333] [2022-04-27 11:15:04,089 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:15:04,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:04,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:04,090 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:15:04,115 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:15:04,168 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-27 11:15:04,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:04,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 11:15:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:04,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:04,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {16613#true} call ULTIMATE.init(); {16613#true} is VALID [2022-04-27 11:15:04,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {16613#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16613#true} is VALID [2022-04-27 11:15:04,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {16613#true} assume true; {16613#true} is VALID [2022-04-27 11:15:04,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16613#true} {16613#true} #72#return; {16613#true} is VALID [2022-04-27 11:15:04,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {16613#true} call #t~ret13 := main(); {16613#true} is VALID [2022-04-27 11:15:04,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {16613#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16613#true} is VALID [2022-04-27 11:15:04,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {16613#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16618#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:04,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {16618#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16653#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:04,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {16653#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16657#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {16657#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16661#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:15:04,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {16661#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16661#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:15:04,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {16661#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16657#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {16657#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16653#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:04,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {16653#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16618#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:04,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {16618#(<= 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; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16614#false} is VALID [2022-04-27 11:15:04,549 INFO L272 TraceCheckUtils]: 26: Hoare triple {16614#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {16614#false} is VALID [2022-04-27 11:15:04,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {16614#false} ~cond := #in~cond; {16614#false} is VALID [2022-04-27 11:15:04,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {16614#false} assume 0 == ~cond; {16614#false} is VALID [2022-04-27 11:15:04,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {16614#false} assume !false; {16614#false} is VALID [2022-04-27 11:15:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:15:04,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:04,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {16614#false} assume !false; {16614#false} is VALID [2022-04-27 11:15:04,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {16614#false} assume 0 == ~cond; {16614#false} is VALID [2022-04-27 11:15:04,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {16614#false} ~cond := #in~cond; {16614#false} is VALID [2022-04-27 11:15:04,677 INFO L272 TraceCheckUtils]: 26: Hoare triple {16614#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {16614#false} is VALID [2022-04-27 11:15:04,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16614#false} is VALID [2022-04-27 11:15:04,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {16618#(<= 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; {16687#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {16653#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16618#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:04,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {16657#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16653#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:04,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {16661#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16657#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16661#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:15:04,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {16661#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16665#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {16657#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16661#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:15:04,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {16653#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16657#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:15:04,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {16618#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16653#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:15:04,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {16613#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16618#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:15:04,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {16613#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16613#true} is VALID [2022-04-27 11:15:04,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {16613#true} call #t~ret13 := main(); {16613#true} is VALID [2022-04-27 11:15:04,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16613#true} {16613#true} #72#return; {16613#true} is VALID [2022-04-27 11:15:04,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {16613#true} assume true; {16613#true} is VALID [2022-04-27 11:15:04,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {16613#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16613#true} is VALID [2022-04-27 11:15:04,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {16613#true} call ULTIMATE.init(); {16613#true} is VALID [2022-04-27 11:15:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:15:04,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719183333] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:04,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:04,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-27 11:15:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100576718] [2022-04-27 11:15:04,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:04,689 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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 30 [2022-04-27 11:15:04,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:04,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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:15:04,728 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:15:04,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:15:04,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:04,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:15:04,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:15:04,729 INFO L87 Difference]: Start difference. First operand 356 states and 512 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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:15:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:06,547 INFO L93 Difference]: Finished difference Result 374 states and 539 transitions. [2022-04-27 11:15:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:15:06,547 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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 30 [2022-04-27 11:15:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:15:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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:15:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2022-04-27 11:15:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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:15:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 71 transitions. [2022-04-27 11:15:06,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 71 transitions. [2022-04-27 11:15:06,626 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:15:06,631 INFO L225 Difference]: With dead ends: 374 [2022-04-27 11:15:06,632 INFO L226 Difference]: Without dead ends: 369 [2022-04-27 11:15:06,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:15:06,633 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:15:06,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 92 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:15:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-27 11:15:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 356. [2022-04-27 11:15:07,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:07,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 356 states, 351 states have (on average 1.4415954415954415) internal successors, (506), 351 states have internal predecessors, (506), 3 states have call successors, (3), 3 states 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:15:07,490 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 356 states, 351 states have (on average 1.4415954415954415) internal successors, (506), 351 states have internal predecessors, (506), 3 states have call successors, (3), 3 states 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:15:07,490 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 356 states, 351 states have (on average 1.4415954415954415) internal successors, (506), 351 states have internal predecessors, (506), 3 states have call successors, (3), 3 states 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:15:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,497 INFO L93 Difference]: Finished difference Result 369 states and 533 transitions. [2022-04-27 11:15:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 533 transitions. [2022-04-27 11:15:07,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:07,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:07,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 356 states, 351 states have (on average 1.4415954415954415) internal successors, (506), 351 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-27 11:15:07,498 INFO L87 Difference]: Start difference. First operand has 356 states, 351 states have (on average 1.4415954415954415) internal successors, (506), 351 states have internal predecessors, (506), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-27 11:15:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:07,505 INFO L93 Difference]: Finished difference Result 369 states and 533 transitions. [2022-04-27 11:15:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 533 transitions. [2022-04-27 11:15:07,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:07,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:07,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:07,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 351 states have (on average 1.4415954415954415) internal successors, (506), 351 states have internal predecessors, (506), 3 states have call successors, (3), 3 states 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:15:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 510 transitions. [2022-04-27 11:15:07,515 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 510 transitions. Word has length 30 [2022-04-27 11:15:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:07,515 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 510 transitions. [2022-04-27 11:15:07,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 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:15:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 510 transitions. [2022-04-27 11:15:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 11:15:07,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:07,516 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:07,543 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:15:07,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:07,740 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:07,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash -759780175, now seen corresponding path program 8 times [2022-04-27 11:15:07,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:07,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991448158] [2022-04-27 11:15:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {18601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18581#true} is VALID [2022-04-27 11:15:08,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 11:15:08,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18581#true} {18581#true} #72#return; {18581#true} is VALID [2022-04-27 11:15:08,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:08,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {18601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18581#true} is VALID [2022-04-27 11:15:08,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 11:15:08,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18581#true} {18581#true} #72#return; {18581#true} is VALID [2022-04-27 11:15:08,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {18581#true} call #t~ret13 := main(); {18581#true} is VALID [2022-04-27 11:15:08,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {18581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18586#(= main_~y~0 0)} is VALID [2022-04-27 11:15:08,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {18586#(= 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; {18587#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:08,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {18587#(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; {18588#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:08,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {18588#(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; {18589#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:08,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {18589#(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; {18590#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:08,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {18590#(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; {18591#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:08,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {18591#(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; {18592#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:08,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {18592#(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; {18593#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:15:08,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {18593#(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; {18594#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:15:08,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {18594#(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; {18595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:15:08,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {18595#(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; {18596#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:15:08,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {18596#(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; {18597#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:15:08,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {18597#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:15:08,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {18598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {18598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:15:08,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {18598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {18599#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:15:08,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {18599#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18600#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-27 11:15:08,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {18600#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18582#false} is VALID [2022-04-27 11:15:08,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {18582#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18582#false} is VALID [2022-04-27 11:15:08,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {18582#false} assume !(~y~0 % 4294967296 > 0); {18582#false} is VALID [2022-04-27 11:15:08,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {18582#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18582#false} is VALID [2022-04-27 11:15:08,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {18582#false} assume !(~x~0 % 4294967296 > 0); {18582#false} is VALID [2022-04-27 11:15:08,031 INFO L272 TraceCheckUtils]: 26: Hoare triple {18582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {18582#false} is VALID [2022-04-27 11:15:08,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-27 11:15:08,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-27 11:15:08,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-27 11:15:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:08,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:08,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991448158] [2022-04-27 11:15:08,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991448158] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:08,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901500515] [2022-04-27 11:15:08,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:15:08,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:08,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:08,036 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:15:08,061 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:15:08,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:15:08,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:08,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 11:15:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:08,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:08,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18581#true} is VALID [2022-04-27 11:15:08,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {18581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18581#true} is VALID [2022-04-27 11:15:08,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 11:15:08,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18581#true} {18581#true} #72#return; {18581#true} is VALID [2022-04-27 11:15:08,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {18581#true} call #t~ret13 := main(); {18581#true} is VALID [2022-04-27 11:15:08,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {18581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18586#(= main_~y~0 0)} is VALID [2022-04-27 11:15:08,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {18586#(= 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; {18587#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:08,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {18587#(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; {18588#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:08,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {18588#(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; {18589#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:08,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {18589#(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; {18590#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:08,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {18590#(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; {18591#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:08,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {18591#(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; {18592#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:08,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {18592#(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; {18593#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:15:08,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {18593#(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; {18594#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:15:08,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {18594#(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; {18595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:15:08,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {18595#(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; {18596#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:15:08,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {18596#(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; {18597#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:15:08,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {18597#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:15:08,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {18598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {18598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:15:08,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {18598#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {18599#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:15:08,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {18599#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18665#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:15:08,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {18665#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18582#false} is VALID [2022-04-27 11:15:08,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {18582#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18582#false} is VALID [2022-04-27 11:15:08,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {18582#false} assume !(~y~0 % 4294967296 > 0); {18582#false} is VALID [2022-04-27 11:15:08,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {18582#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18582#false} is VALID [2022-04-27 11:15:08,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {18582#false} assume !(~x~0 % 4294967296 > 0); {18582#false} is VALID [2022-04-27 11:15:08,407 INFO L272 TraceCheckUtils]: 26: Hoare triple {18582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {18582#false} is VALID [2022-04-27 11:15:08,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-27 11:15:08,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-27 11:15:08,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-27 11:15:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:08,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:08,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-27 11:15:08,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-27 11:15:08,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-27 11:15:08,829 INFO L272 TraceCheckUtils]: 26: Hoare triple {18582#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {18582#false} is VALID [2022-04-27 11:15:08,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {18582#false} assume !(~x~0 % 4294967296 > 0); {18582#false} is VALID [2022-04-27 11:15:08,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {18582#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {18582#false} is VALID [2022-04-27 11:15:08,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {18582#false} assume !(~y~0 % 4294967296 > 0); {18582#false} is VALID [2022-04-27 11:15:08,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {18582#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18582#false} is VALID [2022-04-27 11:15:08,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {18717#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18582#false} is VALID [2022-04-27 11:15:08,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {18721#(< 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; {18717#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:15:08,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {18725#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {18721#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:08,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {18725#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18725#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:08,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {18732#(< 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; {18725#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:08,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {18736#(< 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; {18732#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:15:08,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {18740#(< 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; {18736#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:15:08,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {18744#(< 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; {18740#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:15:08,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {18748#(< 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; {18744#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:15:08,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {18752#(< 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; {18748#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:15:08,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {18756#(< 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; {18752#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:15:08,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {18760#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18756#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:15:08,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {18764#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18760#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:15:08,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {18768#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18764#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:15:08,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {18772#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18768#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:15:08,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {18776#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18772#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:15:08,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {18581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18776#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:15:08,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {18581#true} call #t~ret13 := main(); {18581#true} is VALID [2022-04-27 11:15:08,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18581#true} {18581#true} #72#return; {18581#true} is VALID [2022-04-27 11:15:08,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 11:15:08,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {18581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18581#true} is VALID [2022-04-27 11:15:08,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18581#true} is VALID [2022-04-27 11:15:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:08,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901500515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:08,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:08,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-27 11:15:08,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826424195] [2022-04-27 11:15:08,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:08,840 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:15:08,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:08,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:15:08,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:15:08,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 11:15:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:08,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 11:15:08,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 11:15:08,876 INFO L87 Difference]: Start difference. First operand 356 states and 510 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:06,239 INFO L93 Difference]: Finished difference Result 1204 states and 1906 transitions. [2022-04-27 11:17:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-04-27 11:17:06,239 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:17:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 311 transitions. [2022-04-27 11:17:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 311 transitions. [2022-04-27 11:17:06,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 311 transitions. [2022-04-27 11:17:08,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:08,691 INFO L225 Difference]: With dead ends: 1204 [2022-04-27 11:17:08,691 INFO L226 Difference]: Without dead ends: 1141 [2022-04-27 11:17:08,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9274 ImplicationChecksByTransitivity, 102.0s TimeCoverageRelationStatistics Valid=5877, Invalid=18302, Unknown=1, NotChecked=0, Total=24180 [2022-04-27 11:17:08,696 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 874 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 1017 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1017 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:08,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 121 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1017 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-27 11:17:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-04-27 11:17:09,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 407. [2022-04-27 11:17:09,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:09,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1141 states. Second operand has 407 states, 402 states have (on average 1.4527363184079602) internal successors, (584), 402 states have internal predecessors, (584), 3 states have call successors, (3), 3 states 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:09,772 INFO L74 IsIncluded]: Start isIncluded. First operand 1141 states. Second operand has 407 states, 402 states have (on average 1.4527363184079602) internal successors, (584), 402 states have internal predecessors, (584), 3 states have call successors, (3), 3 states 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:09,773 INFO L87 Difference]: Start difference. First operand 1141 states. Second operand has 407 states, 402 states have (on average 1.4527363184079602) internal successors, (584), 402 states have internal predecessors, (584), 3 states have call successors, (3), 3 states 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:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:09,805 INFO L93 Difference]: Finished difference Result 1141 states and 1620 transitions. [2022-04-27 11:17:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1620 transitions. [2022-04-27 11:17:09,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:09,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:09,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 407 states, 402 states have (on average 1.4527363184079602) internal successors, (584), 402 states have internal predecessors, (584), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1141 states. [2022-04-27 11:17:09,808 INFO L87 Difference]: Start difference. First operand has 407 states, 402 states have (on average 1.4527363184079602) internal successors, (584), 402 states have internal predecessors, (584), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1141 states. [2022-04-27 11:17:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:09,860 INFO L93 Difference]: Finished difference Result 1141 states and 1620 transitions. [2022-04-27 11:17:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1620 transitions. [2022-04-27 11:17:09,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:09,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:09,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:09,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 402 states have (on average 1.4527363184079602) internal successors, (584), 402 states have internal predecessors, (584), 3 states have call successors, (3), 3 states 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:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 588 transitions. [2022-04-27 11:17:09,873 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 588 transitions. Word has length 30 [2022-04-27 11:17:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:09,873 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 588 transitions. [2022-04-27 11:17:09,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 588 transitions. [2022-04-27 11:17:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:17:09,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:09,874 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:09,897 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:17:10,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:10,087 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:10,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1818120792, now seen corresponding path program 9 times [2022-04-27 11:17:10,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:10,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108820125] [2022-04-27 11:17:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:10,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:10,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:10,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {23408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23385#true} is VALID [2022-04-27 11:17:10,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {23385#true} assume true; {23385#true} is VALID [2022-04-27 11:17:10,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23385#true} {23385#true} #72#return; {23385#true} is VALID [2022-04-27 11:17:10,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {23385#true} call ULTIMATE.init(); {23408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:10,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {23408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23385#true} is VALID [2022-04-27 11:17:10,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {23385#true} assume true; {23385#true} is VALID [2022-04-27 11:17:10,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23385#true} {23385#true} #72#return; {23385#true} is VALID [2022-04-27 11:17:10,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {23385#true} call #t~ret13 := main(); {23385#true} is VALID [2022-04-27 11:17:10,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {23385#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23390#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:17:10,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {23390#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23391#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 11:17:10,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {23391#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~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; {23392#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 2)))} is VALID [2022-04-27 11:17:10,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {23392#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) 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; {23393#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} is VALID [2022-04-27 11:17:10,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {23393#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23394#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~0 2)))} is VALID [2022-04-27 11:17:10,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {23394#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~0 2)))} assume !(~x~0 % 4294967296 > 0); {23395#(and (<= (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 4) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 4)))} is VALID [2022-04-27 11:17:10,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {23395#(and (<= (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 4) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~y~0 (* 8589934592 (div main_~x~0 4294967296)) 4)))} ~z~0 := ~y~0; {23396#(and (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 4) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 4)))} is VALID [2022-04-27 11:17:10,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {23396#(and (<= (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 4) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ main_~z~0 (* 8589934592 (div main_~x~0 4294967296)) 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; {23397#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-27 11:17:10,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {23397#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) 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; {23398#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:10,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {23398#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23399#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:10,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {23399#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23400#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-27 11:17:10,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {23400#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !(~z~0 % 4294967296 > 0); {23400#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-27 11:17:10,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {23400#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23399#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:10,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {23399#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23398#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:10,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {23398#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23397#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-27 11:17:10,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {23397#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23401#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-27 11:17:10,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {23401#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {23401#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-27 11:17:10,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {23401#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23402#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:10,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {23402#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23403#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} is VALID [2022-04-27 11:17:10,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {23403#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23404#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-27 11:17:10,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {23404#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23405#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:10,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {23405#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {23405#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:10,590 INFO L272 TraceCheckUtils]: 27: Hoare triple {23405#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {23406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:17:10,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {23406#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23407#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:17:10,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {23407#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23386#false} is VALID [2022-04-27 11:17:10,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {23386#false} assume !false; {23386#false} is VALID [2022-04-27 11:17:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:17:10,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:10,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108820125] [2022-04-27 11:17:10,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108820125] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:10,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672255993] [2022-04-27 11:17:10,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:17:10,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:10,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:10,596 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:17:10,600 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:17:10,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:17:10,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:10,773 WARN L261 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 70 conjunts are in the unsatisfiable core [2022-04-27 11:17:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:10,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:11,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {23385#true} call ULTIMATE.init(); {23385#true} is VALID [2022-04-27 11:17:11,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {23385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23385#true} is VALID [2022-04-27 11:17:11,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {23385#true} assume true; {23385#true} is VALID [2022-04-27 11:17:11,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23385#true} {23385#true} #72#return; {23385#true} is VALID [2022-04-27 11:17:11,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {23385#true} call #t~ret13 := main(); {23385#true} is VALID [2022-04-27 11:17:11,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {23385#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23390#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:17:11,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {23390#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23430#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1) (< 0 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:17:11,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {23430#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1) (< 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; {23434#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 1) main_~y~0) 1) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-27 11:17:11,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {23434#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ (- 1) main_~y~0) 1) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (< 0 (mod main_~n~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; {23438#(and (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-27 11:17:11,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {23438#(and (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3) (< 0 (mod main_~n~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; {23442#(and (= (+ main_~x~0 3) (+ (- 1) main_~n~0)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 4) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-27 11:17:11,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {23442#(and (= (+ main_~x~0 3) (+ (- 1) main_~n~0)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 4) (< 0 (mod main_~n~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {23446#(and (= main_~y~0 4) (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:17:11,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {23446#(and (= main_~y~0 4) (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {23450#(and (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~0) (= main_~z~0 4))} is VALID [2022-04-27 11:17:11,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {23450#(and (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~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; {23454#(and (= (+ main_~z~0 1) 4) (= (+ main_~x~0 3) main_~n~0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:17:11,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {23454#(and (= (+ main_~z~0 1) 4) (= (+ main_~x~0 3) main_~n~0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23458#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~z~0 2) 4) (= (+ (- 2) main_~n~0) main_~x~0))} is VALID [2022-04-27 11:17:11,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {23458#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~z~0 2) 4) (= (+ (- 2) main_~n~0) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23462#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~z~0 3) 4) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)))} is VALID [2022-04-27 11:17:11,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {23462#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~z~0 3) 4) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23466#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= (+ main_~z~0 1) 1))} is VALID [2022-04-27 11:17:11,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {23466#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {23466#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= (+ main_~z~0 1) 1))} is VALID [2022-04-27 11:17:12,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {23466#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= (+ main_~z~0 1) 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; {23473#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 1))} is VALID [2022-04-27 11:17:12,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {23473#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~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; {23477#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 2))} is VALID [2022-04-27 11:17:12,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {23477#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~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; {23481#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 2 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:17:12,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {23481#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 2 (+ (- 1) main_~z~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23485#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 4))} is VALID [2022-04-27 11:17:12,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {23485#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {23485#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 4))} is VALID [2022-04-27 11:17:12,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {23485#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23492#(and (= (+ main_~x~0 1) main_~n~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 1) main_~z~0) 4))} is VALID [2022-04-27 11:17:12,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {23492#(and (= (+ main_~x~0 1) main_~n~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 1) main_~z~0) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23496#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~z~0) 4) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:12,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {23496#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~z~0) 4) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23500#(and (= 7 main_~z~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ main_~x~0 1)))} is VALID [2022-04-27 11:17:12,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {23500#(and (= 7 main_~z~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23504#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (= 7 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:17:12,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {23504#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (= 7 (+ (- 1) main_~z~0)))} assume !(~x~0 % 4294967296 > 0); {23508#(and (= main_~z~0 8) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0))} is VALID [2022-04-27 11:17:12,006 INFO L272 TraceCheckUtils]: 27: Hoare triple {23508#(and (= main_~z~0 8) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {23512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:17:12,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {23512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:17:12,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {23516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23386#false} is VALID [2022-04-27 11:17:12,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {23386#false} assume !false; {23386#false} is VALID [2022-04-27 11:17:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:17:12,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:13,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {23386#false} assume !false; {23386#false} is VALID [2022-04-27 11:17:13,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {23516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23386#false} is VALID [2022-04-27 11:17:13,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {23512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:17:13,986 INFO L272 TraceCheckUtils]: 27: Hoare triple {23405#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {23512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:17:13,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {23535#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {23405#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:13,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {23539#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23535#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:17:13,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {23543#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23539#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1) (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2))))} is VALID [2022-04-27 11:17:13,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {23547#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23543#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 2) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:17:13,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {23551#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {23547#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 3) (+ (* main_~n~0 2) (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-27 11:17:13,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {23551#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {23551#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:17:13,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {23558#(or (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 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; {23551#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:17:14,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {23562#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 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; {23558#(or (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:17:14,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {23566#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 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; {23562#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:17:14,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {23570#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 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; {23566#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:17:14,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {23570#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23570#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:17:14,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {23577#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 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; {23570#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8) (+ (* main_~n~0 2) (* (div (+ main_~z~0 8) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:17:14,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {23581#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 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; {23577#(or (and (< (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0) (+ (* main_~n~0 2) (* (div (+ 7 main_~z~0) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:17:14,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {23585#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~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; {23581#(or (and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~z~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:17:14,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {23589#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 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; {23585#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 6)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0) (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) (* main_~n~0 2)))))} is VALID [2022-04-27 11:17:14,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {23593#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} ~z~0 := ~y~0; {23589#(or (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~z~0))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:14,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {23593#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} assume !(~x~0 % 4294967296 > 0); {23593#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-27 11:17:14,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {23600#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23593#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 4) (+ (* main_~n~0 2) (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-27 11:17:14,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {23604#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23600#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 5 main_~y~0) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2))) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6))))} is VALID [2022-04-27 11:17:14,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {23608#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23604#(or (and (< (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 6) (+ (* main_~n~0 2) (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:17:14,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {23612#(or (and (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23608#(or (and (< (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) 7 main_~y~0) (+ (* main_~n~0 2) (* 4294967296 (div (+ 7 main_~y~0) 4294967296))))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:17:14,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {23385#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23612#(or (and (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 9)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~y~0 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) (* main_~n~0 2)))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:17:14,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {23385#true} call #t~ret13 := main(); {23385#true} is VALID [2022-04-27 11:17:14,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23385#true} {23385#true} #72#return; {23385#true} is VALID [2022-04-27 11:17:14,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {23385#true} assume true; {23385#true} is VALID [2022-04-27 11:17:14,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {23385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23385#true} is VALID [2022-04-27 11:17:14,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {23385#true} call ULTIMATE.init(); {23385#true} is VALID [2022-04-27 11:17:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:17:14,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672255993] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:14,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:14,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 23] total 60 [2022-04-27 11:17:14,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066668837] [2022-04-27 11:17:14,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:14,028 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 57 states have internal predecessors, (73), 3 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 31 [2022-04-27 11:17:14,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:14,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 57 states have internal predecessors, (73), 3 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:17:14,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:14,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-27 11:17:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:14,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-27 11:17:14,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=3161, Unknown=0, NotChecked=0, Total=3540 [2022-04-27 11:17:14,144 INFO L87 Difference]: Start difference. First operand 407 states and 588 transitions. Second operand has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 57 states have internal predecessors, (73), 3 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:17:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:23,705 INFO L93 Difference]: Finished difference Result 433 states and 616 transitions. [2022-04-27 11:17:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-27 11:17:23,705 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 57 states have internal predecessors, (73), 3 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 31 [2022-04-27 11:17:23,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 57 states have internal predecessors, (73), 3 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:17:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 83 transitions. [2022-04-27 11:17:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 57 states have internal predecessors, (73), 3 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:17:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 83 transitions. [2022-04-27 11:17:23,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 83 transitions. [2022-04-27 11:17:23,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:23,839 INFO L225 Difference]: With dead ends: 433 [2022-04-27 11:17:23,840 INFO L226 Difference]: Without dead ends: 406 [2022-04-27 11:17:23,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1031, Invalid=7899, Unknown=0, NotChecked=0, Total=8930 [2022-04-27 11:17:23,842 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 163 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:23,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 141 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 11:17:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-04-27 11:17:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 401. [2022-04-27 11:17:24,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:24,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 406 states. Second operand has 401 states, 396 states have (on average 1.457070707070707) internal successors, (577), 396 states have internal predecessors, (577), 3 states have call successors, (3), 3 states 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:24,911 INFO L74 IsIncluded]: Start isIncluded. First operand 406 states. Second operand has 401 states, 396 states have (on average 1.457070707070707) internal successors, (577), 396 states have internal predecessors, (577), 3 states have call successors, (3), 3 states 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:24,911 INFO L87 Difference]: Start difference. First operand 406 states. Second operand has 401 states, 396 states have (on average 1.457070707070707) internal successors, (577), 396 states have internal predecessors, (577), 3 states have call successors, (3), 3 states 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:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:24,919 INFO L93 Difference]: Finished difference Result 406 states and 587 transitions. [2022-04-27 11:17:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 587 transitions. [2022-04-27 11:17:24,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:24,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:24,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 396 states have (on average 1.457070707070707) internal successors, (577), 396 states have internal predecessors, (577), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 406 states. [2022-04-27 11:17:24,920 INFO L87 Difference]: Start difference. First operand has 401 states, 396 states have (on average 1.457070707070707) internal successors, (577), 396 states have internal predecessors, (577), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 406 states. [2022-04-27 11:17:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:24,929 INFO L93 Difference]: Finished difference Result 406 states and 587 transitions. [2022-04-27 11:17:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 587 transitions. [2022-04-27 11:17:24,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:24,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:24,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:24,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.457070707070707) internal successors, (577), 396 states have internal predecessors, (577), 3 states have call successors, (3), 3 states 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:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 581 transitions. [2022-04-27 11:17:24,940 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 581 transitions. Word has length 31 [2022-04-27 11:17:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:24,940 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 581 transitions. [2022-04-27 11:17:24,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 57 states have internal predecessors, (73), 3 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:17:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 581 transitions. [2022-04-27 11:17:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:17:24,941 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:24,941 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:24,949 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:17:25,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:25,146 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -281941914, now seen corresponding path program 7 times [2022-04-27 11:17:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:25,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013547595] [2022-04-27 11:17:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:25,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {25691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25674#true} is VALID [2022-04-27 11:17:25,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {25674#true} assume true; {25674#true} is VALID [2022-04-27 11:17:25,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25674#true} {25674#true} #72#return; {25674#true} is VALID [2022-04-27 11:17:25,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {25674#true} call ULTIMATE.init(); {25691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:25,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {25691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25674#true} is VALID [2022-04-27 11:17:25,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {25674#true} assume true; {25674#true} is VALID [2022-04-27 11:17:25,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25674#true} {25674#true} #72#return; {25674#true} is VALID [2022-04-27 11:17:25,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {25674#true} call #t~ret13 := main(); {25674#true} is VALID [2022-04-27 11:17:25,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {25674#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25679#(= main_~y~0 0)} is VALID [2022-04-27 11:17:25,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {25679#(= 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; {25680#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:25,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {25680#(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; {25681#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:25,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {25681#(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; {25682#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:25,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {25682#(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; {25683#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:25,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {25683#(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; {25684#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:25,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {25684#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {25684#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:25,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {25684#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {25685#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:17:25,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {25685#(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; {25686#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:17:25,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {25686#(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; {25687#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:17:25,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {25687#(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; {25688#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:17:25,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {25688#(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; {25689#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:17:25,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {25689#(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; {25690#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:17:25,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {25690#(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; {25675#false} is VALID [2022-04-27 11:17:25,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {25675#false} assume !(~z~0 % 4294967296 > 0); {25675#false} is VALID [2022-04-27 11:17:25,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {25675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25675#false} is VALID [2022-04-27 11:17:25,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {25675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25675#false} is VALID [2022-04-27 11:17:25,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {25675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25675#false} is VALID [2022-04-27 11:17:25,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {25675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25675#false} is VALID [2022-04-27 11:17:25,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {25675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25675#false} is VALID [2022-04-27 11:17:25,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {25675#false} assume !(~y~0 % 4294967296 > 0); {25675#false} is VALID [2022-04-27 11:17:25,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {25675#false} assume !(~x~0 % 4294967296 > 0); {25675#false} is VALID [2022-04-27 11:17:25,371 INFO L272 TraceCheckUtils]: 27: Hoare triple {25675#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {25675#false} is VALID [2022-04-27 11:17:25,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {25675#false} ~cond := #in~cond; {25675#false} is VALID [2022-04-27 11:17:25,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {25675#false} assume 0 == ~cond; {25675#false} is VALID [2022-04-27 11:17:25,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {25675#false} assume !false; {25675#false} is VALID [2022-04-27 11:17:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:17:25,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:25,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013547595] [2022-04-27 11:17:25,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013547595] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:25,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312666649] [2022-04-27 11:17:25,372 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:17:25,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:25,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:25,373 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:17:25,376 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:17:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:25,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 11:17:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:25,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:25,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {25674#true} call ULTIMATE.init(); {25674#true} is VALID [2022-04-27 11:17:25,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {25674#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25674#true} is VALID [2022-04-27 11:17:25,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {25674#true} assume true; {25674#true} is VALID [2022-04-27 11:17:25,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25674#true} {25674#true} #72#return; {25674#true} is VALID [2022-04-27 11:17:25,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {25674#true} call #t~ret13 := main(); {25674#true} is VALID [2022-04-27 11:17:25,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {25674#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25679#(= main_~y~0 0)} is VALID [2022-04-27 11:17:25,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {25679#(= 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; {25680#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:25,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {25680#(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; {25681#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:25,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {25681#(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; {25682#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:25,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {25682#(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; {25683#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:25,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {25683#(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; {25684#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:25,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {25684#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {25684#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:25,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {25684#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {25731#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:25,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {25731#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25735#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:17:25,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {25735#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25739#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:25,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {25739#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25743#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:25,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {25743#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25747#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:25,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {25747#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25751#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:25,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {25751#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25675#false} is VALID [2022-04-27 11:17:25,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {25675#false} assume !(~z~0 % 4294967296 > 0); {25675#false} is VALID [2022-04-27 11:17:25,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {25675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {25675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {25675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {25675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {25675#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {25675#false} assume !(~y~0 % 4294967296 > 0); {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {25675#false} assume !(~x~0 % 4294967296 > 0); {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L272 TraceCheckUtils]: 27: Hoare triple {25675#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {25675#false} ~cond := #in~cond; {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {25675#false} assume 0 == ~cond; {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {25675#false} assume !false; {25675#false} is VALID [2022-04-27 11:17:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:17:25,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:26,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {25675#false} assume !false; {25675#false} is VALID [2022-04-27 11:17:26,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {25675#false} assume 0 == ~cond; {25675#false} is VALID [2022-04-27 11:17:26,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {25675#false} ~cond := #in~cond; {25675#false} is VALID [2022-04-27 11:17:26,053 INFO L272 TraceCheckUtils]: 27: Hoare triple {25675#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {25675#false} is VALID [2022-04-27 11:17:26,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {25675#false} assume !(~x~0 % 4294967296 > 0); {25675#false} is VALID [2022-04-27 11:17:26,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {25806#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {25675#false} is VALID [2022-04-27 11:17:26,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {25810#(< 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; {25806#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:17:26,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {25814#(< 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; {25810#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:26,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {25818#(< 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; {25814#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:26,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {25822#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25818#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:17:26,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {25826#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25822#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:26,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {25826#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {25826#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:26,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {25833#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25826#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:26,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {25837#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25833#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:17:26,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {25841#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25837#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:17:26,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {25845#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25841#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:17:26,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {25849#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25845#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:17:26,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {25853#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25849#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:17:26,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {25674#true} ~z~0 := ~y~0; {25853#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:17:26,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {25674#true} assume !(~x~0 % 4294967296 > 0); {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {25674#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {25674#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {25674#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {25674#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {25674#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {25674#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {25674#true} call #t~ret13 := main(); {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25674#true} {25674#true} #72#return; {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {25674#true} assume true; {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {25674#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {25674#true} call ULTIMATE.init(); {25674#true} is VALID [2022-04-27 11:17:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:17:26,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312666649] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:26,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:26,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2022-04-27 11:17:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932665776] [2022-04-27 11:17:26,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:26,064 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 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 31 [2022-04-27 11:17:26,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:26,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 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:17:26,105 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:17:26,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-27 11:17:26,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:26,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-27 11:17:26,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:17:26,106 INFO L87 Difference]: Start difference. First operand 401 states and 581 transitions. Second operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 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:17:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:30,987 INFO L93 Difference]: Finished difference Result 781 states and 991 transitions. [2022-04-27 11:17:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-27 11:17:30,987 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 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 31 [2022-04-27 11:17:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 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:17:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 136 transitions. [2022-04-27 11:17:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 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:17:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 136 transitions. [2022-04-27 11:17:30,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 136 transitions. [2022-04-27 11:17:31,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:31,369 INFO L225 Difference]: With dead ends: 781 [2022-04-27 11:17:31,370 INFO L226 Difference]: Without dead ends: 708 [2022-04-27 11:17:31,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1269, Invalid=5703, Unknown=0, NotChecked=0, Total=6972 [2022-04-27 11:17:31,371 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 240 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:31,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 98 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 11:17:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-04-27 11:17:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 409. [2022-04-27 11:17:32,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:32,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 708 states. Second operand has 409 states, 404 states have (on average 1.443069306930693) internal successors, (583), 404 states have internal predecessors, (583), 3 states have call successors, (3), 3 states 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:32,541 INFO L74 IsIncluded]: Start isIncluded. First operand 708 states. Second operand has 409 states, 404 states have (on average 1.443069306930693) internal successors, (583), 404 states have internal predecessors, (583), 3 states have call successors, (3), 3 states 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:32,542 INFO L87 Difference]: Start difference. First operand 708 states. Second operand has 409 states, 404 states have (on average 1.443069306930693) internal successors, (583), 404 states have internal predecessors, (583), 3 states have call successors, (3), 3 states 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:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:32,562 INFO L93 Difference]: Finished difference Result 708 states and 888 transitions. [2022-04-27 11:17:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 888 transitions. [2022-04-27 11:17:32,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:32,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:32,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 404 states have (on average 1.443069306930693) internal successors, (583), 404 states have internal predecessors, (583), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 708 states. [2022-04-27 11:17:32,564 INFO L87 Difference]: Start difference. First operand has 409 states, 404 states have (on average 1.443069306930693) internal successors, (583), 404 states have internal predecessors, (583), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 708 states. [2022-04-27 11:17:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:32,584 INFO L93 Difference]: Finished difference Result 708 states and 888 transitions. [2022-04-27 11:17:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 888 transitions. [2022-04-27 11:17:32,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:32,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:32,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:32,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 404 states have (on average 1.443069306930693) internal successors, (583), 404 states have internal predecessors, (583), 3 states have call successors, (3), 3 states 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:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 587 transitions. [2022-04-27 11:17:32,596 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 587 transitions. Word has length 31 [2022-04-27 11:17:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:32,596 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 587 transitions. [2022-04-27 11:17:32,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 32 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:17:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 587 transitions. [2022-04-27 11:17:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:17:32,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:32,597 INFO L195 NwaCegarLoop]: trace histogram [8, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:32,623 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:17:32,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:32,821 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash -397406416, now seen corresponding path program 10 times [2022-04-27 11:17:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:32,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215341506] [2022-04-27 11:17:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:32,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {28933#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28924#true} is VALID [2022-04-27 11:17:32,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {28924#true} assume true; {28924#true} is VALID [2022-04-27 11:17:32,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28924#true} {28924#true} #72#return; {28924#true} is VALID [2022-04-27 11:17:32,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {28924#true} call ULTIMATE.init(); {28933#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:32,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {28933#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28924#true} is VALID [2022-04-27 11:17:32,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {28924#true} assume true; {28924#true} is VALID [2022-04-27 11:17:32,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28924#true} {28924#true} #72#return; {28924#true} is VALID [2022-04-27 11:17:32,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {28924#true} call #t~ret13 := main(); {28924#true} is VALID [2022-04-27 11:17:32,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {28924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28924#true} is VALID [2022-04-27 11:17:32,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {28924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28924#true} is VALID [2022-04-27 11:17:32,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {28924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28924#true} is VALID [2022-04-27 11:17:32,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {28924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28924#true} is VALID [2022-04-27 11:17:32,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {28924#true} assume !(~x~0 % 4294967296 > 0); {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:32,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:32,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {28929#(<= 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; {28930#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:32,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {28930#(<= 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; {28931#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:32,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {28931#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:32,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:32,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {28932#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:32,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {28932#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:32,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {28932#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:32,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:32,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {28932#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28931#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:32,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {28931#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28930#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:32,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {28930#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:32,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {28929#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:32,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:32,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:32,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:32,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:32,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {28925#false} assume !(~x~0 % 4294967296 > 0); {28925#false} is VALID [2022-04-27 11:17:32,933 INFO L272 TraceCheckUtils]: 28: Hoare triple {28925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {28925#false} is VALID [2022-04-27 11:17:32,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {28925#false} ~cond := #in~cond; {28925#false} is VALID [2022-04-27 11:17:32,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {28925#false} assume 0 == ~cond; {28925#false} is VALID [2022-04-27 11:17:32,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {28925#false} assume !false; {28925#false} is VALID [2022-04-27 11:17:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:17:32,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:32,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215341506] [2022-04-27 11:17:32,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215341506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:32,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026761969] [2022-04-27 11:17:32,934 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:17:32,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:32,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:32,935 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:17:32,958 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:17:32,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:17:32,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:32,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:17:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:32,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:33,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {28924#true} call ULTIMATE.init(); {28924#true} is VALID [2022-04-27 11:17:33,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {28924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28924#true} is VALID [2022-04-27 11:17:33,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {28924#true} assume true; {28924#true} is VALID [2022-04-27 11:17:33,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28924#true} {28924#true} #72#return; {28924#true} is VALID [2022-04-27 11:17:33,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {28924#true} call #t~ret13 := main(); {28924#true} is VALID [2022-04-27 11:17:33,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {28924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28924#true} is VALID [2022-04-27 11:17:33,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {28924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28924#true} is VALID [2022-04-27 11:17:33,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {28924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28924#true} is VALID [2022-04-27 11:17:33,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {28924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28924#true} is VALID [2022-04-27 11:17:33,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {28924#true} assume !(~x~0 % 4294967296 > 0); {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:33,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:33,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {28929#(<= 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; {28930#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:33,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {28930#(<= 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; {28931#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {28931#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {28932#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {28932#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {28932#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {28932#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28931#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {28931#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28930#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:33,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {28930#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:33,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {28929#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:33,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:33,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:33,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:33,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:33,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {28925#false} assume !(~x~0 % 4294967296 > 0); {28925#false} is VALID [2022-04-27 11:17:33,113 INFO L272 TraceCheckUtils]: 28: Hoare triple {28925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {28925#false} is VALID [2022-04-27 11:17:33,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {28925#false} ~cond := #in~cond; {28925#false} is VALID [2022-04-27 11:17:33,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {28925#false} assume 0 == ~cond; {28925#false} is VALID [2022-04-27 11:17:33,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {28925#false} assume !false; {28925#false} is VALID [2022-04-27 11:17:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:17:33,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:33,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {28925#false} assume !false; {28925#false} is VALID [2022-04-27 11:17:33,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {28925#false} assume 0 == ~cond; {28925#false} is VALID [2022-04-27 11:17:33,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {28925#false} ~cond := #in~cond; {28925#false} is VALID [2022-04-27 11:17:33,353 INFO L272 TraceCheckUtils]: 28: Hoare triple {28925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {28925#false} is VALID [2022-04-27 11:17:33,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {28925#false} assume !(~x~0 % 4294967296 > 0); {28925#false} is VALID [2022-04-27 11:17:33,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:33,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:33,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:33,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {28925#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:33,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {28929#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28925#false} is VALID [2022-04-27 11:17:33,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {28930#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:33,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {28931#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28930#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:33,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {28932#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {28931#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {28932#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {28932#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {28932#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {28931#(<= 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; {28932#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {28930#(<= 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; {28931#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:33,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {28929#(<= 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; {28930#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:33,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:33,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {28924#true} assume !(~x~0 % 4294967296 > 0); {28929#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:33,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {28924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28924#true} is VALID [2022-04-27 11:17:33,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {28924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28924#true} is VALID [2022-04-27 11:17:33,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {28924#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28924#true} is VALID [2022-04-27 11:17:33,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {28924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28924#true} is VALID [2022-04-27 11:17:33,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {28924#true} call #t~ret13 := main(); {28924#true} is VALID [2022-04-27 11:17:33,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28924#true} {28924#true} #72#return; {28924#true} is VALID [2022-04-27 11:17:33,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {28924#true} assume true; {28924#true} is VALID [2022-04-27 11:17:33,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {28924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28924#true} is VALID [2022-04-27 11:17:33,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {28924#true} call ULTIMATE.init(); {28924#true} is VALID [2022-04-27 11:17:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:17:33,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026761969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:33,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:33,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-27 11:17:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254831014] [2022-04-27 11:17:33,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:33,365 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 32 [2022-04-27 11:17:33,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:33,365 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:17:33,390 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:17:33,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:17:33,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:33,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:17:33,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:17:33,391 INFO L87 Difference]: Start difference. First operand 409 states and 587 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:17:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:34,902 INFO L93 Difference]: Finished difference Result 419 states and 598 transitions. [2022-04-27 11:17:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:17:34,902 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 32 [2022-04-27 11:17:34,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:34,903 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:17:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 11:17:34,903 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:17:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 11:17:34,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-27 11:17:34,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:34,949 INFO L225 Difference]: With dead ends: 419 [2022-04-27 11:17:34,949 INFO L226 Difference]: Without dead ends: 396 [2022-04-27 11:17:34,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:17:34,950 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:34,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 47 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:17:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-27 11:17:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2022-04-27 11:17:36,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:36,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 3 states 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:36,033 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 3 states 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:36,033 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 3 states 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:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:36,041 INFO L93 Difference]: Finished difference Result 396 states and 573 transitions. [2022-04-27 11:17:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 573 transitions. [2022-04-27 11:17:36,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:36,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:36,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 396 states. [2022-04-27 11:17:36,043 INFO L87 Difference]: Start difference. First operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 396 states. [2022-04-27 11:17:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:36,051 INFO L93 Difference]: Finished difference Result 396 states and 573 transitions. [2022-04-27 11:17:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 573 transitions. [2022-04-27 11:17:36,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:36,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:36,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:36,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 3 states 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:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 570 transitions. [2022-04-27 11:17:36,063 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 570 transitions. Word has length 32 [2022-04-27 11:17:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:36,063 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 570 transitions. [2022-04-27 11:17:36,063 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:17:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 570 transitions. [2022-04-27 11:17:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 11:17:36,064 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:36,064 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:36,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-27 11:17:36,281 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,SelfDestructingSolverStorable23 [2022-04-27 11:17:36,281 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:36,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:36,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2019384376, now seen corresponding path program 11 times [2022-04-27 11:17:36,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:36,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556412324] [2022-04-27 11:17:36,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:36,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:36,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:36,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {31057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31041#true} is VALID [2022-04-27 11:17:36,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {31041#true} assume true; {31041#true} is VALID [2022-04-27 11:17:36,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31041#true} {31041#true} #72#return; {31041#true} is VALID [2022-04-27 11:17:36,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {31041#true} call ULTIMATE.init(); {31057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:36,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {31057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31041#true} is VALID [2022-04-27 11:17:36,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {31041#true} assume true; {31041#true} is VALID [2022-04-27 11:17:36,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31041#true} {31041#true} #72#return; {31041#true} is VALID [2022-04-27 11:17:36,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {31041#true} call #t~ret13 := main(); {31041#true} is VALID [2022-04-27 11:17:36,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {31041#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31046#(= main_~y~0 0)} is VALID [2022-04-27 11:17:36,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {31046#(= 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; {31047#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:36,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {31047#(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; {31048#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:36,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {31048#(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; {31049#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:36,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {31049#(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; {31050#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:36,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {31050#(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; {31051#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:36,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {31051#(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; {31052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:36,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {31052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {31052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:36,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {31052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {31053#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:36,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {31053#(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; {31054#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:17:36,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {31054#(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; {31055#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:17:36,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {31055#(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; {31056#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:17:36,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {31056#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {31042#false} is VALID [2022-04-27 11:17:36,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {31042#false} assume !(~y~0 % 4294967296 > 0); {31042#false} is VALID [2022-04-27 11:17:36,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {31042#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {31042#false} is VALID [2022-04-27 11:17:36,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {31042#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {31042#false} is VALID [2022-04-27 11:17:36,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {31042#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {31042#false} is VALID [2022-04-27 11:17:36,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {31042#false} assume !(~x~0 % 4294967296 > 0); {31042#false} is VALID [2022-04-27 11:17:36,500 INFO L272 TraceCheckUtils]: 29: Hoare triple {31042#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {31042#false} is VALID [2022-04-27 11:17:36,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {31042#false} ~cond := #in~cond; {31042#false} is VALID [2022-04-27 11:17:36,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {31042#false} assume 0 == ~cond; {31042#false} is VALID [2022-04-27 11:17:36,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {31042#false} assume !false; {31042#false} is VALID [2022-04-27 11:17:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 11:17:36,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:36,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556412324] [2022-04-27 11:17:36,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556412324] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:36,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267759479] [2022-04-27 11:17:36,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:17:36,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:36,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:36,504 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:17:36,537 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:17:36,610 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:17:36,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:36,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 11:17:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:36,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:36,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {31041#true} call ULTIMATE.init(); {31041#true} is VALID [2022-04-27 11:17:36,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {31041#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31041#true} is VALID [2022-04-27 11:17:36,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {31041#true} assume true; {31041#true} is VALID [2022-04-27 11:17:36,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31041#true} {31041#true} #72#return; {31041#true} is VALID [2022-04-27 11:17:36,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {31041#true} call #t~ret13 := main(); {31041#true} is VALID [2022-04-27 11:17:36,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {31041#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31046#(= main_~y~0 0)} is VALID [2022-04-27 11:17:36,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {31046#(= 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; {31047#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:36,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {31047#(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; {31048#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:36,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {31048#(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; {31049#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:36,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {31049#(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; {31050#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:36,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {31050#(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; {31051#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:36,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {31051#(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; {31052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:36,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {31052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {31052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:36,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {31052#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {31100#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:36,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {31100#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31104#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:17:36,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {31104#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31108#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:36,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {31108#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31112#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:36,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {31112#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {31042#false} is VALID [2022-04-27 11:17:36,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:36,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {31042#false} assume !(~y~0 % 4294967296 > 0); {31042#false} is VALID [2022-04-27 11:17:36,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {31042#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {31042#false} is VALID [2022-04-27 11:17:36,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {31042#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {31042#false} is VALID [2022-04-27 11:17:36,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {31042#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {31042#false} is VALID [2022-04-27 11:17:36,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {31042#false} assume !(~x~0 % 4294967296 > 0); {31042#false} is VALID [2022-04-27 11:17:36,826 INFO L272 TraceCheckUtils]: 29: Hoare triple {31042#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {31042#false} is VALID [2022-04-27 11:17:36,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {31042#false} ~cond := #in~cond; {31042#false} is VALID [2022-04-27 11:17:36,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {31042#false} assume 0 == ~cond; {31042#false} is VALID [2022-04-27 11:17:36,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {31042#false} assume !false; {31042#false} is VALID [2022-04-27 11:17:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 11:17:36,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:37,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {31042#false} assume !false; {31042#false} is VALID [2022-04-27 11:17:37,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {31042#false} assume 0 == ~cond; {31042#false} is VALID [2022-04-27 11:17:37,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {31042#false} ~cond := #in~cond; {31042#false} is VALID [2022-04-27 11:17:37,068 INFO L272 TraceCheckUtils]: 29: Hoare triple {31042#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {31042#false} is VALID [2022-04-27 11:17:37,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {31042#false} assume !(~x~0 % 4294967296 > 0); {31042#false} is VALID [2022-04-27 11:17:37,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {31042#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {31042#false} is VALID [2022-04-27 11:17:37,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {31042#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {31042#false} is VALID [2022-04-27 11:17:37,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {31042#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {31042#false} is VALID [2022-04-27 11:17:37,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {31042#false} assume !(~y~0 % 4294967296 > 0); {31042#false} is VALID [2022-04-27 11:17:37,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:37,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {31042#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31042#false} is VALID [2022-04-27 11:17:37,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {31194#(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; {31042#false} is VALID [2022-04-27 11:17:37,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {31198#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31194#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:17:37,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {31202#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31198#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:17:37,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {31206#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31202#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:17:37,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {31210#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {31206#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:17:37,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {31214#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31210#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-27 11:17:37,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {31218#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31214#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:17:37,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {31222#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31218#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-27 11:17:37,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {31041#true} ~z~0 := ~y~0; {31222#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:17:37,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {31041#true} assume !(~x~0 % 4294967296 > 0); {31041#true} is VALID [2022-04-27 11:17:37,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {31041#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31041#true} is VALID [2022-04-27 11:17:37,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {31041#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31041#true} is VALID [2022-04-27 11:17:37,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {31041#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31041#true} is VALID [2022-04-27 11:17:37,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {31041#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31041#true} is VALID [2022-04-27 11:17:37,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {31041#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31041#true} is VALID [2022-04-27 11:17:37,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {31041#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {31041#true} is VALID [2022-04-27 11:17:37,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {31041#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31041#true} is VALID [2022-04-27 11:17:37,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {31041#true} call #t~ret13 := main(); {31041#true} is VALID [2022-04-27 11:17:37,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31041#true} {31041#true} #72#return; {31041#true} is VALID [2022-04-27 11:17:37,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {31041#true} assume true; {31041#true} is VALID [2022-04-27 11:17:37,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {31041#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {31041#true} is VALID [2022-04-27 11:17:37,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {31041#true} call ULTIMATE.init(); {31041#true} is VALID [2022-04-27 11:17:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 11:17:37,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267759479] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:37,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:37,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 26 [2022-04-27 11:17:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048234977] [2022-04-27 11:17:37,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:37,077 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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:17:37,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:37,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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:37,110 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:17:37,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 11:17:37,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:37,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 11:17:37,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:17:37,111 INFO L87 Difference]: Start difference. First operand 393 states and 570 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:40,482 INFO L93 Difference]: Finished difference Result 576 states and 789 transitions. [2022-04-27 11:17:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-27 11:17:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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:17:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 98 transitions. [2022-04-27 11:17:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 98 transitions. [2022-04-27 11:17:40,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 98 transitions. [2022-04-27 11:17:40,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:40,605 INFO L225 Difference]: With dead ends: 576 [2022-04-27 11:17:40,605 INFO L226 Difference]: Without dead ends: 496 [2022-04-27 11:17:40,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=475, Invalid=3431, Unknown=0, NotChecked=0, Total=3906 [2022-04-27 11:17:40,606 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 47 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:40,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 79 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 11:17:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-04-27 11:17:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 375. [2022-04-27 11:17:41,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:41,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 496 states. Second operand has 375 states, 370 states have (on average 1.4405405405405405) internal successors, (533), 370 states have internal predecessors, (533), 3 states have call successors, (3), 3 states 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:41,705 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand has 375 states, 370 states have (on average 1.4405405405405405) internal successors, (533), 370 states have internal predecessors, (533), 3 states have call successors, (3), 3 states 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:41,706 INFO L87 Difference]: Start difference. First operand 496 states. Second operand has 375 states, 370 states have (on average 1.4405405405405405) internal successors, (533), 370 states have internal predecessors, (533), 3 states have call successors, (3), 3 states 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:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:41,713 INFO L93 Difference]: Finished difference Result 496 states and 688 transitions. [2022-04-27 11:17:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 688 transitions. [2022-04-27 11:17:41,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:41,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:41,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 375 states, 370 states have (on average 1.4405405405405405) internal successors, (533), 370 states have internal predecessors, (533), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-27 11:17:41,714 INFO L87 Difference]: Start difference. First operand has 375 states, 370 states have (on average 1.4405405405405405) internal successors, (533), 370 states have internal predecessors, (533), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 496 states. [2022-04-27 11:17:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:41,725 INFO L93 Difference]: Finished difference Result 496 states and 688 transitions. [2022-04-27 11:17:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 688 transitions. [2022-04-27 11:17:41,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:41,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:41,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:41,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 370 states have (on average 1.4405405405405405) internal successors, (533), 370 states have internal predecessors, (533), 3 states have call successors, (3), 3 states 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:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 537 transitions. [2022-04-27 11:17:41,734 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 537 transitions. Word has length 33 [2022-04-27 11:17:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:41,734 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 537 transitions. [2022-04-27 11:17:41,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 537 transitions. [2022-04-27 11:17:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 11:17:41,735 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:41,735 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:41,751 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:17:41,935 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,SelfDestructingSolverStorable24 [2022-04-27 11:17:41,936 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash -475206312, now seen corresponding path program 8 times [2022-04-27 11:17:41,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:41,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421778429] [2022-04-27 11:17:41,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:41,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:42,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:42,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {33611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33594#true} is VALID [2022-04-27 11:17:42,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {33594#true} assume true; {33594#true} is VALID [2022-04-27 11:17:42,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33594#true} {33594#true} #72#return; {33594#true} is VALID [2022-04-27 11:17:42,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {33594#true} call ULTIMATE.init(); {33611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:42,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {33611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33594#true} is VALID [2022-04-27 11:17:42,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {33594#true} assume true; {33594#true} is VALID [2022-04-27 11:17:42,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33594#true} {33594#true} #72#return; {33594#true} is VALID [2022-04-27 11:17:42,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {33594#true} call #t~ret13 := main(); {33594#true} is VALID [2022-04-27 11:17:42,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {33594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33594#true} is VALID [2022-04-27 11:17:42,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {33594#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33599#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:17:42,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {33599#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33600#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:17:42,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {33600#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33601#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:17:42,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {33601#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33602#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:17:42,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {33602#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33603#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:17:42,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {33603#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33604#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:17:42,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {33604#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {33604#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:17:42,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {33604#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {33604#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:17:42,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {33604#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33605#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:17:42,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {33605#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33606#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-27 11:17:42,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {33606#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33607#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-27 11:17:42,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {33607#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33608#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:17:42,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {33608#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33609#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:17:42,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {33609#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:42,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:42,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:42,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:42,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:42,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:42,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:42,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:42,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:42,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {33610#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {33595#false} is VALID [2022-04-27 11:17:42,214 INFO L272 TraceCheckUtils]: 29: Hoare triple {33595#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {33595#false} is VALID [2022-04-27 11:17:42,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {33595#false} ~cond := #in~cond; {33595#false} is VALID [2022-04-27 11:17:42,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {33595#false} assume 0 == ~cond; {33595#false} is VALID [2022-04-27 11:17:42,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {33595#false} assume !false; {33595#false} is VALID [2022-04-27 11:17:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:17:42,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:42,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421778429] [2022-04-27 11:17:42,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421778429] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:42,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814783236] [2022-04-27 11:17:42,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:17:42,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:42,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:42,216 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:17:42,239 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:17:42,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:17:42,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:42,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 11:17:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:42,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:42,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {33594#true} call ULTIMATE.init(); {33594#true} is VALID [2022-04-27 11:17:42,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {33594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33594#true} is VALID [2022-04-27 11:17:42,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {33594#true} assume true; {33594#true} is VALID [2022-04-27 11:17:42,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33594#true} {33594#true} #72#return; {33594#true} is VALID [2022-04-27 11:17:42,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {33594#true} call #t~ret13 := main(); {33594#true} is VALID [2022-04-27 11:17:42,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {33594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33594#true} is VALID [2022-04-27 11:17:42,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {33594#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33599#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:17:42,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {33599#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33636#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:17:42,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {33636#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33640#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {33640#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33644#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:17:42,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {33644#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33648#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {33648#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:17:42,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:17:42,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:17:42,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33648#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {33648#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33644#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:17:42,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {33644#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33640#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {33640#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33636#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:17:42,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {33636#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33599#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:17:42,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {33599#(<= 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; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33595#false} is VALID [2022-04-27 11:17:42,683 INFO L272 TraceCheckUtils]: 29: Hoare triple {33595#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {33595#false} is VALID [2022-04-27 11:17:42,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {33595#false} ~cond := #in~cond; {33595#false} is VALID [2022-04-27 11:17:42,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {33595#false} assume 0 == ~cond; {33595#false} is VALID [2022-04-27 11:17:42,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {33595#false} assume !false; {33595#false} is VALID [2022-04-27 11:17:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:17:42,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:42,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {33595#false} assume !false; {33595#false} is VALID [2022-04-27 11:17:42,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {33595#false} assume 0 == ~cond; {33595#false} is VALID [2022-04-27 11:17:42,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {33595#false} ~cond := #in~cond; {33595#false} is VALID [2022-04-27 11:17:42,972 INFO L272 TraceCheckUtils]: 29: Hoare triple {33595#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {33595#false} is VALID [2022-04-27 11:17:42,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33595#false} is VALID [2022-04-27 11:17:42,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {33599#(<= 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; {33677#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {33636#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33599#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:17:42,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {33640#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33636#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:17:42,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {33644#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33640#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {33648#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33644#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:17:42,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33648#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:17:42,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:17:42,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {33648#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33652#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:17:42,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {33644#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33648#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {33640#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33644#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:17:42,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {33636#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33640#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:42,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {33599#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33636#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:17:42,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {33594#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33599#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:17:42,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {33594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33594#true} is VALID [2022-04-27 11:17:42,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {33594#true} call #t~ret13 := main(); {33594#true} is VALID [2022-04-27 11:17:42,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33594#true} {33594#true} #72#return; {33594#true} is VALID [2022-04-27 11:17:42,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {33594#true} assume true; {33594#true} is VALID [2022-04-27 11:17:42,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {33594#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33594#true} is VALID [2022-04-27 11:17:42,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {33594#true} call ULTIMATE.init(); {33594#true} is VALID [2022-04-27 11:17:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:17:42,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814783236] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:42,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:42,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-27 11:17:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561554406] [2022-04-27 11:17:42,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:42,989 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 33 [2022-04-27 11:17:42,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:42,989 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:17:43,037 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:17:43,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 11:17:43,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 11:17:43,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-27 11:17:43,038 INFO L87 Difference]: Start difference. First operand 375 states and 537 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:17:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:45,266 INFO L93 Difference]: Finished difference Result 395 states and 567 transitions. [2022-04-27 11:17:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:17:45,266 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 33 [2022-04-27 11:17:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:45,267 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:17:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2022-04-27 11:17:45,267 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:17:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2022-04-27 11:17:45,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2022-04-27 11:17:45,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:45,357 INFO L225 Difference]: With dead ends: 395 [2022-04-27 11:17:45,357 INFO L226 Difference]: Without dead ends: 390 [2022-04-27 11:17:45,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:17:45,358 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 78 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:45,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 75 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:17:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-27 11:17:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 378. [2022-04-27 11:17:46,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:46,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 378 states, 373 states have (on average 1.4369973190348526) internal successors, (536), 373 states have internal predecessors, (536), 3 states have call successors, (3), 3 states 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:46,505 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 378 states, 373 states have (on average 1.4369973190348526) internal successors, (536), 373 states have internal predecessors, (536), 3 states have call successors, (3), 3 states 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:46,505 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 378 states, 373 states have (on average 1.4369973190348526) internal successors, (536), 373 states have internal predecessors, (536), 3 states have call successors, (3), 3 states 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:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:46,511 INFO L93 Difference]: Finished difference Result 390 states and 560 transitions. [2022-04-27 11:17:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 560 transitions. [2022-04-27 11:17:46,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:46,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:46,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 378 states, 373 states have (on average 1.4369973190348526) internal successors, (536), 373 states have internal predecessors, (536), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 390 states. [2022-04-27 11:17:46,512 INFO L87 Difference]: Start difference. First operand has 378 states, 373 states have (on average 1.4369973190348526) internal successors, (536), 373 states have internal predecessors, (536), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 390 states. [2022-04-27 11:17:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:46,518 INFO L93 Difference]: Finished difference Result 390 states and 560 transitions. [2022-04-27 11:17:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 560 transitions. [2022-04-27 11:17:46,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:46,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:46,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:46,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 373 states have (on average 1.4369973190348526) internal successors, (536), 373 states have internal predecessors, (536), 3 states have call successors, (3), 3 states 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:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 540 transitions. [2022-04-27 11:17:46,524 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 540 transitions. Word has length 33 [2022-04-27 11:17:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:46,524 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 540 transitions. [2022-04-27 11:17:46,524 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:17:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 540 transitions. [2022-04-27 11:17:46,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 11:17:46,525 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:46,525 INFO L195 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:46,541 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:17:46,726 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,SelfDestructingSolverStorable25 [2022-04-27 11:17:46,726 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:46,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash -59159359, now seen corresponding path program 12 times [2022-04-27 11:17:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:46,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694246406] [2022-04-27 11:17:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:47,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:47,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {35714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35692#true} is VALID [2022-04-27 11:17:47,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {35692#true} assume true; {35692#true} is VALID [2022-04-27 11:17:47,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35692#true} {35692#true} #72#return; {35692#true} is VALID [2022-04-27 11:17:47,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {35692#true} call ULTIMATE.init(); {35714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:47,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {35714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35692#true} is VALID [2022-04-27 11:17:47,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {35692#true} assume true; {35692#true} is VALID [2022-04-27 11:17:47,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35692#true} {35692#true} #72#return; {35692#true} is VALID [2022-04-27 11:17:47,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {35692#true} call #t~ret13 := main(); {35692#true} is VALID [2022-04-27 11:17:47,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {35692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35697#(= main_~y~0 0)} is VALID [2022-04-27 11:17:47,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {35697#(= 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; {35698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:47,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {35698#(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; {35699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:47,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {35699#(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; {35700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:47,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {35700#(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; {35701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:47,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {35701#(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; {35702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:47,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {35702#(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; {35703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:47,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {35703#(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; {35704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:17:47,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {35704#(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; {35705#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:17:47,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {35705#(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; {35706#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:17:47,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {35706#(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; {35707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:17:47,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {35707#(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; {35708#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:17:47,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {35708#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35709#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:17:47,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {35709#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:47,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:47,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {35711#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:17:47,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {35711#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35712#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:17:47,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {35712#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35713#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-27 11:17:47,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {35713#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35693#false} is VALID [2022-04-27 11:17:47,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {35693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35693#false} is VALID [2022-04-27 11:17:47,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {35693#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35693#false} is VALID [2022-04-27 11:17:47,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {35693#false} assume !(~y~0 % 4294967296 > 0); {35693#false} is VALID [2022-04-27 11:17:47,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {35693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {35693#false} is VALID [2022-04-27 11:17:47,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {35693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {35693#false} is VALID [2022-04-27 11:17:47,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {35693#false} assume !(~x~0 % 4294967296 > 0); {35693#false} is VALID [2022-04-27 11:17:47,060 INFO L272 TraceCheckUtils]: 30: Hoare triple {35693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {35693#false} is VALID [2022-04-27 11:17:47,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {35693#false} ~cond := #in~cond; {35693#false} is VALID [2022-04-27 11:17:47,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {35693#false} assume 0 == ~cond; {35693#false} is VALID [2022-04-27 11:17:47,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {35693#false} assume !false; {35693#false} is VALID [2022-04-27 11:17:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:17:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:47,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694246406] [2022-04-27 11:17:47,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694246406] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:47,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125539932] [2022-04-27 11:17:47,061 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:17:47,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:47,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:47,064 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:17:47,090 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:17:47,372 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-27 11:17:47,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:47,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 11:17:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:47,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:47,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {35692#true} call ULTIMATE.init(); {35692#true} is VALID [2022-04-27 11:17:47,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {35692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35692#true} is VALID [2022-04-27 11:17:47,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {35692#true} assume true; {35692#true} is VALID [2022-04-27 11:17:47,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35692#true} {35692#true} #72#return; {35692#true} is VALID [2022-04-27 11:17:47,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {35692#true} call #t~ret13 := main(); {35692#true} is VALID [2022-04-27 11:17:47,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {35692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35697#(= main_~y~0 0)} is VALID [2022-04-27 11:17:47,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {35697#(= 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; {35698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:47,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {35698#(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; {35699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:47,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {35699#(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; {35700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:47,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {35700#(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; {35701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:47,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {35701#(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; {35702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:47,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {35702#(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; {35703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:47,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {35703#(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; {35704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:17:47,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {35704#(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; {35705#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:17:47,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {35705#(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; {35706#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:17:47,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {35706#(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; {35707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:17:47,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {35707#(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; {35708#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:17:47,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {35708#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35709#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:17:47,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {35709#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:47,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:47,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:47,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:47,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:47,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {35710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:17:47,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {35710#(and (<= main_~y~0 13) (<= 13 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; {35709#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:17:47,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {35709#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35708#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:17:47,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {35708#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~y~0 % 4294967296 > 0); {35693#false} is VALID [2022-04-27 11:17:47,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {35693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {35693#false} is VALID [2022-04-27 11:17:47,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {35693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {35693#false} is VALID [2022-04-27 11:17:47,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {35693#false} assume !(~x~0 % 4294967296 > 0); {35693#false} is VALID [2022-04-27 11:17:47,665 INFO L272 TraceCheckUtils]: 30: Hoare triple {35693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {35693#false} is VALID [2022-04-27 11:17:47,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {35693#false} ~cond := #in~cond; {35693#false} is VALID [2022-04-27 11:17:47,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {35693#false} assume 0 == ~cond; {35693#false} is VALID [2022-04-27 11:17:47,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {35693#false} assume !false; {35693#false} is VALID [2022-04-27 11:17:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:17:47,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:48,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {35693#false} assume !false; {35693#false} is VALID [2022-04-27 11:17:48,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {35693#false} assume 0 == ~cond; {35693#false} is VALID [2022-04-27 11:17:48,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {35693#false} ~cond := #in~cond; {35693#false} is VALID [2022-04-27 11:17:48,109 INFO L272 TraceCheckUtils]: 30: Hoare triple {35693#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {35693#false} is VALID [2022-04-27 11:17:48,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {35693#false} assume !(~x~0 % 4294967296 > 0); {35693#false} is VALID [2022-04-27 11:17:48,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {35693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {35693#false} is VALID [2022-04-27 11:17:48,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {35693#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {35693#false} is VALID [2022-04-27 11:17:48,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {35838#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {35693#false} is VALID [2022-04-27 11:17:48,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {35842#(< 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; {35838#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:17:48,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {35846#(< 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; {35842#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:48,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {35846#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {35846#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:48,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {35846#(< 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; {35846#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:48,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {35846#(< 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; {35846#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:48,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {35846#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {35846#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:48,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {35846#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35846#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:48,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {35842#(< 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; {35846#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:48,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {35838#(< 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; {35842#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:48,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {35871#(< 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; {35838#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:17:48,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {35875#(< 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; {35871#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:17:48,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {35879#(< 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; {35875#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:17:48,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {35883#(< 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; {35879#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:17:48,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {35887#(< 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; {35883#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:17:48,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {35891#(< 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; {35887#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:48,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {35895#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35891#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:17:48,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {35899#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35895#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:48,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {35903#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35899#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:17:48,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {35907#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35903#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:17:48,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {35911#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35907#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:17:48,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {35692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35911#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:17:48,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {35692#true} call #t~ret13 := main(); {35692#true} is VALID [2022-04-27 11:17:48,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35692#true} {35692#true} #72#return; {35692#true} is VALID [2022-04-27 11:17:48,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {35692#true} assume true; {35692#true} is VALID [2022-04-27 11:17:48,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {35692#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35692#true} is VALID [2022-04-27 11:17:48,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {35692#true} call ULTIMATE.init(); {35692#true} is VALID [2022-04-27 11:17:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:17:48,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125539932] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:48,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:48,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 34 [2022-04-27 11:17:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322655935] [2022-04-27 11:17:48,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:48,124 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 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:17:48,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:48,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 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:48,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:48,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 11:17:48,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:48,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 11:17:48,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 11:17:48,177 INFO L87 Difference]: Start difference. First operand 378 states and 540 transitions. Second operand has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 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:57,687 WARN L232 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:19:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:01,732 INFO L93 Difference]: Finished difference Result 1229 states and 1831 transitions. [2022-04-27 11:19:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-27 11:19:01,732 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 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:19:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 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:19:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 256 transitions. [2022-04-27 11:19:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 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:19:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 256 transitions. [2022-04-27 11:19:01,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 256 transitions. [2022-04-27 11:19:06,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:06,128 INFO L225 Difference]: With dead ends: 1229 [2022-04-27 11:19:06,128 INFO L226 Difference]: Without dead ends: 1137 [2022-04-27 11:19:06,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2583 ImplicationChecksByTransitivity, 64.3s TimeCoverageRelationStatistics Valid=2671, Invalid=7631, Unknown=0, NotChecked=0, Total=10302 [2022-04-27 11:19:06,130 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 784 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 609 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 609 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:06,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 138 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [609 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-27 11:19:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-04-27 11:19:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 438. [2022-04-27 11:19:07,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:07,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1137 states. Second operand has 438 states, 433 states have (on average 1.4549653579676673) internal successors, (630), 433 states have internal predecessors, (630), 3 states have call successors, (3), 3 states 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:19:07,513 INFO L74 IsIncluded]: Start isIncluded. First operand 1137 states. Second operand has 438 states, 433 states have (on average 1.4549653579676673) internal successors, (630), 433 states have internal predecessors, (630), 3 states have call successors, (3), 3 states 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:19:07,513 INFO L87 Difference]: Start difference. First operand 1137 states. Second operand has 438 states, 433 states have (on average 1.4549653579676673) internal successors, (630), 433 states have internal predecessors, (630), 3 states have call successors, (3), 3 states 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:19:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:07,565 INFO L93 Difference]: Finished difference Result 1137 states and 1541 transitions. [2022-04-27 11:19:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1541 transitions. [2022-04-27 11:19:07,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:07,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:07,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.4549653579676673) internal successors, (630), 433 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1137 states. [2022-04-27 11:19:07,567 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.4549653579676673) internal successors, (630), 433 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1137 states. [2022-04-27 11:19:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:07,618 INFO L93 Difference]: Finished difference Result 1137 states and 1541 transitions. [2022-04-27 11:19:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1541 transitions. [2022-04-27 11:19:07,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:07,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:07,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:07,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.4549653579676673) internal successors, (630), 433 states have internal predecessors, (630), 3 states have call successors, (3), 3 states 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:19:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 634 transitions. [2022-04-27 11:19:07,631 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 634 transitions. Word has length 34 [2022-04-27 11:19:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:07,631 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 634 transitions. [2022-04-27 11:19:07,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 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:19:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 634 transitions. [2022-04-27 11:19:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:19:07,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:07,632 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:07,636 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:19:07,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:07,835 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash 144704712, now seen corresponding path program 13 times [2022-04-27 11:19:07,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:07,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961098031] [2022-04-27 11:19:07,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:07,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:08,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:08,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {40506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40480#true} is VALID [2022-04-27 11:19:08,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {40480#true} assume true; {40480#true} is VALID [2022-04-27 11:19:08,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40480#true} {40480#true} #72#return; {40480#true} is VALID [2022-04-27 11:19:08,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {40480#true} call ULTIMATE.init(); {40506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:08,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {40506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40480#true} is VALID [2022-04-27 11:19:08,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {40480#true} assume true; {40480#true} is VALID [2022-04-27 11:19:08,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40480#true} {40480#true} #72#return; {40480#true} is VALID [2022-04-27 11:19:08,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {40480#true} call #t~ret13 := main(); {40480#true} is VALID [2022-04-27 11:19:08,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {40480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40485#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:19:08,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {40485#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40486#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~0 2)))} is VALID [2022-04-27 11:19:08,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {40486#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 1)) (<= (+ (* main_~x~0 2) main_~y~0 1) (* main_~n~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; {40487#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 2)))} is VALID [2022-04-27 11:19:08,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {40487#(and (<= (+ (* main_~x~0 2) main_~y~0 2) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) 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; {40488#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} is VALID [2022-04-27 11:19:08,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {40488#(and (<= (+ (* main_~x~0 2) main_~y~0 3) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40489#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~0 2)))} is VALID [2022-04-27 11:19:08,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {40489#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) main_~y~0 4)) (<= (+ (* main_~x~0 2) main_~y~0 4) (* main_~n~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; {40490#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) 5 main_~y~0)) (<= (+ (* main_~x~0 2) 5 main_~y~0) (* main_~n~0 2)))} is VALID [2022-04-27 11:19:08,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {40490#(and (<= (* main_~n~0 2) (+ (* main_~x~0 2) 5 main_~y~0)) (<= (+ (* main_~x~0 2) 5 main_~y~0) (* main_~n~0 2)))} assume !(~x~0 % 4294967296 > 0); {40491#(and (<= (+ 5 main_~y~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ 5 main_~y~0 (* 8589934592 (div main_~x~0 4294967296)))))} is VALID [2022-04-27 11:19:08,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {40491#(and (<= (+ 5 main_~y~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)) (<= (* main_~n~0 2) (+ 5 main_~y~0 (* 8589934592 (div main_~x~0 4294967296)))))} ~z~0 := ~y~0; {40492#(and (<= (* main_~n~0 2) (+ 5 main_~z~0 (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ 5 main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~0 2)))} is VALID [2022-04-27 11:19:08,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {40492#(and (<= (* main_~n~0 2) (+ 5 main_~z~0 (* 8589934592 (div main_~x~0 4294967296)))) (<= (+ 5 main_~z~0 (* 8589934592 (div main_~x~0 4294967296))) (* main_~n~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; {40493#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:08,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {40493#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40494#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:08,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {40494#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40495#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-27 11:19:08,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {40495#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40496#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} is VALID [2022-04-27 11:19:08,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {40496#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) 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; {40497#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} is VALID [2022-04-27 11:19:08,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {40497#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} assume !(~z~0 % 4294967296 > 0); {40497#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} is VALID [2022-04-27 11:19:08,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {40497#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40496#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} is VALID [2022-04-27 11:19:08,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {40496#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40495#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-27 11:19:08,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {40495#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40494#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:08,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {40494#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40493#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:08,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {40493#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40498#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-27 11:19:08,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {40498#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {40498#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-27 11:19:08,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {40498#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40499#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-27 11:19:08,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {40499#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40500#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:08,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {40500#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40501#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} is VALID [2022-04-27 11:19:08,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {40501#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40502#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-27 11:19:08,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {40502#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40503#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:19:08,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {40503#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {40503#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:19:08,385 INFO L272 TraceCheckUtils]: 31: Hoare triple {40503#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {40504#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:19:08,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {40504#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40505#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:19:08,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {40505#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {40481#false} is VALID [2022-04-27 11:19:08,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {40481#false} assume !false; {40481#false} is VALID [2022-04-27 11:19:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:08,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:08,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961098031] [2022-04-27 11:19:08,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961098031] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:08,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180700061] [2022-04-27 11:19:08,387 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:19:08,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:08,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:08,392 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:19:08,393 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:19:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:08,646 WARN L261 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-27 11:19:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:08,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:10,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {40480#true} call ULTIMATE.init(); {40480#true} is VALID [2022-04-27 11:19:10,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {40480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40480#true} is VALID [2022-04-27 11:19:10,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {40480#true} assume true; {40480#true} is VALID [2022-04-27 11:19:10,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40480#true} {40480#true} #72#return; {40480#true} is VALID [2022-04-27 11:19:10,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {40480#true} call #t~ret13 := main(); {40480#true} is VALID [2022-04-27 11:19:10,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {40480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40485#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:19:10,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {40485#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40528#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 11:19:10,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {40528#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40532#(and (= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:19:10,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {40532#(and (= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40536#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} is VALID [2022-04-27 11:19:10,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {40536#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40540#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 4))} is VALID [2022-04-27 11:19:10,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {40540#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40544#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= 5 main_~y~0) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:19:10,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {40544#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= 5 main_~y~0) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {40548#(and (<= (mod main_~x~0 4294967296) 0) (= (+ 5 main_~x~0) main_~n~0) (= 5 main_~y~0))} is VALID [2022-04-27 11:19:10,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {40548#(and (<= (mod main_~x~0 4294967296) 0) (= (+ 5 main_~x~0) main_~n~0) (= 5 main_~y~0))} ~z~0 := ~y~0; {40552#(and (<= (mod main_~x~0 4294967296) 0) (= (+ 5 main_~x~0) main_~n~0) (= 5 main_~z~0))} is VALID [2022-04-27 11:19:10,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {40552#(and (<= (mod main_~x~0 4294967296) 0) (= (+ 5 main_~x~0) main_~n~0) (= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40556#(and (= 5 (+ main_~z~0 1)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:19:10,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {40556#(and (= 5 (+ main_~z~0 1)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40560#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= (+ main_~z~0 1) 4) (= (+ main_~n~0 (- 3)) main_~x~0))} is VALID [2022-04-27 11:19:10,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {40560#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= (+ main_~z~0 1) 4) (= (+ main_~n~0 (- 3)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40564#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= (+ main_~n~0 (- 3)) (+ (- 1) main_~x~0)) (= (+ main_~z~0 2) 4))} is VALID [2022-04-27 11:19:10,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {40564#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= (+ main_~n~0 (- 3)) (+ (- 1) main_~x~0)) (= (+ main_~z~0 2) 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; {40568#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= main_~x~0 (+ (- 1) main_~n~0)) (= (+ main_~z~0 3) 4))} is VALID [2022-04-27 11:19:10,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {40568#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= main_~x~0 (+ (- 1) main_~n~0)) (= (+ main_~z~0 3) 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; {40572#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 4 (+ main_~z~0 4)) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:19:10,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {40572#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 4 (+ main_~z~0 4)) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {40572#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 4 (+ main_~z~0 4)) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:19:10,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {40572#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 4 (+ main_~z~0 4)) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40579#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= (+ main_~z~0 3) 4) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:19:10,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {40579#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= (+ main_~z~0 3) 4) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40583#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)) (= main_~z~0 2))} is VALID [2022-04-27 11:19:10,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {40583#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~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; {40587#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 2 (+ (- 1) main_~z~0)) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:19:10,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {40587#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 2 (+ (- 1) main_~z~0)) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40591#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= main_~z~0 4) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:19:10,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {40591#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= main_~z~0 4) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40595#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 5 main_~z~0) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:19:10,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {40595#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 5 main_~z~0) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {40595#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 5 main_~z~0) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:19:10,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {40595#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 5 main_~z~0) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40602#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 6))} is VALID [2022-04-27 11:19:10,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {40602#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 6))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40606#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 6 (+ (- 1) main_~z~0)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:19:10,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {40606#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 6 (+ (- 1) main_~z~0)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40610#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 6 (+ (- 2) main_~z~0)) (= (+ (- 2) main_~n~0) (+ main_~x~0 1)))} is VALID [2022-04-27 11:19:10,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {40610#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 6 (+ (- 2) main_~z~0)) (= (+ (- 2) main_~n~0) (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40614#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= main_~z~0 9))} is VALID [2022-04-27 11:19:10,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {40614#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= main_~z~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40618#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 9 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:19:10,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {40618#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 9 (+ (- 1) main_~z~0)))} assume !(~x~0 % 4294967296 > 0); {40618#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 9 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:19:10,086 INFO L272 TraceCheckUtils]: 31: Hoare triple {40618#(and (<= (mod (+ 4294967291 main_~n~0) 4294967296) 0) (= 9 (+ (- 1) main_~z~0)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {40625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:19:10,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {40625#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:19:10,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {40629#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40481#false} is VALID [2022-04-27 11:19:10,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {40481#false} assume !false; {40481#false} is VALID [2022-04-27 11:19:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:10,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:10,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {40481#false} assume !false; {40481#false} is VALID [2022-04-27 11:19:10,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {40629#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40481#false} is VALID [2022-04-27 11:19:10,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {40625#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:19:10,991 INFO L272 TraceCheckUtils]: 31: Hoare triple {40503#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {40625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:19:10,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {40503#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {40503#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:19:10,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {40502#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40503#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:19:10,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {40501#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40502#(<= (* main_~n~0 2) (+ (* (div (+ (- 1) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 1))} is VALID [2022-04-27 11:19:10,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {40500#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40501#(<= (* main_~n~0 2) (+ (* (div (+ (- 2) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296) main_~z~0 2))} is VALID [2022-04-27 11:19:10,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {40499#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40500#(<= (* main_~n~0 2) (+ main_~z~0 3 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:10,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {40498#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {40499#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 4)) 4294967296)) main_~z~0 4))} is VALID [2022-04-27 11:19:10,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {40498#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {40498#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-27 11:19:10,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {40493#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40498#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-27 11:19:10,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {40494#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40493#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:11,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {40495#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40494#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:11,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {40496#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40495#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-27 11:19:11,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {40497#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40496#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} is VALID [2022-04-27 11:19:11,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {40497#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} assume !(~z~0 % 4294967296 > 0); {40497#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} is VALID [2022-04-27 11:19:11,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {40496#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) 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; {40497#(<= (* main_~n~0 2) (+ main_~z~0 (* 4294967296 (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 10)) 4294967296)) 10))} is VALID [2022-04-27 11:19:11,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {40495#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40496#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (- 9) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296)) main_~z~0 9))} is VALID [2022-04-27 11:19:11,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {40494#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40495#(<= (* main_~n~0 2) (+ main_~z~0 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-27 11:19:11,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {40493#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40494#(<= (* main_~n~0 2) (+ 7 main_~z~0 (* (div (+ (- 7) (* (- 1) main_~z~0) (* main_~n~0 2)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:11,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {40498#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) 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; {40493#(<= (* main_~n~0 2) (+ main_~z~0 6 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:11,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {40702#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* main_~n~0 2) (- 5) (* (- 1) main_~y~0)) 4294967296)) 5 main_~y~0))} ~z~0 := ~y~0; {40498#(<= (* main_~n~0 2) (+ 5 (* (div (+ (* (- 1) main_~z~0) (* main_~n~0 2) (- 5)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-27 11:19:11,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {40706#(or (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* main_~n~0 2) (- 5) (* (- 1) main_~y~0)) 4294967296)) 5 main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {40702#(<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* main_~n~0 2) (- 5) (* (- 1) main_~y~0)) 4294967296)) 5 main_~y~0))} is VALID [2022-04-27 11:19:11,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {40710#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* main_~n~0 2) (- 6) (* (- 1) main_~y~0)) 4294967296)) main_~y~0 6)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40706#(or (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* main_~n~0 2) (- 5) (* (- 1) main_~y~0)) 4294967296)) 5 main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:11,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {40714#(or (<= (* main_~n~0 2) (+ 7 main_~y~0 (* (div (+ (- 7) (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40710#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= (* main_~n~0 2) (+ (* 4294967296 (div (+ (* main_~n~0 2) (- 6) (* (- 1) main_~y~0)) 4294967296)) main_~y~0 6)))} is VALID [2022-04-27 11:19:11,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {40718#(or (<= (* main_~n~0 2) (+ (* (div (+ (* main_~n~0 2) (* (- 1) main_~y~0) (- 8)) 4294967296) 4294967296) main_~y~0 8)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40714#(or (<= (* main_~n~0 2) (+ 7 main_~y~0 (* (div (+ (- 7) (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:19:11,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {40722#(or (<= (* main_~n~0 2) (+ (* (div (+ (- 9) (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 9)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40718#(or (<= (* main_~n~0 2) (+ (* (div (+ (* main_~n~0 2) (* (- 1) main_~y~0) (- 8)) 4294967296) 4294967296) main_~y~0 8)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:19:11,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {40726#(or (<= (* main_~n~0 2) (+ main_~y~0 (* (div (+ (* main_~n~0 2) (* (- 1) main_~y~0) (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40722#(or (<= (* main_~n~0 2) (+ (* (div (+ (- 9) (* main_~n~0 2) (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 9)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:19:11,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {40480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40726#(or (<= (* main_~n~0 2) (+ main_~y~0 (* (div (+ (* main_~n~0 2) (* (- 1) main_~y~0) (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:19:11,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {40480#true} call #t~ret13 := main(); {40480#true} is VALID [2022-04-27 11:19:11,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40480#true} {40480#true} #72#return; {40480#true} is VALID [2022-04-27 11:19:11,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {40480#true} assume true; {40480#true} is VALID [2022-04-27 11:19:11,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {40480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40480#true} is VALID [2022-04-27 11:19:11,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {40480#true} call ULTIMATE.init(); {40480#true} is VALID [2022-04-27 11:19:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:19:11,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180700061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:11,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:11,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27, 22] total 55 [2022-04-27 11:19:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109920317] [2022-04-27 11:19:11,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:11,018 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 52 states have internal predecessors, (68), 3 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 35 [2022-04-27 11:19:11,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:11,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 52 states have internal predecessors, (68), 3 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:19:11,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:11,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-27 11:19:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-27 11:19:11,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2743, Unknown=0, NotChecked=0, Total=2970 [2022-04-27 11:19:11,118 INFO L87 Difference]: Start difference. First operand 438 states and 634 transitions. Second operand has 55 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 52 states have internal predecessors, (68), 3 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:19:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:18,320 INFO L93 Difference]: Finished difference Result 456 states and 652 transitions. [2022-04-27 11:19:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 11:19:18,320 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 52 states have internal predecessors, (68), 3 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 35 [2022-04-27 11:19:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 52 states have internal predecessors, (68), 3 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:19:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 55 transitions. [2022-04-27 11:19:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 52 states have internal predecessors, (68), 3 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:19:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 55 transitions. [2022-04-27 11:19:18,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 55 transitions. [2022-04-27 11:19:18,429 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:19:18,437 INFO L225 Difference]: With dead ends: 456 [2022-04-27 11:19:18,437 INFO L226 Difference]: Without dead ends: 451 [2022-04-27 11:19:18,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=503, Invalid=6303, Unknown=0, NotChecked=0, Total=6806 [2022-04-27 11:19:18,439 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:18,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 139 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 11:19:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-27 11:19:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 445. [2022-04-27 11:19:19,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:19,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 445 states, 440 states have (on average 1.4477272727272728) internal successors, (637), 440 states have internal predecessors, (637), 3 states have call successors, (3), 3 states 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:19:19,917 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 445 states, 440 states have (on average 1.4477272727272728) internal successors, (637), 440 states have internal predecessors, (637), 3 states have call successors, (3), 3 states 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:19:19,917 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 445 states, 440 states have (on average 1.4477272727272728) internal successors, (637), 440 states have internal predecessors, (637), 3 states have call successors, (3), 3 states 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:19:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:19,927 INFO L93 Difference]: Finished difference Result 451 states and 647 transitions. [2022-04-27 11:19:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 647 transitions. [2022-04-27 11:19:19,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:19,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:19,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 440 states have (on average 1.4477272727272728) internal successors, (637), 440 states have internal predecessors, (637), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 451 states. [2022-04-27 11:19:19,929 INFO L87 Difference]: Start difference. First operand has 445 states, 440 states have (on average 1.4477272727272728) internal successors, (637), 440 states have internal predecessors, (637), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 451 states. [2022-04-27 11:19:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:19,939 INFO L93 Difference]: Finished difference Result 451 states and 647 transitions. [2022-04-27 11:19:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 647 transitions. [2022-04-27 11:19:19,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:19,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:19,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:19,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.4477272727272728) internal successors, (637), 440 states have internal predecessors, (637), 3 states have call successors, (3), 3 states 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:19:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 641 transitions. [2022-04-27 11:19:19,951 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 641 transitions. Word has length 35 [2022-04-27 11:19:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:19,952 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 641 transitions. [2022-04-27 11:19:19,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 52 states have internal predecessors, (68), 3 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:19:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 641 transitions. [2022-04-27 11:19:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:19:19,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:19,953 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:19,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-27 11:19:20,157 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,SelfDestructingSolverStorable27 [2022-04-27 11:19:20,158 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1143532120, now seen corresponding path program 9 times [2022-04-27 11:19:20,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:20,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333314373] [2022-04-27 11:19:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:20,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:20,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:20,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {42975#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42956#true} is VALID [2022-04-27 11:19:20,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {42956#true} assume true; {42956#true} is VALID [2022-04-27 11:19:20,423 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42956#true} {42956#true} #72#return; {42956#true} is VALID [2022-04-27 11:19:20,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {42956#true} call ULTIMATE.init(); {42975#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:20,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {42975#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42956#true} is VALID [2022-04-27 11:19:20,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {42956#true} assume true; {42956#true} is VALID [2022-04-27 11:19:20,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42956#true} {42956#true} #72#return; {42956#true} is VALID [2022-04-27 11:19:20,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {42956#true} call #t~ret13 := main(); {42956#true} is VALID [2022-04-27 11:19:20,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {42956#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42961#(= main_~y~0 0)} is VALID [2022-04-27 11:19:20,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {42961#(= 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; {42962#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:20,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {42962#(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; {42963#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:20,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {42963#(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; {42964#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:20,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {42964#(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; {42965#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:20,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {42965#(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; {42966#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:20,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {42966#(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; {42967#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:20,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {42967#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {42967#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:20,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {42967#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {42968#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:19:20,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {42968#(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; {42969#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:19:20,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {42969#(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; {42970#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:19:20,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {42970#(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; {42971#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:19:20,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {42971#(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; {42972#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:19:20,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {42972#(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; {42973#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:19:20,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {42973#(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; {42974#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:19:20,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {42974#(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; {42957#false} is VALID [2022-04-27 11:19:20,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {42957#false} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42957#false} is VALID [2022-04-27 11:19:20,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {42957#false} assume !(~z~0 % 4294967296 > 0); {42957#false} is VALID [2022-04-27 11:19:20,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:20,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {42957#false} assume !(~y~0 % 4294967296 > 0); {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {42957#false} assume !(~x~0 % 4294967296 > 0); {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L272 TraceCheckUtils]: 31: Hoare triple {42957#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {42957#false} ~cond := #in~cond; {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {42957#false} assume 0 == ~cond; {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {42957#false} assume !false; {42957#false} is VALID [2022-04-27 11:19:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:19:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:20,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333314373] [2022-04-27 11:19:20,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333314373] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:20,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719434462] [2022-04-27 11:19:20,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:19:20,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:20,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:20,440 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:19:20,461 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:19:20,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-27 11:19:20,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:20,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 11:19:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:20,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:20,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {42956#true} call ULTIMATE.init(); {42956#true} is VALID [2022-04-27 11:19:20,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {42956#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42956#true} is VALID [2022-04-27 11:19:20,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {42956#true} assume true; {42956#true} is VALID [2022-04-27 11:19:20,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42956#true} {42956#true} #72#return; {42956#true} is VALID [2022-04-27 11:19:20,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {42956#true} call #t~ret13 := main(); {42956#true} is VALID [2022-04-27 11:19:20,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {42956#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42961#(= main_~y~0 0)} is VALID [2022-04-27 11:19:20,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {42961#(= 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; {42962#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:20,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {42962#(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; {42963#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:20,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {42963#(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; {42964#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:20,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {42964#(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; {42965#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:20,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {42965#(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; {42966#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:20,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {42966#(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; {42967#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:20,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {42967#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {42967#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:20,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {42967#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {43018#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:20,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {43018#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43022#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:19:20,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {43022#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43026#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:20,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {43026#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43030#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:20,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {43030#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43034#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:20,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {43034#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43038#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:21,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {43038#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43042#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:21,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {43042#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42957#false} is VALID [2022-04-27 11:19:21,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {42957#false} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {42957#false} assume !(~z~0 % 4294967296 > 0); {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {42957#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {42957#false} assume !(~y~0 % 4294967296 > 0); {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {42957#false} assume !(~x~0 % 4294967296 > 0); {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L272 TraceCheckUtils]: 31: Hoare triple {42957#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {42957#false} ~cond := #in~cond; {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {42957#false} assume 0 == ~cond; {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {42957#false} assume !false; {42957#false} is VALID [2022-04-27 11:19:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:19:21,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:21,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {42957#false} assume !false; {42957#false} is VALID [2022-04-27 11:19:21,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {42957#false} assume 0 == ~cond; {42957#false} is VALID [2022-04-27 11:19:21,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {42957#false} ~cond := #in~cond; {42957#false} is VALID [2022-04-27 11:19:21,463 INFO L272 TraceCheckUtils]: 31: Hoare triple {42957#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {42957#false} is VALID [2022-04-27 11:19:21,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {42957#false} assume !(~x~0 % 4294967296 > 0); {42957#false} is VALID [2022-04-27 11:19:21,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {43103#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42957#false} is VALID [2022-04-27 11:19:21,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {43107#(< 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; {43103#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:19:21,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {43111#(< 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; {43107#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:19:21,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {43115#(< 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; {43111#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:19:21,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {43119#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43115#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:19:21,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {43123#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43119#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:21,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {43127#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43123#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:21,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {43127#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {43127#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:21,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {43127#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43127#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:21,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {43137#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43127#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:21,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {43141#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43137#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:19:21,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {43145#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43141#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:19:21,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {43149#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43145#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:19:21,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {43153#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43149#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:19:21,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {43157#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43153#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:19:21,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {43161#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43157#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {42956#true} ~z~0 := ~y~0; {43161#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {42956#true} assume !(~x~0 % 4294967296 > 0); {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {42956#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {42956#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {42956#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {42956#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {42956#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {42956#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {42956#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {42956#true} call #t~ret13 := main(); {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42956#true} {42956#true} #72#return; {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {42956#true} assume true; {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {42956#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {42956#true} is VALID [2022-04-27 11:19:21,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {42956#true} call ULTIMATE.init(); {42956#true} is VALID [2022-04-27 11:19:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:19:21,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719434462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:21,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:21,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 38 [2022-04-27 11:19:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893131525] [2022-04-27 11:19:21,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:21,476 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 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:19:21,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:21,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 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:19:21,528 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:19:21,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 11:19:21,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:21,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 11:19:21,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:19:21,529 INFO L87 Difference]: Start difference. First operand 445 states and 641 transitions. Second operand has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 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:19:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:30,894 INFO L93 Difference]: Finished difference Result 817 states and 1037 transitions. [2022-04-27 11:19:30,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-27 11:19:30,894 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 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:19:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 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:19:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 156 transitions. [2022-04-27 11:19:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 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:19:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 156 transitions. [2022-04-27 11:19:30,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 156 transitions. [2022-04-27 11:19:31,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:31,330 INFO L225 Difference]: With dead ends: 817 [2022-04-27 11:19:31,330 INFO L226 Difference]: Without dead ends: 758 [2022-04-27 11:19:31,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3198 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1890, Invalid=8616, Unknown=0, NotChecked=0, Total=10506 [2022-04-27 11:19:31,332 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 406 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:31,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 115 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 11:19:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-04-27 11:19:32,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 449. [2022-04-27 11:19:32,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:32,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 758 states. Second operand has 449 states, 444 states have (on average 1.436936936936937) internal successors, (638), 444 states have internal predecessors, (638), 3 states have call successors, (3), 3 states 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:19:32,835 INFO L74 IsIncluded]: Start isIncluded. First operand 758 states. Second operand has 449 states, 444 states have (on average 1.436936936936937) internal successors, (638), 444 states have internal predecessors, (638), 3 states have call successors, (3), 3 states 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:19:32,835 INFO L87 Difference]: Start difference. First operand 758 states. Second operand has 449 states, 444 states have (on average 1.436936936936937) internal successors, (638), 444 states have internal predecessors, (638), 3 states have call successors, (3), 3 states 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:19:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:32,849 INFO L93 Difference]: Finished difference Result 758 states and 952 transitions. [2022-04-27 11:19:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 952 transitions. [2022-04-27 11:19:32,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:32,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:32,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 449 states, 444 states have (on average 1.436936936936937) internal successors, (638), 444 states have internal predecessors, (638), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 758 states. [2022-04-27 11:19:32,851 INFO L87 Difference]: Start difference. First operand has 449 states, 444 states have (on average 1.436936936936937) internal successors, (638), 444 states have internal predecessors, (638), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 758 states. [2022-04-27 11:19:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:32,866 INFO L93 Difference]: Finished difference Result 758 states and 952 transitions. [2022-04-27 11:19:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 952 transitions. [2022-04-27 11:19:32,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:32,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:32,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:32,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 444 states have (on average 1.436936936936937) internal successors, (638), 444 states have internal predecessors, (638), 3 states have call successors, (3), 3 states 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:19:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 642 transitions. [2022-04-27 11:19:32,875 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 642 transitions. Word has length 35 [2022-04-27 11:19:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:32,875 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 642 transitions. [2022-04-27 11:19:32,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 37 states have internal predecessors, (55), 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:19:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 642 transitions. [2022-04-27 11:19:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:19:32,875 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:32,876 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:32,880 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:19:33,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-27 11:19:33,076 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:33,077 INFO L85 PathProgramCache]: Analyzing trace with hash 382085168, now seen corresponding path program 10 times [2022-04-27 11:19:33,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:33,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291601666] [2022-04-27 11:19:33,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:33,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:33,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {46492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46473#true} is VALID [2022-04-27 11:19:33,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {46473#true} assume true; {46473#true} is VALID [2022-04-27 11:19:33,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46473#true} {46473#true} #72#return; {46473#true} is VALID [2022-04-27 11:19:33,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {46473#true} call ULTIMATE.init(); {46492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:33,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {46492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46473#true} is VALID [2022-04-27 11:19:33,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {46473#true} assume true; {46473#true} is VALID [2022-04-27 11:19:33,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46473#true} {46473#true} #72#return; {46473#true} is VALID [2022-04-27 11:19:33,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {46473#true} call #t~ret13 := main(); {46473#true} is VALID [2022-04-27 11:19:33,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {46473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46473#true} is VALID [2022-04-27 11:19:33,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {46473#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46478#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:19:33,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {46478#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46479#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:19:33,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {46479#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46480#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:19:33,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {46480#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46481#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:19:33,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {46481#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46482#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:19:33,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {46482#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46483#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:19:33,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {46483#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46484#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:19:33,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {46484#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {46484#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:19:33,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {46484#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {46484#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:19:33,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {46484#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46485#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:19:33,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {46485#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46486#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:19:33,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {46486#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46487#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} is VALID [2022-04-27 11:19:33,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {46487#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46488#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} is VALID [2022-04-27 11:19:33,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {46488#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46489#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:19:33,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {46489#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46490#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:19:33,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {46490#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:19:33,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:19:33,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:19:33,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:19:33,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:19:33,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:19:33,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:19:33,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:19:33,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:19:33,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:19:33,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {46491#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {46474#false} is VALID [2022-04-27 11:19:33,372 INFO L272 TraceCheckUtils]: 32: Hoare triple {46474#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {46474#false} is VALID [2022-04-27 11:19:33,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {46474#false} ~cond := #in~cond; {46474#false} is VALID [2022-04-27 11:19:33,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {46474#false} assume 0 == ~cond; {46474#false} is VALID [2022-04-27 11:19:33,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {46474#false} assume !false; {46474#false} is VALID [2022-04-27 11:19:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:19:33,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:33,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291601666] [2022-04-27 11:19:33,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291601666] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:33,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135681784] [2022-04-27 11:19:33,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:19:33,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:33,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:33,375 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:19:33,376 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:19:33,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:19:33,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:33,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 11:19:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:33,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:33,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {46473#true} call ULTIMATE.init(); {46473#true} is VALID [2022-04-27 11:19:33,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {46473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46473#true} is VALID [2022-04-27 11:19:33,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {46473#true} assume true; {46473#true} is VALID [2022-04-27 11:19:33,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46473#true} {46473#true} #72#return; {46473#true} is VALID [2022-04-27 11:19:33,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {46473#true} call #t~ret13 := main(); {46473#true} is VALID [2022-04-27 11:19:33,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {46473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46473#true} is VALID [2022-04-27 11:19:33,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {46473#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46478#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:19:33,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {46478#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46517#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:19:33,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {46517#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46521#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {46521#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46525#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:19:33,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {46525#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46529#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {46529#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46533#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:19:33,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {46533#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:19:33,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:19:33,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} ~z~0 := ~y~0; {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:19:33,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46533#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:19:33,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {46533#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46529#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {46529#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46525#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:19:33,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {46525#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46521#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {46521#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46517#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:19:33,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {46517#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46478#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:19:33,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {46478#(<= 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; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:33,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {46474#false} is VALID [2022-04-27 11:19:33,826 INFO L272 TraceCheckUtils]: 32: Hoare triple {46474#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {46474#false} is VALID [2022-04-27 11:19:33,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {46474#false} ~cond := #in~cond; {46474#false} is VALID [2022-04-27 11:19:33,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {46474#false} assume 0 == ~cond; {46474#false} is VALID [2022-04-27 11:19:33,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {46474#false} assume !false; {46474#false} is VALID [2022-04-27 11:19:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:19:33,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:34,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {46474#false} assume !false; {46474#false} is VALID [2022-04-27 11:19:34,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {46474#false} assume 0 == ~cond; {46474#false} is VALID [2022-04-27 11:19:34,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {46474#false} ~cond := #in~cond; {46474#false} is VALID [2022-04-27 11:19:34,112 INFO L272 TraceCheckUtils]: 32: Hoare triple {46474#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {46474#false} is VALID [2022-04-27 11:19:34,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {46474#false} is VALID [2022-04-27 11:19:34,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {46478#(<= 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; {46565#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {46517#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46478#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:19:34,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {46521#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46517#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:19:34,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {46525#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46521#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {46529#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46525#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:19:34,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {46533#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46529#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46533#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:19:34,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} ~z~0 := ~y~0; {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:19:34,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:19:34,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {46533#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46537#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-27 11:19:34,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {46529#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46533#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:19:34,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {46525#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46529#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {46521#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46525#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:19:34,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {46517#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46521#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:34,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {46478#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46517#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:19:34,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {46473#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46478#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:19:34,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {46473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46473#true} is VALID [2022-04-27 11:19:34,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {46473#true} call #t~ret13 := main(); {46473#true} is VALID [2022-04-27 11:19:34,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46473#true} {46473#true} #72#return; {46473#true} is VALID [2022-04-27 11:19:34,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {46473#true} assume true; {46473#true} is VALID [2022-04-27 11:19:34,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {46473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46473#true} is VALID [2022-04-27 11:19:34,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {46473#true} call ULTIMATE.init(); {46473#true} is VALID [2022-04-27 11:19:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:19:34,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135681784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:34,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:34,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 24 [2022-04-27 11:19:34,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838452604] [2022-04-27 11:19:34,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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 36 [2022-04-27 11:19:34,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:34,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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:19:34,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:34,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 11:19:34,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:34,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 11:19:34,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:19:34,176 INFO L87 Difference]: Start difference. First operand 449 states and 642 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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:19:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:36,961 INFO L93 Difference]: Finished difference Result 471 states and 672 transitions. [2022-04-27 11:19:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 11:19:36,961 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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 36 [2022-04-27 11:19:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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:19:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 89 transitions. [2022-04-27 11:19:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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:19:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 89 transitions. [2022-04-27 11:19:36,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 89 transitions. [2022-04-27 11:19:37,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:37,067 INFO L225 Difference]: With dead ends: 471 [2022-04-27 11:19:37,067 INFO L226 Difference]: Without dead ends: 466 [2022-04-27 11:19:37,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:19:37,068 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 116 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:37,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 83 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:19:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-04-27 11:19:38,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 439. [2022-04-27 11:19:38,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:38,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 466 states. Second operand has 439 states, 434 states have (on average 1.4377880184331797) internal successors, (624), 434 states have internal predecessors, (624), 3 states have call successors, (3), 3 states 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:19:38,632 INFO L74 IsIncluded]: Start isIncluded. First operand 466 states. Second operand has 439 states, 434 states have (on average 1.4377880184331797) internal successors, (624), 434 states have internal predecessors, (624), 3 states have call successors, (3), 3 states 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:19:38,632 INFO L87 Difference]: Start difference. First operand 466 states. Second operand has 439 states, 434 states have (on average 1.4377880184331797) internal successors, (624), 434 states have internal predecessors, (624), 3 states have call successors, (3), 3 states 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:19:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:38,641 INFO L93 Difference]: Finished difference Result 466 states and 664 transitions. [2022-04-27 11:19:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 664 transitions. [2022-04-27 11:19:38,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:38,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:38,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 439 states, 434 states have (on average 1.4377880184331797) internal successors, (624), 434 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 466 states. [2022-04-27 11:19:38,643 INFO L87 Difference]: Start difference. First operand has 439 states, 434 states have (on average 1.4377880184331797) internal successors, (624), 434 states have internal predecessors, (624), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 466 states. [2022-04-27 11:19:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:38,651 INFO L93 Difference]: Finished difference Result 466 states and 664 transitions. [2022-04-27 11:19:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 664 transitions. [2022-04-27 11:19:38,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:38,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:38,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:38,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 434 states have (on average 1.4377880184331797) internal successors, (624), 434 states have internal predecessors, (624), 3 states have call successors, (3), 3 states 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:19:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 628 transitions. [2022-04-27 11:19:38,659 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 628 transitions. Word has length 36 [2022-04-27 11:19:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:38,659 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 628 transitions. [2022-04-27 11:19:38,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 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:19:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 628 transitions. [2022-04-27 11:19:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 11:19:38,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:38,660 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:38,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-27 11:19:38,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:38,863 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:38,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1568849464, now seen corresponding path program 14 times [2022-04-27 11:19:38,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:38,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527809928] [2022-04-27 11:19:38,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:39,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {48938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48927#true} is VALID [2022-04-27 11:19:39,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {48927#true} assume true; {48927#true} is VALID [2022-04-27 11:19:39,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48927#true} {48927#true} #72#return; {48927#true} is VALID [2022-04-27 11:19:39,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {48927#true} call ULTIMATE.init(); {48938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:39,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {48938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48927#true} is VALID [2022-04-27 11:19:39,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {48927#true} assume true; {48927#true} is VALID [2022-04-27 11:19:39,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48927#true} {48927#true} #72#return; {48927#true} is VALID [2022-04-27 11:19:39,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {48927#true} call #t~ret13 := main(); {48927#true} is VALID [2022-04-27 11:19:39,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {48927#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48927#true} is VALID [2022-04-27 11:19:39,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {48927#true} assume !(~x~0 % 4294967296 > 0); {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:39,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:39,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {48932#(<= 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; {48933#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:39,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {48933#(<= 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; {48934#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {48934#(<= 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; {48935#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {48935#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48935#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {48935#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48934#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {48934#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48933#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:39,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {48933#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:39,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {48932#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48928#false} is VALID [2022-04-27 11:19:39,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {48928#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48928#false} is VALID [2022-04-27 11:19:39,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {48928#false} assume !(~x~0 % 4294967296 > 0); {48928#false} is VALID [2022-04-27 11:19:39,040 INFO L272 TraceCheckUtils]: 33: Hoare triple {48928#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {48928#false} is VALID [2022-04-27 11:19:39,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {48928#false} ~cond := #in~cond; {48928#false} is VALID [2022-04-27 11:19:39,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {48928#false} assume 0 == ~cond; {48928#false} is VALID [2022-04-27 11:19:39,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {48928#false} assume !false; {48928#false} is VALID [2022-04-27 11:19:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-27 11:19:39,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:39,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527809928] [2022-04-27 11:19:39,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527809928] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:39,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118692566] [2022-04-27 11:19:39,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:19:39,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:39,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:39,042 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:19:39,053 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:19:39,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:19:39,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:39,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:19:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:39,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:39,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {48927#true} call ULTIMATE.init(); {48927#true} is VALID [2022-04-27 11:19:39,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {48927#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48927#true} is VALID [2022-04-27 11:19:39,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {48927#true} assume true; {48927#true} is VALID [2022-04-27 11:19:39,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48927#true} {48927#true} #72#return; {48927#true} is VALID [2022-04-27 11:19:39,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {48927#true} call #t~ret13 := main(); {48927#true} is VALID [2022-04-27 11:19:39,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {48927#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48927#true} is VALID [2022-04-27 11:19:39,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {48927#true} assume !(~x~0 % 4294967296 > 0); {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:39,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:39,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {48932#(<= 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; {48933#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:39,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {48933#(<= 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; {48934#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {48934#(<= 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; {48935#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {48935#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48935#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {48935#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48934#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {48934#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48933#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:39,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {48933#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:39,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {48932#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48928#false} is VALID [2022-04-27 11:19:39,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {48928#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48928#false} is VALID [2022-04-27 11:19:39,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {48928#false} assume !(~x~0 % 4294967296 > 0); {48928#false} is VALID [2022-04-27 11:19:39,395 INFO L272 TraceCheckUtils]: 33: Hoare triple {48928#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {48928#false} is VALID [2022-04-27 11:19:39,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {48928#false} ~cond := #in~cond; {48928#false} is VALID [2022-04-27 11:19:39,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {48928#false} assume 0 == ~cond; {48928#false} is VALID [2022-04-27 11:19:39,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {48928#false} assume !false; {48928#false} is VALID [2022-04-27 11:19:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-27 11:19:39,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:39,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {48928#false} assume !false; {48928#false} is VALID [2022-04-27 11:19:39,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {48928#false} assume 0 == ~cond; {48928#false} is VALID [2022-04-27 11:19:39,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {48928#false} ~cond := #in~cond; {48928#false} is VALID [2022-04-27 11:19:39,658 INFO L272 TraceCheckUtils]: 33: Hoare triple {48928#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {48928#false} is VALID [2022-04-27 11:19:39,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {48928#false} assume !(~x~0 % 4294967296 > 0); {48928#false} is VALID [2022-04-27 11:19:39,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {48928#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48928#false} is VALID [2022-04-27 11:19:39,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {48932#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48928#false} is VALID [2022-04-27 11:19:39,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {48933#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:39,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {48934#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48933#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:39,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {48935#(<= 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 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48934#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48935#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48937#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:39,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {48935#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48936#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {48934#(<= 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; {48935#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {48933#(<= 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; {48934#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:39,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {48932#(<= 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; {48933#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:39,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:39,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {48927#true} assume !(~x~0 % 4294967296 > 0); {48932#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:39,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {48927#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {48927#true} is VALID [2022-04-27 11:19:39,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {48927#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48927#true} is VALID [2022-04-27 11:19:39,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {48927#true} call #t~ret13 := main(); {48927#true} is VALID [2022-04-27 11:19:39,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48927#true} {48927#true} #72#return; {48927#true} is VALID [2022-04-27 11:19:39,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {48927#true} assume true; {48927#true} is VALID [2022-04-27 11:19:39,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {48927#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48927#true} is VALID [2022-04-27 11:19:39,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {48927#true} call ULTIMATE.init(); {48927#true} is VALID [2022-04-27 11:19:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-27 11:19:39,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118692566] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:39,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:39,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 9 [2022-04-27 11:19:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255224973] [2022-04-27 11:19:39,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:39,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:19:39,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:39,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:19:39,697 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:19:39,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:19:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:19:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:19:39,698 INFO L87 Difference]: Start difference. First operand 439 states and 628 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:19:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:41,751 INFO L93 Difference]: Finished difference Result 461 states and 652 transitions. [2022-04-27 11:19:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:19:41,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:19:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:19:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-27 11:19:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:19:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-27 11:19:41,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-27 11:19:41,801 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:19:41,808 INFO L225 Difference]: With dead ends: 461 [2022-04-27 11:19:41,808 INFO L226 Difference]: Without dead ends: 434 [2022-04-27 11:19:41,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:19:41,809 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:41,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 63 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:19:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-27 11:19:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 425. [2022-04-27 11:19:43,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:43,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand has 425 states, 420 states have (on average 1.45) internal successors, (609), 420 states have internal predecessors, (609), 3 states have call successors, (3), 3 states 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:19:43,286 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand has 425 states, 420 states have (on average 1.45) internal successors, (609), 420 states have internal predecessors, (609), 3 states have call successors, (3), 3 states 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:19:43,286 INFO L87 Difference]: Start difference. First operand 434 states. Second operand has 425 states, 420 states have (on average 1.45) internal successors, (609), 420 states have internal predecessors, (609), 3 states have call successors, (3), 3 states 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:19:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:43,292 INFO L93 Difference]: Finished difference Result 434 states and 622 transitions. [2022-04-27 11:19:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 622 transitions. [2022-04-27 11:19:43,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:43,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:43,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 420 states have (on average 1.45) internal successors, (609), 420 states have internal predecessors, (609), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 434 states. [2022-04-27 11:19:43,293 INFO L87 Difference]: Start difference. First operand has 425 states, 420 states have (on average 1.45) internal successors, (609), 420 states have internal predecessors, (609), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 434 states. [2022-04-27 11:19:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:43,300 INFO L93 Difference]: Finished difference Result 434 states and 622 transitions. [2022-04-27 11:19:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 622 transitions. [2022-04-27 11:19:43,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:43,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:43,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:43,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 1.45) internal successors, (609), 420 states have internal predecessors, (609), 3 states have call successors, (3), 3 states 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:19:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 613 transitions. [2022-04-27 11:19:43,312 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 613 transitions. Word has length 37 [2022-04-27 11:19:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:43,312 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 613 transitions. [2022-04-27 11:19:43,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:19:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 613 transitions. [2022-04-27 11:19:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 11:19:43,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:43,313 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:43,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-27 11:19:43,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:43,519 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1873101146, now seen corresponding path program 15 times [2022-04-27 11:19:43,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:43,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094008466] [2022-04-27 11:19:43,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:43,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:43,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {51280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51262#true} is VALID [2022-04-27 11:19:43,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {51262#true} assume true; {51262#true} is VALID [2022-04-27 11:19:43,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51262#true} {51262#true} #72#return; {51262#true} is VALID [2022-04-27 11:19:43,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {51262#true} call ULTIMATE.init(); {51280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:43,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {51280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51262#true} is VALID [2022-04-27 11:19:43,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {51262#true} assume true; {51262#true} is VALID [2022-04-27 11:19:43,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51262#true} {51262#true} #72#return; {51262#true} is VALID [2022-04-27 11:19:43,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {51262#true} call #t~ret13 := main(); {51262#true} is VALID [2022-04-27 11:19:43,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {51262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51267#(= main_~y~0 0)} is VALID [2022-04-27 11:19:43,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {51267#(= 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; {51268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:43,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {51268#(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; {51269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:43,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {51269#(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; {51270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:43,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {51270#(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; {51271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:43,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {51271#(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; {51272#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:43,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {51272#(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; {51273#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:43,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {51273#(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; {51274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:43,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {51274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {51274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:43,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {51274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {51275#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:19:43,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {51275#(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; {51276#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:19:43,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {51276#(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; {51277#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:19:43,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {51277#(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; {51278#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:19:43,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {51278#(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; {51279#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {51279#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {51263#false} assume !(~y~0 % 4294967296 > 0); {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {51263#false} assume !(~x~0 % 4294967296 > 0); {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L272 TraceCheckUtils]: 33: Hoare triple {51263#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {51263#false} ~cond := #in~cond; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {51263#false} assume 0 == ~cond; {51263#false} is VALID [2022-04-27 11:19:43,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {51263#false} assume !false; {51263#false} is VALID [2022-04-27 11:19:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 11:19:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:43,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094008466] [2022-04-27 11:19:43,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094008466] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:43,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62545120] [2022-04-27 11:19:43,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:19:43,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:43,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:43,752 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:19:43,776 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:19:43,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-27 11:19:43,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:43,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 11:19:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:43,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:44,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {51262#true} call ULTIMATE.init(); {51262#true} is VALID [2022-04-27 11:19:44,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {51262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51262#true} is VALID [2022-04-27 11:19:44,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {51262#true} assume true; {51262#true} is VALID [2022-04-27 11:19:44,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51262#true} {51262#true} #72#return; {51262#true} is VALID [2022-04-27 11:19:44,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {51262#true} call #t~ret13 := main(); {51262#true} is VALID [2022-04-27 11:19:44,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {51262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51267#(= main_~y~0 0)} is VALID [2022-04-27 11:19:44,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {51267#(= 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; {51268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:44,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {51268#(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; {51269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:44,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {51269#(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; {51270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:44,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {51270#(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; {51271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:44,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {51271#(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; {51272#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:44,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {51272#(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; {51273#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:44,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {51273#(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; {51274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:44,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {51274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {51274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:44,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {51274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {51326#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:44,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {51326#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51330#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:19:44,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {51330#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51334#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:44,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {51334#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51338#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:44,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {51338#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51342#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {51342#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {51263#false} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {51263#false} assume !(~y~0 % 4294967296 > 0); {51263#false} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:44,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:44,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:44,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:44,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {51263#false} assume !(~x~0 % 4294967296 > 0); {51263#false} is VALID [2022-04-27 11:19:44,208 INFO L272 TraceCheckUtils]: 33: Hoare triple {51263#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {51263#false} is VALID [2022-04-27 11:19:44,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {51263#false} ~cond := #in~cond; {51263#false} is VALID [2022-04-27 11:19:44,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {51263#false} assume 0 == ~cond; {51263#false} is VALID [2022-04-27 11:19:44,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {51263#false} assume !false; {51263#false} is VALID [2022-04-27 11:19:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 11:19:44,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:44,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {51263#false} assume !false; {51263#false} is VALID [2022-04-27 11:19:44,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {51263#false} assume 0 == ~cond; {51263#false} is VALID [2022-04-27 11:19:44,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {51263#false} ~cond := #in~cond; {51263#false} is VALID [2022-04-27 11:19:44,528 INFO L272 TraceCheckUtils]: 33: Hoare triple {51263#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {51263#false} is VALID [2022-04-27 11:19:44,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {51263#false} assume !(~x~0 % 4294967296 > 0); {51263#false} is VALID [2022-04-27 11:19:44,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:44,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:44,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:44,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {51263#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {51263#false} is VALID [2022-04-27 11:19:44,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {51263#false} assume !(~y~0 % 4294967296 > 0); {51263#false} is VALID [2022-04-27 11:19:44,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:44,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {51263#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51263#false} is VALID [2022-04-27 11:19:44,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {51433#(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; {51263#false} is VALID [2022-04-27 11:19:44,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {51437#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51433#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:19:44,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {51441#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51437#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:19:44,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {51445#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51441#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:19:44,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {51449#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51445#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:19:44,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {51453#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {51449#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:19:44,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {51457#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51453#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:19:44,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {51461#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51457#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:19:44,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {51465#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51461#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:19:44,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {51469#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51465#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:19:44,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {51262#true} ~z~0 := ~y~0; {51469#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:19:44,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {51262#true} assume !(~x~0 % 4294967296 > 0); {51262#true} is VALID [2022-04-27 11:19:44,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {51262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {51262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {51262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {51262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {51262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {51262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {51262#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {51262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {51262#true} call #t~ret13 := main(); {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51262#true} {51262#true} #72#return; {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {51262#true} assume true; {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {51262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {51262#true} call ULTIMATE.init(); {51262#true} is VALID [2022-04-27 11:19:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-27 11:19:44,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62545120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:44,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:44,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 12] total 31 [2022-04-27 11:19:44,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926824150] [2022-04-27 11:19:44,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:44,538 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 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 37 [2022-04-27 11:19:44,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:44,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 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:19:44,575 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:19:44,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 11:19:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:44,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 11:19:44,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:19:44,576 INFO L87 Difference]: Start difference. First operand 425 states and 613 transitions. Second operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 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:19:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:50,232 INFO L93 Difference]: Finished difference Result 602 states and 814 transitions. [2022-04-27 11:19:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-27 11:19:50,232 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 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 37 [2022-04-27 11:19:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 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:19:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 111 transitions. [2022-04-27 11:19:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 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:19:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 111 transitions. [2022-04-27 11:19:50,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 111 transitions. [2022-04-27 11:19:50,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:50,369 INFO L225 Difference]: With dead ends: 602 [2022-04-27 11:19:50,369 INFO L226 Difference]: Without dead ends: 499 [2022-04-27 11:19:50,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=638, Invalid=5062, Unknown=0, NotChecked=0, Total=5700 [2022-04-27 11:19:50,370 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:50,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 120 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 11:19:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-27 11:19:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 402. [2022-04-27 11:19:51,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:51,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 402 states, 397 states have (on average 1.4256926952141058) internal successors, (566), 397 states have internal predecessors, (566), 3 states have call successors, (3), 3 states 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:19:51,869 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 402 states, 397 states have (on average 1.4256926952141058) internal successors, (566), 397 states have internal predecessors, (566), 3 states have call successors, (3), 3 states 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:19:51,869 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 402 states, 397 states have (on average 1.4256926952141058) internal successors, (566), 397 states have internal predecessors, (566), 3 states have call successors, (3), 3 states 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:19:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:51,877 INFO L93 Difference]: Finished difference Result 499 states and 680 transitions. [2022-04-27 11:19:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 680 transitions. [2022-04-27 11:19:51,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:51,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:51,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 402 states, 397 states have (on average 1.4256926952141058) internal successors, (566), 397 states have internal predecessors, (566), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 499 states. [2022-04-27 11:19:51,878 INFO L87 Difference]: Start difference. First operand has 402 states, 397 states have (on average 1.4256926952141058) internal successors, (566), 397 states have internal predecessors, (566), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 499 states. [2022-04-27 11:19:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:51,886 INFO L93 Difference]: Finished difference Result 499 states and 680 transitions. [2022-04-27 11:19:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 680 transitions. [2022-04-27 11:19:51,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:51,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:51,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:51,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 397 states have (on average 1.4256926952141058) internal successors, (566), 397 states have internal predecessors, (566), 3 states have call successors, (3), 3 states 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:19:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 570 transitions. [2022-04-27 11:19:51,893 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 570 transitions. Word has length 37 [2022-04-27 11:19:51,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:51,894 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 570 transitions. [2022-04-27 11:19:51,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 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:19:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 570 transitions. [2022-04-27 11:19:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 11:19:51,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:51,894 INFO L195 NwaCegarLoop]: trace histogram [14, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:51,899 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:19:52,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:52,095 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1056472625, now seen corresponding path program 16 times [2022-04-27 11:19:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:52,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072098130] [2022-04-27 11:19:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:52,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:52,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {53974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53950#true} is VALID [2022-04-27 11:19:52,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {53950#true} assume true; {53950#true} is VALID [2022-04-27 11:19:52,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53950#true} {53950#true} #72#return; {53950#true} is VALID [2022-04-27 11:19:52,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {53950#true} call ULTIMATE.init(); {53974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:52,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {53974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53950#true} is VALID [2022-04-27 11:19:52,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {53950#true} assume true; {53950#true} is VALID [2022-04-27 11:19:52,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53950#true} {53950#true} #72#return; {53950#true} is VALID [2022-04-27 11:19:52,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {53950#true} call #t~ret13 := main(); {53950#true} is VALID [2022-04-27 11:19:52,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {53950#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53955#(= main_~y~0 0)} is VALID [2022-04-27 11:19:52,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {53955#(= 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; {53956#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:52,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {53956#(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; {53957#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:52,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {53957#(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; {53958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:52,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {53958#(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; {53959#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:52,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {53959#(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; {53960#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:52,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {53960#(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; {53961#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:52,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {53961#(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; {53962#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:52,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {53962#(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; {53963#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:19:52,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {53963#(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; {53964#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:19:52,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {53964#(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; {53965#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:19:52,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {53965#(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; {53966#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:52,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {53966#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53967#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:19:52,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {53967#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53968#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:19:52,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {53968#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:19:52,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {53969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {53969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:19:52,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {53969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {53970#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:19:52,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {53970#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53971#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:19:52,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {53971#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53972#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:19:52,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {53972#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53973#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-27 11:19:52,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {53973#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {53951#false} is VALID [2022-04-27 11:19:52,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {53951#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53951#false} is VALID [2022-04-27 11:19:52,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {53951#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53951#false} is VALID [2022-04-27 11:19:52,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {53951#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53951#false} is VALID [2022-04-27 11:19:52,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {53951#false} assume !(~y~0 % 4294967296 > 0); {53951#false} is VALID [2022-04-27 11:19:52,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {53951#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53951#false} is VALID [2022-04-27 11:19:52,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {53951#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53951#false} is VALID [2022-04-27 11:19:52,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {53951#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53951#false} is VALID [2022-04-27 11:19:52,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {53951#false} assume !(~x~0 % 4294967296 > 0); {53951#false} is VALID [2022-04-27 11:19:52,481 INFO L272 TraceCheckUtils]: 34: Hoare triple {53951#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {53951#false} is VALID [2022-04-27 11:19:52,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {53951#false} ~cond := #in~cond; {53951#false} is VALID [2022-04-27 11:19:52,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {53951#false} assume 0 == ~cond; {53951#false} is VALID [2022-04-27 11:19:52,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {53951#false} assume !false; {53951#false} is VALID [2022-04-27 11:19:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:19:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:52,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072098130] [2022-04-27 11:19:52,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072098130] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:52,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956758836] [2022-04-27 11:19:52,482 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:19:52,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:52,490 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:19:52,491 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:19:52,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:19:52,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:52,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 11:19:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:52,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:52,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {53950#true} call ULTIMATE.init(); {53950#true} is VALID [2022-04-27 11:19:52,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {53950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53950#true} is VALID [2022-04-27 11:19:52,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {53950#true} assume true; {53950#true} is VALID [2022-04-27 11:19:52,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53950#true} {53950#true} #72#return; {53950#true} is VALID [2022-04-27 11:19:52,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {53950#true} call #t~ret13 := main(); {53950#true} is VALID [2022-04-27 11:19:52,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {53950#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53955#(= main_~y~0 0)} is VALID [2022-04-27 11:19:52,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {53955#(= 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; {53956#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:52,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {53956#(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; {53957#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:52,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {53957#(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; {53958#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:52,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {53958#(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; {53959#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:52,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {53959#(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; {53960#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:52,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {53960#(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; {53961#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:52,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {53961#(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; {53962#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:52,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {53962#(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; {53963#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:19:52,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {53963#(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; {53964#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:19:52,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {53964#(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; {53965#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:19:52,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {53965#(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; {53966#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:52,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {53966#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53967#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:19:52,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {53967#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53968#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:19:52,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {53968#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:19:52,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {53969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {53969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:19:52,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {53969#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {53970#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:19:52,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {53970#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53971#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:19:52,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {53971#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53972#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:19:52,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {53972#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54050#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:19:52,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {54050#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {53951#false} is VALID [2022-04-27 11:19:52,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {53951#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53951#false} is VALID [2022-04-27 11:19:52,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {53951#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53951#false} is VALID [2022-04-27 11:19:52,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {53951#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53951#false} is VALID [2022-04-27 11:19:52,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {53951#false} assume !(~y~0 % 4294967296 > 0); {53951#false} is VALID [2022-04-27 11:19:52,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {53951#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53951#false} is VALID [2022-04-27 11:19:52,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {53951#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53951#false} is VALID [2022-04-27 11:19:52,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {53951#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53951#false} is VALID [2022-04-27 11:19:52,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {53951#false} assume !(~x~0 % 4294967296 > 0); {53951#false} is VALID [2022-04-27 11:19:52,857 INFO L272 TraceCheckUtils]: 34: Hoare triple {53951#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {53951#false} is VALID [2022-04-27 11:19:52,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {53951#false} ~cond := #in~cond; {53951#false} is VALID [2022-04-27 11:19:52,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {53951#false} assume 0 == ~cond; {53951#false} is VALID [2022-04-27 11:19:52,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {53951#false} assume !false; {53951#false} is VALID [2022-04-27 11:19:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:19:52,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {53951#false} assume !false; {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {53951#false} assume 0 == ~cond; {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {53951#false} ~cond := #in~cond; {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L272 TraceCheckUtils]: 34: Hoare triple {53951#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {53951#false} assume !(~x~0 % 4294967296 > 0); {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {53951#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {53951#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {53951#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~z~0;~z~0 := 1 + #t~post12;havoc #t~post12; {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {53951#false} assume !(~y~0 % 4294967296 > 0); {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {53951#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {53951#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53951#false} is VALID [2022-04-27 11:19:53,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {53951#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53951#false} is VALID [2022-04-27 11:19:53,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {54126#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53951#false} is VALID [2022-04-27 11:19:53,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {54130#(< 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; {54126#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:19:53,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {54134#(< 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; {54130#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:19:53,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {54138#(< 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; {54134#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:19:53,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {54142#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {54138#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:19:53,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {54142#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {54142#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:19:53,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {54149#(< 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; {54142#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:19:53,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {54153#(< 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; {54149#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:19:53,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {54157#(< 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; {54153#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:19:53,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {54161#(< 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; {54157#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:19:53,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {54165#(< 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; {54161#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:19:53,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {54169#(< 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; {54165#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:19:53,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {54173#(< 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; {54169#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:19:53,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {54177#(< 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; {54173#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:19:53,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {54181#(< 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; {54177#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:53,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {54185#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54181#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:19:53,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {54189#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54185#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:53,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {54193#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54189#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:19:53,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {54197#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54193#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:19:53,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {54201#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {54197#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:19:53,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {53950#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54201#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:19:53,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {53950#true} call #t~ret13 := main(); {53950#true} is VALID [2022-04-27 11:19:53,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53950#true} {53950#true} #72#return; {53950#true} is VALID [2022-04-27 11:19:53,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {53950#true} assume true; {53950#true} is VALID [2022-04-27 11:19:53,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {53950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53950#true} is VALID [2022-04-27 11:19:53,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {53950#true} call ULTIMATE.init(); {53950#true} is VALID [2022-04-27 11:19:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:19:53,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956758836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:53,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:53,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-27 11:19:53,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714538080] [2022-04-27 11:19:53,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 41 states have internal predecessors, (54), 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 38 [2022-04-27 11:19:53,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:53,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 41 states have internal predecessors, (54), 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:19:53,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:53,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-27 11:19:53,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:53,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-27 11:19:53,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 11:19:53,533 INFO L87 Difference]: Start difference. First operand 402 states and 570 transitions. Second operand has 42 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 41 states have internal predecessors, (54), 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:20:11,480 WARN L232 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:20:23,267 WARN L232 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:20:49,796 WARN L232 SmtUtils]: Spent 21.48s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:21:19,432 WARN L232 SmtUtils]: Spent 14.04s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:21:37,448 WARN L232 SmtUtils]: Spent 11.10s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:22:00,344 WARN L232 SmtUtils]: Spent 10.61s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:22:20,597 WARN L232 SmtUtils]: Spent 10.88s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:22:39,732 WARN L232 SmtUtils]: Spent 14.10s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:23:01,347 WARN L232 SmtUtils]: Spent 11.72s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:23:22,442 WARN L232 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:23:33,882 WARN L232 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:23:49,409 WARN L232 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:24:03,174 WARN L232 SmtUtils]: Spent 9.51s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:24:13,044 WARN L232 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:24:23,383 WARN L232 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:24:47,020 WARN L232 SmtUtils]: Spent 15.28s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:25:27,200 WARN L232 SmtUtils]: Spent 9.50s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:25:43,780 WARN L232 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:26:24,058 WARN L232 SmtUtils]: Spent 9.41s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)