/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-de41.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:11:07,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:11:07,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:11:07,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:11:07,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:11:07,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:11:07,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:11:07,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:11:07,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:11:07,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:11:07,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:11:07,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:11:07,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:11:07,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:11:07,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:11:07,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:11:07,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:11:07,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:11:07,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:11:07,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:11:07,344 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:11:07,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:11:07,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:11:07,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:11:07,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:11:07,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:11:07,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:11:07,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:11:07,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:11:07,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:11:07,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:11:07,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:11:07,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:11:07,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:11:07,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:11:07,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:11:07,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:11:07,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:11:07,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:11:07,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:11:07,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:11:07,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:11:07,360 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:11:07,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:11:07,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:11:07,383 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:11:07,383 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:11:07,384 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:11:07,384 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:11:07,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:11:07,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:11:07,385 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:11:07,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:11:07,386 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:11:07,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:11:07,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:11:07,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:11:07,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:11:07,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:11:07,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:11:07,387 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:11:07,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:11:07,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:11:07,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:11:07,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:11:07,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:11:07,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:11:07,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:11:07,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:11:07,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:11:07,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:11:07,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:11:07,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:11:07,392 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:11:07,392 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:11:07,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:11:07,392 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:11:07,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:11:07,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:11:07,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:11:07,655 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:11:07,657 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:11:07,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-27 11:11:07,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e476069d7/9a1595f47774440db448f143043058b9/FLAG32efde2d2 [2022-04-27 11:11:08,121 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:11:08,121 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-27 11:11:08,129 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e476069d7/9a1595f47774440db448f143043058b9/FLAG32efde2d2 [2022-04-27 11:11:08,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e476069d7/9a1595f47774440db448f143043058b9 [2022-04-27 11:11:08,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:11:08,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:11:08,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:11:08,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:11:08,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:11:08,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:11:08" (1/1) ... [2022-04-27 11:11:08,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb24cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08, skipping insertion in model container [2022-04-27 11:11:08,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:11:08" (1/1) ... [2022-04-27 11:11:08,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:11:08,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:11:08,294 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-de41.c[368,381] [2022-04-27 11:11:08,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:11:08,324 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:11:08,333 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-de41.c[368,381] [2022-04-27 11:11:08,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:11:08,349 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:11:08,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08 WrapperNode [2022-04-27 11:11:08,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:11:08,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:11:08,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:11:08,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:11:08,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08" (1/1) ... [2022-04-27 11:11:08,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08" (1/1) ... [2022-04-27 11:11:08,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08" (1/1) ... [2022-04-27 11:11:08,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08" (1/1) ... [2022-04-27 11:11:08,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08" (1/1) ... [2022-04-27 11:11:08,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08" (1/1) ... [2022-04-27 11:11:08,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08" (1/1) ... [2022-04-27 11:11:08,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:11:08,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:11:08,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:11:08,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:11:08,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08" (1/1) ... [2022-04-27 11:11:08,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:11:08,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:08,420 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:11:08,440 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:11:08,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:11:08,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:11:08,455 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:11:08,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:11:08,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:11:08,508 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:11:08,510 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:11:08,742 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:11:08,748 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:11:08,748 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-27 11:11:08,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:11:08 BoogieIcfgContainer [2022-04-27 11:11:08,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:11:08,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:11:08,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:11:08,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:11:08,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:11:08" (1/3) ... [2022-04-27 11:11:08,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef122c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:11:08, skipping insertion in model container [2022-04-27 11:11:08,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:11:08" (2/3) ... [2022-04-27 11:11:08,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef122c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:11:08, skipping insertion in model container [2022-04-27 11:11:08,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:11:08" (3/3) ... [2022-04-27 11:11:08,768 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de41.c [2022-04-27 11:11:08,788 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:11:08,788 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:11:08,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:11:08,855 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@68857897, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ed23109 [2022-04-27 11:11:08,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:11:08,868 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:11:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:11:08,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:08,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:11:08,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:08,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-27 11:11:08,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:08,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173814446] [2022-04-27 11:11:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:08,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:09,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:09,106 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:11:09,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 11:11:09,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-27 11:11:09,109 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:11:09,110 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:11:09,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 11:11:09,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-27 11:11:09,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-27 11:11:09,111 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:11:09,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-27 11:11:09,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-27 11:11:09,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-27 11:11:09,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-27 11:11:09,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 11:11:09,113 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-27 11:11:09,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 11:11:09,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 11:11:09,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 11:11:09,115 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:11:09,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173814446] [2022-04-27 11:11:09,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173814446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:11:09,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:11:09,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:11:09,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184296181] [2022-04-27 11:11:09,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:11:09,124 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:11:09,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:09,129 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:11:09,158 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:11:09,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:11:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:09,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:11:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:11:09,186 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:11:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:09,281 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 11:11:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:11:09,282 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:11:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:09,283 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:11:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-27 11:11:09,293 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:11:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-27 11:11:09,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-27 11:11:09,375 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:11:09,384 INFO L225 Difference]: With dead ends: 39 [2022-04-27 11:11:09,384 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 11:11:09,387 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:11:09,391 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:11:09,393 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:11:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 11:11:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 11:11:09,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:09,425 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:11:09,425 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:11:09,425 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:11:09,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:09,429 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-27 11:11:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-27 11:11:09,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:09,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:09,430 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:11:09,431 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:11:09,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:09,433 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-27 11:11:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-27 11:11:09,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:09,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:09,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:09,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:09,435 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:11:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-27 11:11:09,438 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-27 11:11:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:09,439 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-27 11:11:09,440 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:11:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-27 11:11:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:11:09,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:09,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:11:09,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:11:09,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-27 11:11:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:09,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043384198] [2022-04-27 11:11:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:09,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:09,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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:11:09,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume true; {140#true} is VALID [2022-04-27 11:11:09,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {140#true} {140#true} #72#return; {140#true} is VALID [2022-04-27 11:11:09,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {140#true} call ULTIMATE.init(); {150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:09,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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:11:09,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume true; {140#true} is VALID [2022-04-27 11:11:09,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140#true} {140#true} #72#return; {140#true} is VALID [2022-04-27 11:11:09,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {140#true} call #t~ret13 := main(); {140#true} is VALID [2022-04-27 11:11:09,832 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#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:11:09,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {146#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 11:11:09,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {146#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 11:11:09,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~z~0 % 4294967296 > 0); {146#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 11:11:09,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {146#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-27 11:11:09,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {147#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} is VALID [2022-04-27 11:11:09,837 INFO L272 TraceCheckUtils]: 11: Hoare triple {147#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {148#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:11:09,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {149#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:11:09,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {141#false} is VALID [2022-04-27 11:11:09,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-04-27 11:11:09,838 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:11:09,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:09,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043384198] [2022-04-27 11:11:09,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043384198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:11:09,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:11:09,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 11:11:09,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384489729] [2022-04-27 11:11:09,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:11:09,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:11:09,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:09,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:11:09,857 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:11:09,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:11:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:09,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:11:09,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:11:09,859 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:11:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:10,168 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 11:11:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:11:10,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:11:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:11:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 11:11:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:11:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-27 11:11:10,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-27 11:11:10,227 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:11:10,228 INFO L225 Difference]: With dead ends: 35 [2022-04-27 11:11:10,228 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 11:11:10,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:11:10,230 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:10,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:11:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 11:11:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 11:11:10,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:10,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:10,236 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:10,236 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:10,238 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 11:11:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 11:11:10,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:10,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:10,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 11:11:10,239 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 11:11:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:10,240 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 11:11:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 11:11:10,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:10,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:10,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:10,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-27 11:11:10,242 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-27 11:11:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:10,242 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-27 11:11:10,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:11:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 11:11:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:11:10,243 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:10,243 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:11:10,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:11:10,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-27 11:11:10,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:10,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17116582] [2022-04-27 11:11:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:10,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:10,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:10,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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:11:10,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-27 11:11:10,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291#true} {291#true} #72#return; {291#true} is VALID [2022-04-27 11:11:10,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:10,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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:11:10,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-27 11:11:10,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #72#return; {291#true} is VALID [2022-04-27 11:11:10,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret13 := main(); {291#true} is VALID [2022-04-27 11:11:10,315 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:11:10,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#(= 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; {297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:10,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:10,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {298#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:11:10,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:11:10,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {292#false} assume !(~y~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:11:10,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(~x~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:11:10,319 INFO L272 TraceCheckUtils]: 12: Hoare triple {292#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {292#false} is VALID [2022-04-27 11:11:10,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2022-04-27 11:11:10,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2022-04-27 11:11:10,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-27 11:11:10,320 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:11:10,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:10,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17116582] [2022-04-27 11:11:10,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17116582] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:10,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252826815] [2022-04-27 11:11:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:10,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:10,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:10,323 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:11:10,340 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:11:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:10,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:11:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:10,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:10,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2022-04-27 11:11:10,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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:11:10,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-27 11:11:10,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #72#return; {291#true} is VALID [2022-04-27 11:11:10,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret13 := main(); {291#true} is VALID [2022-04-27 11:11:10,700 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:11:10,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#(= 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; {297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:10,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:10,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {327#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:11:10,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:11:10,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {292#false} assume !(~y~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:11:10,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(~x~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:11:10,703 INFO L272 TraceCheckUtils]: 12: Hoare triple {292#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {292#false} is VALID [2022-04-27 11:11:10,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2022-04-27 11:11:10,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2022-04-27 11:11:10,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-27 11:11:10,704 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:11:10,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:10,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-27 11:11:10,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2022-04-27 11:11:10,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2022-04-27 11:11:10,806 INFO L272 TraceCheckUtils]: 12: Hoare triple {292#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {292#false} is VALID [2022-04-27 11:11:10,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(~x~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:11:10,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {292#false} assume !(~y~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:11:10,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {292#false} is VALID [2022-04-27 11:11:10,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {367#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:11:10,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:11:10,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#(< 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; {371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:11:10,825 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; {378#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:11:10,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret13 := main(); {291#true} is VALID [2022-04-27 11:11:10,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #72#return; {291#true} is VALID [2022-04-27 11:11:10,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-27 11:11:10,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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:11:10,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2022-04-27 11:11:10,826 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:11:10,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252826815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:10,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:10,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-27 11:11:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782254488] [2022-04-27 11:11:10,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:10,827 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:11:10,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:10,827 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:11:10,847 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:11:10,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:11:10,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:10,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:11:10,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:11:10,849 INFO L87 Difference]: Start difference. First operand 22 states and 27 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:11:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:11,374 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2022-04-27 11:11:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:11:11,374 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:11:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:11,374 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:11:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-27 11:11:11,377 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:11:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-27 11:11:11,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2022-04-27 11:11:11,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:11,468 INFO L225 Difference]: With dead ends: 56 [2022-04-27 11:11:11,468 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 11:11:11,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:11:11,469 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 68 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:11,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 45 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:11:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 11:11:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2022-04-27 11:11:11,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:11,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 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:11:11,500 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 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:11:11,501 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 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:11:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:11,509 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-27 11:11:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2022-04-27 11:11:11,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:11,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:11,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 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 49 states. [2022-04-27 11:11:11,510 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 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 49 states. [2022-04-27 11:11:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:11,512 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-27 11:11:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2022-04-27 11:11:11,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:11,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:11,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:11,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 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:11:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-04-27 11:11:11,514 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 16 [2022-04-27 11:11:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:11,515 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-04-27 11:11:11,515 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:11:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-27 11:11:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:11:11,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:11,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:11:11,540 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:11:11,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:11,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 1 times [2022-04-27 11:11:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:11,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905768795] [2022-04-27 11:11:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:11,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:11,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:11,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {648#true} is VALID [2022-04-27 11:11:11,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#true} assume true; {648#true} is VALID [2022-04-27 11:11:11,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {648#true} {648#true} #72#return; {648#true} is VALID [2022-04-27 11:11:11,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {648#true} call ULTIMATE.init(); {655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:11,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {648#true} is VALID [2022-04-27 11:11:11,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#true} assume true; {648#true} is VALID [2022-04-27 11:11:11,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {648#true} {648#true} #72#return; {648#true} is VALID [2022-04-27 11:11:11,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {648#true} call #t~ret13 := main(); {648#true} is VALID [2022-04-27 11:11:11,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {648#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {653#(= main_~y~0 0)} is VALID [2022-04-27 11:11:11,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {653#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {653#(= main_~y~0 0)} is VALID [2022-04-27 11:11:11,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#(= main_~y~0 0)} ~z~0 := ~y~0; {654#(= main_~z~0 0)} is VALID [2022-04-27 11:11:11,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {654#(= 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; {649#false} is VALID [2022-04-27 11:11:11,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#false} assume !(~z~0 % 4294967296 > 0); {649#false} is VALID [2022-04-27 11:11:11,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {649#false} assume !(~y~0 % 4294967296 > 0); {649#false} is VALID [2022-04-27 11:11:11,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {649#false} is VALID [2022-04-27 11:11:11,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {649#false} assume !(~x~0 % 4294967296 > 0); {649#false} is VALID [2022-04-27 11:11:11,779 INFO L272 TraceCheckUtils]: 13: Hoare triple {649#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {649#false} is VALID [2022-04-27 11:11:11,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {649#false} ~cond := #in~cond; {649#false} is VALID [2022-04-27 11:11:11,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {649#false} assume 0 == ~cond; {649#false} is VALID [2022-04-27 11:11:11,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {649#false} assume !false; {649#false} is VALID [2022-04-27 11:11:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:11:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:11,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905768795] [2022-04-27 11:11:11,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905768795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:11:11,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:11:11,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:11:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390336529] [2022-04-27 11:11:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:11:11,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:11:11,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:11,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:11,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:11,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:11:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:11,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:11:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:11:11,800 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:11,900 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 11:11:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:11:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:11:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 11:11:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 11:11:11,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 11:11:11,930 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:11:11,933 INFO L225 Difference]: With dead ends: 40 [2022-04-27 11:11:11,933 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 11:11:11,934 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:11:11,942 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:11:11,943 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:11:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 11:11:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 11:11:11,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:11,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 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:11:11,962 INFO L74 IsIncluded]: Start isIncluded. First operand 29 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:11:11,962 INFO L87 Difference]: Start difference. First operand 29 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:11:11,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:11,964 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-27 11:11:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 11:11:11,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:11,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:11,966 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 29 states. [2022-04-27 11:11:11,966 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 29 states. [2022-04-27 11:11:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:11,973 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-27 11:11:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 11:11:11,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:11,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:11,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:11,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:11,974 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:11:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-27 11:11:11,976 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2022-04-27 11:11:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:11,977 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-27 11:11:11,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 11:11:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 11:11:11,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:11,981 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:11:11,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 11:11:11,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-27 11:11:11,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:11,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430194882] [2022-04-27 11:11:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:11,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:12,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:12,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {832#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-27 11:11:12,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-27 11:11:12,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {825#true} {825#true} #72#return; {825#true} is VALID [2022-04-27 11:11:12,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {832#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:12,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {832#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-27 11:11:12,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-27 11:11:12,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #72#return; {825#true} is VALID [2022-04-27 11:11:12,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret13 := main(); {825#true} is VALID [2022-04-27 11:11:12,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {825#true} is VALID [2022-04-27 11:11:12,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {825#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; {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:12,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:12,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:12,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#(<= 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; {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {831#(<= (+ (* 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; {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {826#false} is VALID [2022-04-27 11:11:12,091 INFO L272 TraceCheckUtils]: 14: Hoare triple {826#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {826#false} is VALID [2022-04-27 11:11:12,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-27 11:11:12,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-27 11:11:12,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-27 11:11:12,092 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:11:12,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:12,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430194882] [2022-04-27 11:11:12,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430194882] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:12,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375673579] [2022-04-27 11:11:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:12,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:12,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:12,094 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:11:12,095 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:11:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:12,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:11:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:12,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:12,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2022-04-27 11:11:12,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-27 11:11:12,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-27 11:11:12,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #72#return; {825#true} is VALID [2022-04-27 11:11:12,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret13 := main(); {825#true} is VALID [2022-04-27 11:11:12,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {825#true} is VALID [2022-04-27 11:11:12,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {825#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; {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:12,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:12,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:12,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#(<= 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; {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {831#(<= (+ (* 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; {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {826#false} is VALID [2022-04-27 11:11:12,456 INFO L272 TraceCheckUtils]: 14: Hoare triple {826#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {826#false} is VALID [2022-04-27 11:11:12,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-27 11:11:12,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-27 11:11:12,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-27 11:11:12,457 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:11:12,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:12,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-27 11:11:12,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-27 11:11:12,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-27 11:11:12,553 INFO L272 TraceCheckUtils]: 14: Hoare triple {826#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {826#false} is VALID [2022-04-27 11:11:12,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {826#false} is VALID [2022-04-27 11:11:12,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {831#(<= (+ (* 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; {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#(<= 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; {831#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:11:12,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:12,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:12,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {825#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; {830#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:12,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {825#true} is VALID [2022-04-27 11:11:12,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret13 := main(); {825#true} is VALID [2022-04-27 11:11:12,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #72#return; {825#true} is VALID [2022-04-27 11:11:12,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-27 11:11:12,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-27 11:11:12,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2022-04-27 11:11:12,559 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:11:12,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375673579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:12,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:12,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-27 11:11:12,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692132483] [2022-04-27 11:11:12,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:12,560 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:11:12,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:12,561 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:11:12,575 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:11:12,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:11:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:12,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:11:12,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:11:12,577 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:11:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:12,737 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 11:11:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:11:12,737 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:11:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:12,738 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:11:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 11:11:12,739 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:11:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 11:11:12,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-27 11:11:12,775 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:11:12,776 INFO L225 Difference]: With dead ends: 45 [2022-04-27 11:11:12,777 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 11:11:12,777 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:11:12,777 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:12,778 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.1s Time] [2022-04-27 11:11:12,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 11:11:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-04-27 11:11:12,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:12,804 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:11:12,804 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:11:12,805 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:11:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:12,806 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-27 11:11:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-04-27 11:11:12,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:12,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:12,807 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:11:12,807 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:11:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:12,809 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-27 11:11:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-04-27 11:11:12,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:12,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:12,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:12,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:12,809 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:11:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2022-04-27 11:11:12,811 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 18 [2022-04-27 11:11:12,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:12,811 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-04-27 11:11:12,811 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:11:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-04-27 11:11:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:11:12,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:12,812 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:11:12,835 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:11:13,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:13,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-27 11:11:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:13,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901713271] [2022-04-27 11:11:13,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:13,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:13,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {1161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1149#true} is VALID [2022-04-27 11:11:13,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-27 11:11:13,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1149#true} {1149#true} #72#return; {1149#true} is VALID [2022-04-27 11:11:13,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:13,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1149#true} is VALID [2022-04-27 11:11:13,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-27 11:11:13,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1149#true} {1149#true} #72#return; {1149#true} is VALID [2022-04-27 11:11:13,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {1149#true} call #t~ret13 := main(); {1149#true} is VALID [2022-04-27 11:11:13,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {1149#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1154#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:11:13,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {1154#(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; {1155#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-27 11:11:13,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {1155#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {1156#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-27 11:11:13,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {1156#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} ~z~0 := ~y~0; {1156#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-27 11:11:13,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {1156#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) 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; {1156#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-27 11:11:13,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {1156#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {1156#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-27 11:11:13,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {1156#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) 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; {1157#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-27 11:11:13,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {1157#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~y~0 % 4294967296 > 0); {1157#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-27 11:11:13,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {1157#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:11:13,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:11:13,338 INFO L272 TraceCheckUtils]: 15: Hoare triple {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1159#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:11:13,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {1159#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1160#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:11:13,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {1160#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1150#false} is VALID [2022-04-27 11:11:13,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-27 11:11:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:11:13,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:13,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901713271] [2022-04-27 11:11:13,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901713271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:13,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352349237] [2022-04-27 11:11:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:13,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:13,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:13,341 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:11:13,347 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:11:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:13,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:11:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:13,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:13,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-27 11:11:13,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1149#true} is VALID [2022-04-27 11:11:13,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-27 11:11:13,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1149#true} {1149#true} #72#return; {1149#true} is VALID [2022-04-27 11:11:13,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {1149#true} call #t~ret13 := main(); {1149#true} is VALID [2022-04-27 11:11:13,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {1149#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1154#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:11:13,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {1154#(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; {1183#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:11:13,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1187#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-27 11:11:13,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {1187#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} ~z~0 := ~y~0; {1191#(and (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 main_~y~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-27 11:11:13,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(and (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 main_~y~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1195#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:11:13,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1195#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:11:13,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {1195#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1202#(and (= (+ main_~y~0 1) 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:11:13,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {1202#(and (= (+ main_~y~0 1) 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {1202#(and (= (+ main_~y~0 1) 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:11:13,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {1202#(and (= (+ main_~y~0 1) 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1195#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:11:13,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {1195#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:11:13,862 INFO L272 TraceCheckUtils]: 15: Hoare triple {1195#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1215#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:11:13,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {1215#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1219#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:11:13,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {1219#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1150#false} is VALID [2022-04-27 11:11:13,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-27 11:11:13,864 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:11:13,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:14,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-27 11:11:14,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {1219#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1150#false} is VALID [2022-04-27 11:11:14,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {1215#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1219#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:11:14,410 INFO L272 TraceCheckUtils]: 15: Hoare triple {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1215#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:11:14,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:11:14,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {1241#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:11:14,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {1241#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {1241#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:11:14,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) 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; {1241#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:11:14,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:11:14,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {1254#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1158#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:11:14,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {1258#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {1254#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:11:14,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {1258#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:11:14,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {1266#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 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; {1262#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:11:14,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {1149#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1266#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:11:14,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {1149#true} call #t~ret13 := main(); {1149#true} is VALID [2022-04-27 11:11:14,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1149#true} {1149#true} #72#return; {1149#true} is VALID [2022-04-27 11:11:14,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-27 11:11:14,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1149#true} is VALID [2022-04-27 11:11:14,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-27 11:11:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:11:14,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352349237] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:14,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:14,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-04-27 11:11:14,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686144990] [2022-04-27 11:11:14,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:14,423 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 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:11:14,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:14,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 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:11:14,475 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:11:14,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:11:14,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:14,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:11:14,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:11:14,477 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 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:11:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:16,618 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2022-04-27 11:11:16,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 11:11:16,618 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 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:11:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 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:11:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 75 transitions. [2022-04-27 11:11:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 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:11:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 75 transitions. [2022-04-27 11:11:16,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 75 transitions. [2022-04-27 11:11:16,750 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:11:16,751 INFO L225 Difference]: With dead ends: 70 [2022-04-27 11:11:16,751 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 11:11:16,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2022-04-27 11:11:16,753 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 107 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:16,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 46 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:11:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 11:11:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2022-04-27 11:11:16,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:16,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:16,808 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:16,808 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:16,810 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2022-04-27 11:11:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2022-04-27 11:11:16,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:16,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:16,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-27 11:11:16,811 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-27 11:11:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:16,813 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2022-04-27 11:11:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2022-04-27 11:11:16,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:16,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:16,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:16,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-04-27 11:11:16,815 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 19 [2022-04-27 11:11:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:16,815 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-04-27 11:11:16,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 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:11:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2022-04-27 11:11:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:11:16,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:16,816 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:11:16,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 11:11:17,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:17,039 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:17,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:17,040 INFO L85 PathProgramCache]: Analyzing trace with hash -343761690, now seen corresponding path program 2 times [2022-04-27 11:11:17,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:17,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708418361] [2022-04-27 11:11:17,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:17,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:17,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:17,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {1632#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1623#true} is VALID [2022-04-27 11:11:17,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 11:11:17,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1623#true} {1623#true} #72#return; {1623#true} is VALID [2022-04-27 11:11:17,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {1623#true} call ULTIMATE.init(); {1632#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:17,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {1632#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1623#true} is VALID [2022-04-27 11:11:17,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 11:11:17,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} #72#return; {1623#true} is VALID [2022-04-27 11:11:17,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} call #t~ret13 := main(); {1623#true} is VALID [2022-04-27 11:11:17,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {1623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1628#(= main_~y~0 0)} is VALID [2022-04-27 11:11:17,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {1628#(= 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; {1629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:17,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {1629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:17,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1630#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:11:17,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {1630#(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; {1631#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:11:17,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {1631#(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; {1624#false} is VALID [2022-04-27 11:11:17,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {1624#false} assume !(~z~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-27 11:11:17,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {1624#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; {1624#false} is VALID [2022-04-27 11:11:17,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {1624#false} assume !(~y~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-27 11:11:17,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {1624#false} assume !(~x~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-27 11:11:17,147 INFO L272 TraceCheckUtils]: 15: Hoare triple {1624#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1624#false} is VALID [2022-04-27 11:11:17,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {1624#false} ~cond := #in~cond; {1624#false} is VALID [2022-04-27 11:11:17,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {1624#false} assume 0 == ~cond; {1624#false} is VALID [2022-04-27 11:11:17,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {1624#false} assume !false; {1624#false} is VALID [2022-04-27 11:11:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:11:17,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:17,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708418361] [2022-04-27 11:11:17,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708418361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:17,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337628944] [2022-04-27 11:11:17,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:11:17,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:17,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:17,150 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:11:17,171 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:11:17,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:11:17,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:17,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:11:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:17,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:17,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {1623#true} call ULTIMATE.init(); {1623#true} is VALID [2022-04-27 11:11:17,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1623#true} is VALID [2022-04-27 11:11:17,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 11:11:17,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} #72#return; {1623#true} is VALID [2022-04-27 11:11:17,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} call #t~ret13 := main(); {1623#true} is VALID [2022-04-27 11:11:17,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {1623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1628#(= main_~y~0 0)} is VALID [2022-04-27 11:11:17,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {1628#(= 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; {1629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:17,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {1629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:17,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1660#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:17,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {1660#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1664#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:17,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {1664#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1624#false} is VALID [2022-04-27 11:11:17,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {1624#false} assume !(~z~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-27 11:11:17,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {1624#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; {1624#false} is VALID [2022-04-27 11:11:17,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {1624#false} assume !(~y~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-27 11:11:17,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {1624#false} assume !(~x~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-27 11:11:17,302 INFO L272 TraceCheckUtils]: 15: Hoare triple {1624#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1624#false} is VALID [2022-04-27 11:11:17,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {1624#false} ~cond := #in~cond; {1624#false} is VALID [2022-04-27 11:11:17,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {1624#false} assume 0 == ~cond; {1624#false} is VALID [2022-04-27 11:11:17,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {1624#false} assume !false; {1624#false} is VALID [2022-04-27 11:11:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:11:17,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:17,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {1624#false} assume !false; {1624#false} is VALID [2022-04-27 11:11:17,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {1624#false} assume 0 == ~cond; {1624#false} is VALID [2022-04-27 11:11:17,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {1624#false} ~cond := #in~cond; {1624#false} is VALID [2022-04-27 11:11:17,428 INFO L272 TraceCheckUtils]: 15: Hoare triple {1624#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1624#false} is VALID [2022-04-27 11:11:17,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {1624#false} assume !(~x~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-27 11:11:17,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {1707#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-27 11:11:17,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {1711#(< 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; {1707#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:11:17,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {1711#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1711#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:11:17,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {1718#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1711#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:11:17,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1722#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1718#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:11:17,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1623#true} ~z~0 := ~y~0; {1722#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:11:17,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {1623#true} assume !(~x~0 % 4294967296 > 0); {1623#true} is VALID [2022-04-27 11:11:17,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {1623#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; {1623#true} is VALID [2022-04-27 11:11:17,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {1623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1623#true} is VALID [2022-04-27 11:11:17,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} call #t~ret13 := main(); {1623#true} is VALID [2022-04-27 11:11:17,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} #72#return; {1623#true} is VALID [2022-04-27 11:11:17,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-27 11:11:17,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1623#true} is VALID [2022-04-27 11:11:17,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {1623#true} call ULTIMATE.init(); {1623#true} is VALID [2022-04-27 11:11:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:11:17,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337628944] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:17,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:17,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-27 11:11:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100950079] [2022-04-27 11:11:17,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:17,435 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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 19 [2022-04-27 11:11:17,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:17,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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:11:17,463 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:11:17,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:11:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:17,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:11:17,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:11:17,464 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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:11:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:18,077 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2022-04-27 11:11:18,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 11:11:18,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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 19 [2022-04-27 11:11:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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:11:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-27 11:11:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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:11:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-27 11:11:18,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-04-27 11:11:18,158 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:11:18,159 INFO L225 Difference]: With dead ends: 68 [2022-04-27 11:11:18,159 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 11:11:18,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:11:18,160 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 71 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:18,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 39 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:11:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 11:11:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2022-04-27 11:11:18,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:18,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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:11:18,224 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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:11:18,224 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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:11:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:18,226 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2022-04-27 11:11:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-04-27 11:11:18,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:18,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:18,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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 56 states. [2022-04-27 11:11:18,227 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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 56 states. [2022-04-27 11:11:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:18,229 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2022-04-27 11:11:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-04-27 11:11:18,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:18,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:18,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:18,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:18,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 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:11:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-27 11:11:18,230 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 19 [2022-04-27 11:11:18,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:18,231 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-04-27 11:11:18,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 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:11:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-04-27 11:11:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:11:18,231 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:18,231 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:11:18,256 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:11:18,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:18,454 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash 146579608, now seen corresponding path program 2 times [2022-04-27 11:11:18,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:18,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990506889] [2022-04-27 11:11:18,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:18,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:18,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {2058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2047#true} is VALID [2022-04-27 11:11:18,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:11:18,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2047#true} {2047#true} #72#return; {2047#true} is VALID [2022-04-27 11:11:18,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:18,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {2058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2047#true} is VALID [2022-04-27 11:11:18,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:11:18,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #72#return; {2047#true} is VALID [2022-04-27 11:11:18,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret13 := main(); {2047#true} is VALID [2022-04-27 11:11:18,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {2047#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2052#(= main_~y~0 0)} is VALID [2022-04-27 11:11:18,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {2052#(= 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; {2053#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:18,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {2053#(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; {2054#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:18,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {2054#(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; {2055#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:11:18,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {2055#(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; {2056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:11:18,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {2056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:11:18,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {2056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2057#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:11:18,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {2057#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-27 11:11:18,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#false} assume !(~y~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-27 11:11:18,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#false} assume !(~x~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-27 11:11:18,561 INFO L272 TraceCheckUtils]: 15: Hoare triple {2048#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2048#false} is VALID [2022-04-27 11:11:18,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {2048#false} ~cond := #in~cond; {2048#false} is VALID [2022-04-27 11:11:18,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {2048#false} assume 0 == ~cond; {2048#false} is VALID [2022-04-27 11:11:18,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2022-04-27 11:11:18,562 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:11:18,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:18,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990506889] [2022-04-27 11:11:18,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990506889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:18,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861428571] [2022-04-27 11:11:18,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:11:18,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:18,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:18,564 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:11:18,589 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:11:18,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:11:18,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:18,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:11:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:18,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:18,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2047#true} is VALID [2022-04-27 11:11:18,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {2047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2047#true} is VALID [2022-04-27 11:11:18,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:11:18,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #72#return; {2047#true} is VALID [2022-04-27 11:11:18,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret13 := main(); {2047#true} is VALID [2022-04-27 11:11:18,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {2047#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2052#(= main_~y~0 0)} is VALID [2022-04-27 11:11:18,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {2052#(= 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; {2053#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:18,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {2053#(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; {2054#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:18,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {2054#(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; {2055#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:11:18,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {2055#(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; {2056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:11:18,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {2056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:11:18,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {2056#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2095#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:11:18,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {2095#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-27 11:11:18,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#false} assume !(~y~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-27 11:11:18,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#false} assume !(~x~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-27 11:11:18,810 INFO L272 TraceCheckUtils]: 15: Hoare triple {2048#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2048#false} is VALID [2022-04-27 11:11:18,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {2048#false} ~cond := #in~cond; {2048#false} is VALID [2022-04-27 11:11:18,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {2048#false} assume 0 == ~cond; {2048#false} is VALID [2022-04-27 11:11:18,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2022-04-27 11:11:18,811 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:11:18,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:18,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2022-04-27 11:11:18,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {2048#false} assume 0 == ~cond; {2048#false} is VALID [2022-04-27 11:11:18,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {2048#false} ~cond := #in~cond; {2048#false} is VALID [2022-04-27 11:11:18,942 INFO L272 TraceCheckUtils]: 15: Hoare triple {2048#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2048#false} is VALID [2022-04-27 11:11:18,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#false} assume !(~x~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-27 11:11:18,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#false} assume !(~y~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-27 11:11:18,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {2135#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-27 11:11:18,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {2139#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {2135#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:11:18,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {2139#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2139#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:11:18,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {2146#(< 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; {2139#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:11:18,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {2150#(< 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; {2146#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:11:18,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {2154#(< 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; {2150#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:11:18,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {2158#(< 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; {2154#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:11:18,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {2047#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2158#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:11:18,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret13 := main(); {2047#true} is VALID [2022-04-27 11:11:18,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #72#return; {2047#true} is VALID [2022-04-27 11:11:18,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-27 11:11:18,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {2047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2047#true} is VALID [2022-04-27 11:11:18,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2047#true} is VALID [2022-04-27 11:11:18,949 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:11:18,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861428571] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:18,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:18,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 11:11:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650302742] [2022-04-27 11:11:18,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:18,951 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:11:18,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:18,951 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:11:18,974 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:11:18,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:11:18,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:18,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:11:18,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:11:18,975 INFO L87 Difference]: Start difference. First operand 39 states and 51 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:11:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:20,869 INFO L93 Difference]: Finished difference Result 139 states and 213 transitions. [2022-04-27 11:11:20,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 11:11:20,870 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:11:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:20,870 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:11:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 149 transitions. [2022-04-27 11:11:20,873 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:11:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 149 transitions. [2022-04-27 11:11:20,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 149 transitions. [2022-04-27 11:11:21,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:21,050 INFO L225 Difference]: With dead ends: 139 [2022-04-27 11:11:21,050 INFO L226 Difference]: Without dead ends: 128 [2022-04-27 11:11:21,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 11:11:21,052 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 219 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:21,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 64 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:11:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-27 11:11:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 65. [2022-04-27 11:11:21,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:21,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:21,185 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:21,185 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:21,189 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2022-04-27 11:11:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2022-04-27 11:11:21,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:21,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:21,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-27 11:11:21,190 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 128 states. [2022-04-27 11:11:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:21,194 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2022-04-27 11:11:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2022-04-27 11:11:21,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:21,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:21,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:21,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2022-04-27 11:11:21,198 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 19 [2022-04-27 11:11:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:21,199 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2022-04-27 11:11:21,199 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:11:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2022-04-27 11:11:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:11:21,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:21,199 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:11:21,226 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:11:21,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:21,423 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:21,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 2 times [2022-04-27 11:11:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:21,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256860664] [2022-04-27 11:11:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:21,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:21,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {2787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2780#true} is VALID [2022-04-27 11:11:21,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-27 11:11:21,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2780#true} {2780#true} #72#return; {2780#true} is VALID [2022-04-27 11:11:21,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:21,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {2787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2780#true} is VALID [2022-04-27 11:11:21,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-27 11:11:21,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #72#return; {2780#true} is VALID [2022-04-27 11:11:21,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret13 := main(); {2780#true} is VALID [2022-04-27 11:11:21,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2780#true} is VALID [2022-04-27 11:11:21,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {2780#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; {2780#true} is VALID [2022-04-27 11:11:21,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} assume !(~x~0 % 4294967296 > 0); {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:21,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:21,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {2785#(<= 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; {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:21,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2781#false} is VALID [2022-04-27 11:11:21,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {2781#false} assume !(~x~0 % 4294967296 > 0); {2781#false} is VALID [2022-04-27 11:11:21,502 INFO L272 TraceCheckUtils]: 16: Hoare triple {2781#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2781#false} is VALID [2022-04-27 11:11:21,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {2781#false} ~cond := #in~cond; {2781#false} is VALID [2022-04-27 11:11:21,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {2781#false} assume 0 == ~cond; {2781#false} is VALID [2022-04-27 11:11:21,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-27 11:11:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:11:21,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:21,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256860664] [2022-04-27 11:11:21,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256860664] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:21,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953102974] [2022-04-27 11:11:21,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:11:21,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:21,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:21,504 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:11:21,505 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:11:21,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:11:21,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:21,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:11:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:21,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:21,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-27 11:11:21,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2780#true} is VALID [2022-04-27 11:11:21,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-27 11:11:21,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #72#return; {2780#true} is VALID [2022-04-27 11:11:21,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret13 := main(); {2780#true} is VALID [2022-04-27 11:11:21,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2780#true} is VALID [2022-04-27 11:11:21,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {2780#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; {2780#true} is VALID [2022-04-27 11:11:21,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} assume !(~x~0 % 4294967296 > 0); {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:21,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:21,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {2785#(<= 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; {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:21,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2781#false} is VALID [2022-04-27 11:11:21,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {2781#false} assume !(~x~0 % 4294967296 > 0); {2781#false} is VALID [2022-04-27 11:11:21,775 INFO L272 TraceCheckUtils]: 16: Hoare triple {2781#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2781#false} is VALID [2022-04-27 11:11:21,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {2781#false} ~cond := #in~cond; {2781#false} is VALID [2022-04-27 11:11:21,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {2781#false} assume 0 == ~cond; {2781#false} is VALID [2022-04-27 11:11:21,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-27 11:11:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:11:21,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:21,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-27 11:11:21,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {2781#false} assume 0 == ~cond; {2781#false} is VALID [2022-04-27 11:11:21,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {2781#false} ~cond := #in~cond; {2781#false} is VALID [2022-04-27 11:11:21,973 INFO L272 TraceCheckUtils]: 16: Hoare triple {2781#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2781#false} is VALID [2022-04-27 11:11:21,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {2781#false} assume !(~x~0 % 4294967296 > 0); {2781#false} is VALID [2022-04-27 11:11:21,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2781#false} is VALID [2022-04-27 11:11:21,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:21,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {2785#(<= 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; {2786#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:11:21,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:21,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} assume !(~x~0 % 4294967296 > 0); {2785#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:21,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {2780#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; {2780#true} is VALID [2022-04-27 11:11:21,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2780#true} is VALID [2022-04-27 11:11:21,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret13 := main(); {2780#true} is VALID [2022-04-27 11:11:21,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #72#return; {2780#true} is VALID [2022-04-27 11:11:21,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-27 11:11:21,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2780#true} is VALID [2022-04-27 11:11:21,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-27 11:11:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:11:21,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953102974] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:21,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:21,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-27 11:11:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959303127] [2022-04-27 11:11:21,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:21,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:11:21,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:21,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:22,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:22,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:11:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:22,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:11:22,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:11:22,002 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:22,242 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2022-04-27 11:11:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:11:22,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:11:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 11:11:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 11:11:22,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-27 11:11:22,275 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:11:22,276 INFO L225 Difference]: With dead ends: 76 [2022-04-27 11:11:22,276 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 11:11:22,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:11:22,277 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:22,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:11:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 11:11:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-27 11:11:22,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:22,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:22,401 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:22,401 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:22,409 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2022-04-27 11:11:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-04-27 11:11:22,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:22,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:22,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-27 11:11:22,410 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-27 11:11:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:22,412 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2022-04-27 11:11:22,412 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-04-27 11:11:22,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:22,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:22,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:22,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-04-27 11:11:22,414 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 20 [2022-04-27 11:11:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:22,415 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-04-27 11:11:22,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-04-27 11:11:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:11:22,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:22,416 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:11:22,441 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:11:22,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:22,637 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1586904504, now seen corresponding path program 3 times [2022-04-27 11:11:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:22,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093752455] [2022-04-27 11:11:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:22,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:22,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {3254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3244#true} is VALID [2022-04-27 11:11:22,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {3244#true} assume true; {3244#true} is VALID [2022-04-27 11:11:22,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3244#true} {3244#true} #72#return; {3244#true} is VALID [2022-04-27 11:11:22,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {3244#true} call ULTIMATE.init(); {3254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:22,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {3254#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3244#true} is VALID [2022-04-27 11:11:22,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {3244#true} assume true; {3244#true} is VALID [2022-04-27 11:11:22,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3244#true} {3244#true} #72#return; {3244#true} is VALID [2022-04-27 11:11:22,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {3244#true} call #t~ret13 := main(); {3244#true} is VALID [2022-04-27 11:11:22,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {3244#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3249#(= main_~y~0 0)} is VALID [2022-04-27 11:11:22,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {3249#(= 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; {3250#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:22,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {3250#(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; {3251#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:22,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {3251#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3251#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:22,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {3251#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3252#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:11:22,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {3252#(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; {3253#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:11:22,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {3253#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-27 11:11:22,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#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; {3245#false} is VALID [2022-04-27 11:11:22,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {3245#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; {3245#false} is VALID [2022-04-27 11:11:22,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {3245#false} assume !(~y~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-27 11:11:22,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {3245#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3245#false} is VALID [2022-04-27 11:11:22,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {3245#false} assume !(~x~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-27 11:11:22,759 INFO L272 TraceCheckUtils]: 17: Hoare triple {3245#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3245#false} is VALID [2022-04-27 11:11:22,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {3245#false} ~cond := #in~cond; {3245#false} is VALID [2022-04-27 11:11:22,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {3245#false} assume 0 == ~cond; {3245#false} is VALID [2022-04-27 11:11:22,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {3245#false} assume !false; {3245#false} is VALID [2022-04-27 11:11:22,759 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:11:22,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:22,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093752455] [2022-04-27 11:11:22,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093752455] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:22,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226668743] [2022-04-27 11:11:22,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:11:22,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:22,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:22,764 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:11:22,785 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:11:22,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:11:22,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:22,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:11:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:22,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:22,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {3244#true} call ULTIMATE.init(); {3244#true} is VALID [2022-04-27 11:11:22,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {3244#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3244#true} is VALID [2022-04-27 11:11:22,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {3244#true} assume true; {3244#true} is VALID [2022-04-27 11:11:22,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3244#true} {3244#true} #72#return; {3244#true} is VALID [2022-04-27 11:11:22,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {3244#true} call #t~ret13 := main(); {3244#true} is VALID [2022-04-27 11:11:22,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {3244#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3249#(= main_~y~0 0)} is VALID [2022-04-27 11:11:22,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {3249#(= 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; {3250#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:22,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {3250#(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; {3251#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:22,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {3251#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3251#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:22,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {3251#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3285#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:22,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {3285#(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; {3289#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:11:22,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-27 11:11:22,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#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; {3245#false} is VALID [2022-04-27 11:11:22,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {3245#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; {3245#false} is VALID [2022-04-27 11:11:22,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {3245#false} assume !(~y~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-27 11:11:22,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {3245#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3245#false} is VALID [2022-04-27 11:11:22,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {3245#false} assume !(~x~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-27 11:11:22,913 INFO L272 TraceCheckUtils]: 17: Hoare triple {3245#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3245#false} is VALID [2022-04-27 11:11:22,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {3245#false} ~cond := #in~cond; {3245#false} is VALID [2022-04-27 11:11:22,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {3245#false} assume 0 == ~cond; {3245#false} is VALID [2022-04-27 11:11:22,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {3245#false} assume !false; {3245#false} is VALID [2022-04-27 11:11:22,913 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:11:22,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:23,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {3245#false} assume !false; {3245#false} is VALID [2022-04-27 11:11:23,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {3245#false} assume 0 == ~cond; {3245#false} is VALID [2022-04-27 11:11:23,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {3245#false} ~cond := #in~cond; {3245#false} is VALID [2022-04-27 11:11:23,032 INFO L272 TraceCheckUtils]: 17: Hoare triple {3245#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3245#false} is VALID [2022-04-27 11:11:23,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {3245#false} assume !(~x~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-27 11:11:23,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {3245#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3245#false} is VALID [2022-04-27 11:11:23,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {3245#false} assume !(~y~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-27 11:11:23,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {3341#(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; {3245#false} is VALID [2022-04-27 11:11:23,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {3345#(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; {3341#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:11:23,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {3349#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3345#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:11:23,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {3353#(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; {3349#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:11:23,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {3244#true} ~z~0 := ~y~0; {3353#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:11:23,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {3244#true} assume !(~x~0 % 4294967296 > 0); {3244#true} is VALID [2022-04-27 11:11:23,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {3244#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; {3244#true} is VALID [2022-04-27 11:11:23,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {3244#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; {3244#true} is VALID [2022-04-27 11:11:23,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {3244#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3244#true} is VALID [2022-04-27 11:11:23,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {3244#true} call #t~ret13 := main(); {3244#true} is VALID [2022-04-27 11:11:23,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3244#true} {3244#true} #72#return; {3244#true} is VALID [2022-04-27 11:11:23,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {3244#true} assume true; {3244#true} is VALID [2022-04-27 11:11:23,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {3244#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3244#true} is VALID [2022-04-27 11:11:23,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {3244#true} call ULTIMATE.init(); {3244#true} is VALID [2022-04-27 11:11:23,038 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:11:23,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226668743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:23,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:23,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-27 11:11:23,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397422915] [2022-04-27 11:11:23,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:23,039 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:11:23,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:23,039 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:11:23,067 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:11:23,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:11:23,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:11:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:11:23,068 INFO L87 Difference]: Start difference. First operand 63 states and 87 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:11:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:23,890 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2022-04-27 11:11:23,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:11:23,890 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:11:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:23,890 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:11:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2022-04-27 11:11:23,892 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:11:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2022-04-27 11:11:23,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 72 transitions. [2022-04-27 11:11:23,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:23,967 INFO L225 Difference]: With dead ends: 97 [2022-04-27 11:11:23,967 INFO L226 Difference]: Without dead ends: 80 [2022-04-27 11:11:23,967 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:11:23,968 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:23,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 45 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:11:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-27 11:11:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2022-04-27 11:11:24,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:24,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:24,094 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:24,094 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:24,097 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2022-04-27 11:11:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2022-04-27 11:11:24,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:24,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:24,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-27 11:11:24,098 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-27 11:11:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:24,100 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2022-04-27 11:11:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2022-04-27 11:11:24,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:24,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:24,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:24,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:24,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-04-27 11:11:24,102 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 21 [2022-04-27 11:11:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:24,102 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-04-27 11:11:24,102 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:11:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-27 11:11:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:11:24,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:24,103 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:11:24,119 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:11:24,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:24,307 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:24,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:24,308 INFO L85 PathProgramCache]: Analyzing trace with hash 323810136, now seen corresponding path program 3 times [2022-04-27 11:11:24,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:24,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732671412] [2022-04-27 11:11:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:24,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:24,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {3816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3807#true} is VALID [2022-04-27 11:11:24,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {3807#true} assume true; {3807#true} is VALID [2022-04-27 11:11:24,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3807#true} {3807#true} #72#return; {3807#true} is VALID [2022-04-27 11:11:24,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {3807#true} call ULTIMATE.init(); {3816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:24,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {3816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3807#true} is VALID [2022-04-27 11:11:24,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {3807#true} assume true; {3807#true} is VALID [2022-04-27 11:11:24,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3807#true} {3807#true} #72#return; {3807#true} is VALID [2022-04-27 11:11:24,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {3807#true} call #t~ret13 := main(); {3807#true} is VALID [2022-04-27 11:11:24,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {3807#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3807#true} is VALID [2022-04-27 11:11:24,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {3807#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; {3812#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:24,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {3812#(<= 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; {3813#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:11:24,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {3813#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3813#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:11:24,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {3813#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {3813#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:11:24,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {3813#(<= (* (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; {3814#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:11:24,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {3814#(<= (+ (* (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; {3815#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:24,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {3815#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3815#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:24,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {3815#(<= (+ 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; {3815#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:24,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {3815#(<= (+ 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; {3815#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:24,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {3815#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3815#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:24,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {3815#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3808#false} is VALID [2022-04-27 11:11:24,395 INFO L272 TraceCheckUtils]: 17: Hoare triple {3808#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3808#false} is VALID [2022-04-27 11:11:24,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {3808#false} ~cond := #in~cond; {3808#false} is VALID [2022-04-27 11:11:24,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {3808#false} assume 0 == ~cond; {3808#false} is VALID [2022-04-27 11:11:24,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {3808#false} assume !false; {3808#false} is VALID [2022-04-27 11:11:24,396 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:11:24,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:24,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732671412] [2022-04-27 11:11:24,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732671412] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:24,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531257106] [2022-04-27 11:11:24,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:11:24,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:24,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:24,400 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:11:24,424 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:11:24,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:11:24,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:24,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 11:11:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:24,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:24,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {3807#true} call ULTIMATE.init(); {3807#true} is VALID [2022-04-27 11:11:24,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {3807#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3807#true} is VALID [2022-04-27 11:11:24,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {3807#true} assume true; {3807#true} is VALID [2022-04-27 11:11:24,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3807#true} {3807#true} #72#return; {3807#true} is VALID [2022-04-27 11:11:24,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {3807#true} call #t~ret13 := main(); {3807#true} is VALID [2022-04-27 11:11:24,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {3807#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3835#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:11:24,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {3835#(= main_~n~0 main_~x~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; {3839#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-27 11:11:24,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {3839#(= (+ main_~x~0 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; {3843#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-27 11:11:24,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {3843#(= main_~n~0 (+ main_~x~0 2))} assume !(~x~0 % 4294967296 > 0); {3843#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-27 11:11:24,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {3843#(= main_~n~0 (+ main_~x~0 2))} ~z~0 := ~y~0; {3843#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-27 11:11:24,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {3843#(= 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; {3839#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-27 11:11:24,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {3839#(= (+ main_~x~0 1) 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; {3835#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:11:24,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {3835#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {3835#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:11:24,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {3835#(= main_~n~0 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; {3835#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:11:24,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {3835#(= main_~n~0 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; {3835#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:11:24,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {3835#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {3868#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:11:24,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {3868#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {3872#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-27 11:11:24,978 INFO L272 TraceCheckUtils]: 17: Hoare triple {3872#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3876#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:11:24,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {3876#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3880#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:11:24,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {3880#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3808#false} is VALID [2022-04-27 11:11:24,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {3808#false} assume !false; {3808#false} is VALID [2022-04-27 11:11:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:11:24,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:25,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {3808#false} assume !false; {3808#false} is VALID [2022-04-27 11:11:25,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {3880#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3808#false} is VALID [2022-04-27 11:11:25,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {3876#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3880#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:11:25,466 INFO L272 TraceCheckUtils]: 17: Hoare triple {3896#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3876#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:11:25,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {3900#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3896#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:11:25,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {3904#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3900#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:11:25,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {3904#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3904#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:25,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {3904#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3904#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:25,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {3904#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3904#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:25,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {3917#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3904#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:25,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {3921#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3917#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:11:25,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {3921#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} ~z~0 := ~y~0; {3921#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:11:25,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {3921#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3921#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:11:25,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {3917#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 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; {3921#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:11:25,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {3904#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod 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; {3917#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:11:25,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {3807#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3904#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:11:25,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {3807#true} call #t~ret13 := main(); {3807#true} is VALID [2022-04-27 11:11:25,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3807#true} {3807#true} #72#return; {3807#true} is VALID [2022-04-27 11:11:25,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {3807#true} assume true; {3807#true} is VALID [2022-04-27 11:11:25,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {3807#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3807#true} is VALID [2022-04-27 11:11:25,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {3807#true} call ULTIMATE.init(); {3807#true} is VALID [2022-04-27 11:11:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:11:25,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531257106] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:25,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:25,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2022-04-27 11:11:25,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279995647] [2022-04-27 11:11:25,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:25,478 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:11:25,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:25,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:25,521 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:11:25,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:11:25,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:25,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:11:25,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:11:25,522 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 19 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:26,423 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-27 11:11:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:11:26,423 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:11:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2022-04-27 11:11:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2022-04-27 11:11:26,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 61 transitions. [2022-04-27 11:11:26,490 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:11:26,490 INFO L225 Difference]: With dead ends: 90 [2022-04-27 11:11:26,491 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 11:11:26,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-04-27 11:11:26,492 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:26,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 62 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:11:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 11:11:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2022-04-27 11:11:26,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:26,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:26,669 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:26,669 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:26,671 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2022-04-27 11:11:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2022-04-27 11:11:26,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:26,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:26,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-27 11:11:26,672 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-27 11:11:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:26,673 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2022-04-27 11:11:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2022-04-27 11:11:26,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:26,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:26,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:26,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-04-27 11:11:26,675 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 21 [2022-04-27 11:11:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:26,675 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-04-27 11:11:26,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-04-27 11:11:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:11:26,676 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:26,676 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:11:26,701 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:11:26,883 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,SelfDestructingSolverStorable10 [2022-04-27 11:11:26,883 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:26,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 4 times [2022-04-27 11:11:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:26,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727238894] [2022-04-27 11:11:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:27,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:27,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {4403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4389#true} is VALID [2022-04-27 11:11:27,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-27 11:11:27,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4389#true} {4389#true} #72#return; {4389#true} is VALID [2022-04-27 11:11:27,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {4389#true} call ULTIMATE.init(); {4403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:27,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {4403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4389#true} is VALID [2022-04-27 11:11:27,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-27 11:11:27,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4389#true} {4389#true} #72#return; {4389#true} is VALID [2022-04-27 11:11:27,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {4389#true} call #t~ret13 := main(); {4389#true} is VALID [2022-04-27 11:11:27,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {4389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4394#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:11:27,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {4394#(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; {4395#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:27,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {4395#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 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; {4396#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:11:27,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {4396#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:27,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:27,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~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; {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:27,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~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; {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:27,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:27,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4398#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:27,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {4398#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4399#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-27 11:11:27,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {4399#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {4399#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-27 11:11:27,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {4399#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4398#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:27,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {4398#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4400#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:11:27,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {4400#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {4400#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:11:27,305 INFO L272 TraceCheckUtils]: 19: Hoare triple {4400#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4401#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:11:27,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {4401#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4402#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:11:27,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4390#false} is VALID [2022-04-27 11:11:27,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {4390#false} assume !false; {4390#false} is VALID [2022-04-27 11:11:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:11:27,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:27,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727238894] [2022-04-27 11:11:27,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727238894] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:27,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856102209] [2022-04-27 11:11:27,306 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:11:27,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:27,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:27,309 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:11:27,310 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:11:27,376 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:11:27,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:27,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 11:11:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:27,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:34,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {4389#true} call ULTIMATE.init(); {4389#true} is VALID [2022-04-27 11:11:34,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {4389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4389#true} is VALID [2022-04-27 11:11:34,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-27 11:11:34,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4389#true} {4389#true} #72#return; {4389#true} is VALID [2022-04-27 11:11:34,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {4389#true} call #t~ret13 := main(); {4389#true} is VALID [2022-04-27 11:11:34,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {4389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4394#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:11:34,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {4394#(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; {4395#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:34,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {4395#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 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; {4428#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:11:34,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {4428#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !(~x~0 % 4294967296 > 0); {4428#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:11:34,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {4428#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} ~z~0 := ~y~0; {4435#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:11:34,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {4435#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4439#(and (<= main_~x~0 (+ 4294967294 (* (div (+ (- 1) main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod main_~x~0 4294967296)) (<= (+ main_~y~0 main_~x~0) (+ main_~n~0 1)))} is VALID [2022-04-27 11:11:34,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {4439#(and (<= main_~x~0 (+ 4294967294 (* (div (+ (- 1) main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod main_~x~0 4294967296)) (<= (+ main_~y~0 main_~x~0) (+ main_~n~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; {4443#(and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) (+ main_~n~0 2)) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:11:34,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {4443#(and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) (+ main_~n~0 2)) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4443#(and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) (+ main_~n~0 2)) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:11:34,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {4443#(and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) (+ main_~n~0 2)) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~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; {4450#(and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= (+ main_~y~0 main_~x~0) (+ main_~n~0 1)) (<= 1 main_~y~0) (<= main_~x~0 (+ (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:34,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {4450#(and (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= (+ main_~y~0 main_~x~0) (+ main_~n~0 1)) (<= 1 main_~y~0) (<= main_~x~0 (+ (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4454#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~y~0 0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:11:34,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {4454#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~y~0 0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !(~y~0 % 4294967296 > 0); {4454#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~y~0 0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:11:34,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {4454#(and (<= 0 main_~y~0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (<= main_~y~0 0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4461#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (< 0 (mod main_~x~0 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:34,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {4461#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (< 0 (mod main_~x~0 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4428#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:11:34,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {4428#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !(~x~0 % 4294967296 > 0); {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:34,759 INFO L272 TraceCheckUtils]: 19: Hoare triple {4397#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4471#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:11:34,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {4471#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4475#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:11:34,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {4475#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4390#false} is VALID [2022-04-27 11:11:34,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {4390#false} assume !false; {4390#false} is VALID [2022-04-27 11:11:34,760 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:11:34,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:36,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {4390#false} assume !false; {4390#false} is VALID [2022-04-27 11:11:36,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {4475#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4390#false} is VALID [2022-04-27 11:11:36,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {4471#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4475#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:11:36,264 INFO L272 TraceCheckUtils]: 19: Hoare triple {4400#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4471#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:11:36,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {4494#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {4400#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:11:36,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {4498#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4494#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:11:36,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {4502#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4498#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:11:36,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {4502#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4502#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:11:36,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {4509#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 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; {4502#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:11:36,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {4513#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~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; {4509#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:11:36,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {4513#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4513#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:11:36,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {4520#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) 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; {4513#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:11:36,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {4524#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) 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; {4520#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:11:36,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {4528#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {4524#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:11:36,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {4528#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {4528#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:11:36,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {4535#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 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; {4528#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:11:36,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {4539#(or (<= (mod (+ main_~y~0 2) 4294967296) 0) (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 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; {4535#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:11:36,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {4389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4539#(or (<= (mod (+ main_~y~0 2) 4294967296) 0) (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:11:36,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {4389#true} call #t~ret13 := main(); {4389#true} is VALID [2022-04-27 11:11:36,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4389#true} {4389#true} #72#return; {4389#true} is VALID [2022-04-27 11:11:36,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-27 11:11:36,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {4389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4389#true} is VALID [2022-04-27 11:11:36,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {4389#true} call ULTIMATE.init(); {4389#true} is VALID [2022-04-27 11:11:36,282 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:11:36,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856102209] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:36,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:36,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 31 [2022-04-27 11:11:36,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231974645] [2022-04-27 11:11:36,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:36,283 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 28 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:11:36,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:36,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 28 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:11:36,672 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:11:36,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 11:11:36,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:36,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 11:11:36,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:11:36,673 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 31 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 28 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:11:43,813 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:11:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:48,341 INFO L93 Difference]: Finished difference Result 140 states and 185 transitions. [2022-04-27 11:11:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-27 11:11:48,342 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 28 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:11:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 28 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:11:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-04-27 11:11:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 28 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:11:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-04-27 11:11:48,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 117 transitions. [2022-04-27 11:11:48,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:48,773 INFO L225 Difference]: With dead ends: 140 [2022-04-27 11:11:48,773 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 11:11:48,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=972, Invalid=4880, Unknown=0, NotChecked=0, Total=5852 [2022-04-27 11:11:48,775 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 138 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 178 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:48,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 91 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 526 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-04-27 11:11:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 11:11:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2022-04-27 11:11:48,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:48,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 93 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:48,979 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 93 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:48,979 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 93 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:48,981 INFO L93 Difference]: Finished difference Result 119 states and 159 transitions. [2022-04-27 11:11:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 159 transitions. [2022-04-27 11:11:48,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:48,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:48,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-27 11:11:48,982 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-27 11:11:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:48,985 INFO L93 Difference]: Finished difference Result 119 states and 159 transitions. [2022-04-27 11:11:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 159 transitions. [2022-04-27 11:11:48,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:48,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:48,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:48,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2022-04-27 11:11:48,988 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 23 [2022-04-27 11:11:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:48,988 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2022-04-27 11:11:48,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 28 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:11:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2022-04-27 11:11:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:11:48,989 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:48,989 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:11:49,007 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:11:49,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:49,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:49,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:49,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1283424344, now seen corresponding path program 4 times [2022-04-27 11:11:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:49,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958527196] [2022-04-27 11:11:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:49,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:49,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {5229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5218#true} is VALID [2022-04-27 11:11:49,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {5218#true} assume true; {5218#true} is VALID [2022-04-27 11:11:49,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5218#true} {5218#true} #72#return; {5218#true} is VALID [2022-04-27 11:11:49,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {5218#true} call ULTIMATE.init(); {5229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:49,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {5229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5218#true} is VALID [2022-04-27 11:11:49,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {5218#true} assume true; {5218#true} is VALID [2022-04-27 11:11:49,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5218#true} {5218#true} #72#return; {5218#true} is VALID [2022-04-27 11:11:49,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {5218#true} call #t~ret13 := main(); {5218#true} is VALID [2022-04-27 11:11:49,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {5218#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5223#(= main_~y~0 0)} is VALID [2022-04-27 11:11:49,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {5223#(= 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; {5224#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:49,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {5224#(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; {5225#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:49,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {5225#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5225#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:49,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5226#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:11:49,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {5226#(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; {5227#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:11:49,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {5227#(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; {5228#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:11:49,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {5228#(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; {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {5219#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; {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {5219#false} assume !(~z~0 % 4294967296 > 0); {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {5219#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; {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {5219#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; {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {5219#false} assume !(~y~0 % 4294967296 > 0); {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {5219#false} assume !(~x~0 % 4294967296 > 0); {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L272 TraceCheckUtils]: 19: Hoare triple {5219#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {5219#false} ~cond := #in~cond; {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {5219#false} assume 0 == ~cond; {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {5219#false} assume !false; {5219#false} is VALID [2022-04-27 11:11:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:11:49,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:49,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958527196] [2022-04-27 11:11:49,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958527196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:49,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628241168] [2022-04-27 11:11:49,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:11:49,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:49,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:49,308 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:11:49,309 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:11:49,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:11:49,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:49,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:11:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:49,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:49,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {5218#true} call ULTIMATE.init(); {5218#true} is VALID [2022-04-27 11:11:49,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {5218#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5218#true} is VALID [2022-04-27 11:11:49,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {5218#true} assume true; {5218#true} is VALID [2022-04-27 11:11:49,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5218#true} {5218#true} #72#return; {5218#true} is VALID [2022-04-27 11:11:49,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {5218#true} call #t~ret13 := main(); {5218#true} is VALID [2022-04-27 11:11:49,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {5218#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5223#(= main_~y~0 0)} is VALID [2022-04-27 11:11:49,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {5223#(= 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; {5224#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:49,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {5224#(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; {5225#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:49,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {5225#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5225#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:49,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5260#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:49,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {5260#(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; {5264#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:11:49,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {5264#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5268#(and (= main_~y~0 (+ main_~z~0 2)) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:49,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {5268#(and (= main_~y~0 (+ main_~z~0 2)) (<= 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; {5219#false} is VALID [2022-04-27 11:11:49,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {5219#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; {5219#false} is VALID [2022-04-27 11:11:49,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {5219#false} assume !(~z~0 % 4294967296 > 0); {5219#false} is VALID [2022-04-27 11:11:49,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {5219#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; {5219#false} is VALID [2022-04-27 11:11:49,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {5219#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; {5219#false} is VALID [2022-04-27 11:11:49,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {5219#false} assume !(~y~0 % 4294967296 > 0); {5219#false} is VALID [2022-04-27 11:11:49,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {5219#false} assume !(~x~0 % 4294967296 > 0); {5219#false} is VALID [2022-04-27 11:11:49,465 INFO L272 TraceCheckUtils]: 19: Hoare triple {5219#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5219#false} is VALID [2022-04-27 11:11:49,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {5219#false} ~cond := #in~cond; {5219#false} is VALID [2022-04-27 11:11:49,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {5219#false} assume 0 == ~cond; {5219#false} is VALID [2022-04-27 11:11:49,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {5219#false} assume !false; {5219#false} is VALID [2022-04-27 11:11:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:11:49,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:49,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {5219#false} assume !false; {5219#false} is VALID [2022-04-27 11:11:49,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {5219#false} assume 0 == ~cond; {5219#false} is VALID [2022-04-27 11:11:49,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {5219#false} ~cond := #in~cond; {5219#false} is VALID [2022-04-27 11:11:49,613 INFO L272 TraceCheckUtils]: 19: Hoare triple {5219#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5219#false} is VALID [2022-04-27 11:11:49,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {5219#false} assume !(~x~0 % 4294967296 > 0); {5219#false} is VALID [2022-04-27 11:11:49,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {5317#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5219#false} is VALID [2022-04-27 11:11:49,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {5321#(< 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; {5317#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:11:49,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {5325#(< 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; {5321#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:11:49,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {5325#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5325#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:11:49,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {5325#(< 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; {5325#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:11:49,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {5335#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5325#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:11:49,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {5339#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5335#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:11:49,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {5343#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5339#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:11:49,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {5218#true} ~z~0 := ~y~0; {5343#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:11:49,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {5218#true} assume !(~x~0 % 4294967296 > 0); {5218#true} is VALID [2022-04-27 11:11:49,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {5218#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; {5218#true} is VALID [2022-04-27 11:11:49,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {5218#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; {5218#true} is VALID [2022-04-27 11:11:49,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {5218#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5218#true} is VALID [2022-04-27 11:11:49,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {5218#true} call #t~ret13 := main(); {5218#true} is VALID [2022-04-27 11:11:49,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5218#true} {5218#true} #72#return; {5218#true} is VALID [2022-04-27 11:11:49,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {5218#true} assume true; {5218#true} is VALID [2022-04-27 11:11:49,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {5218#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5218#true} is VALID [2022-04-27 11:11:49,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {5218#true} call ULTIMATE.init(); {5218#true} is VALID [2022-04-27 11:11:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:11:49,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628241168] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:49,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:49,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-27 11:11:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799824217] [2022-04-27 11:11:49,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:49,622 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:11:49,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:49,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:49,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:49,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:11:49,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:11:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:11:49,658 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:50,542 INFO L93 Difference]: Finished difference Result 115 states and 152 transitions. [2022-04-27 11:11:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 11:11:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:11:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2022-04-27 11:11:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2022-04-27 11:11:50,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 73 transitions. [2022-04-27 11:11:50,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:50,631 INFO L225 Difference]: With dead ends: 115 [2022-04-27 11:11:50,631 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 11:11:50,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:11:50,632 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 91 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:50,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 53 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:11:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 11:11:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2022-04-27 11:11:50,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:50,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:50,795 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:50,795 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:50,797 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2022-04-27 11:11:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 123 transitions. [2022-04-27 11:11:50,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:50,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:50,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-27 11:11:50,798 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-27 11:11:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:50,799 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2022-04-27 11:11:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 123 transitions. [2022-04-27 11:11:50,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:50,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:50,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:50,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2022-04-27 11:11:50,802 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 23 [2022-04-27 11:11:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:50,802 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2022-04-27 11:11:50,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2022-04-27 11:11:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:11:50,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:50,803 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:11:50,826 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:11:51,017 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,SelfDestructingSolverStorable12 [2022-04-27 11:11:51,017 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1347388208, now seen corresponding path program 5 times [2022-04-27 11:11:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:51,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939838498] [2022-04-27 11:11:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:51,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {5882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5871#true} is VALID [2022-04-27 11:11:51,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {5871#true} assume true; {5871#true} is VALID [2022-04-27 11:11:51,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5871#true} {5871#true} #72#return; {5871#true} is VALID [2022-04-27 11:11:51,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {5871#true} call ULTIMATE.init(); {5882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:51,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {5882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5871#true} is VALID [2022-04-27 11:11:51,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#true} assume true; {5871#true} is VALID [2022-04-27 11:11:51,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#true} {5871#true} #72#return; {5871#true} is VALID [2022-04-27 11:11:51,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#true} call #t~ret13 := main(); {5871#true} is VALID [2022-04-27 11:11:51,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {5871#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5871#true} is VALID [2022-04-27 11:11:51,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {5871#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; {5876#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:51,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {5876#(<= 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; {5877#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:11:51,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {5877#(<= 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; {5878#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:11:51,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {5878#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5878#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:11:51,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {5878#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {5878#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:11:51,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {5878#(<= (* 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; {5879#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:11:51,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {5879#(<= (+ (* (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; {5880#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:11:51,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {5880#(<= (+ 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; {5881#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:51,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {5881#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5881#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:51,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {5881#(<= (+ 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; {5881#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:51,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {5881#(<= (+ 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; {5881#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:51,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {5881#(<= (+ 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; {5881#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:51,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {5881#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5881#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:11:51,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {5881#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5872#false} is VALID [2022-04-27 11:11:51,142 INFO L272 TraceCheckUtils]: 20: Hoare triple {5872#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5872#false} is VALID [2022-04-27 11:11:51,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {5872#false} ~cond := #in~cond; {5872#false} is VALID [2022-04-27 11:11:51,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {5872#false} assume 0 == ~cond; {5872#false} is VALID [2022-04-27 11:11:51,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {5872#false} assume !false; {5872#false} is VALID [2022-04-27 11:11:51,142 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:11:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:51,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939838498] [2022-04-27 11:11:51,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939838498] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:51,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835194571] [2022-04-27 11:11:51,143 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:11:51,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:51,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:51,144 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:11:51,145 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:11:51,197 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-27 11:11:51,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:51,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:11:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:51,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:51,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {5871#true} call ULTIMATE.init(); {5871#true} is VALID [2022-04-27 11:11:51,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {5871#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5871#true} is VALID [2022-04-27 11:11:51,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#true} assume true; {5871#true} is VALID [2022-04-27 11:11:51,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#true} {5871#true} #72#return; {5871#true} is VALID [2022-04-27 11:11:51,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#true} call #t~ret13 := main(); {5871#true} is VALID [2022-04-27 11:11:51,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {5871#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5871#true} is VALID [2022-04-27 11:11:51,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {5871#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; {5876#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:51,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {5876#(<= 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; {5907#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:11:51,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {5907#(<= 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; {5911#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {5911#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5911#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {5911#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {5911#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {5911#(<= 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; {5907#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:11:51,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {5907#(<= 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; {5876#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:51,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {5876#(<= 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; {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {5927#(<= 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; {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {5927#(<= 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; {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {5927#(<= 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; {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5872#false} is VALID [2022-04-27 11:11:51,519 INFO L272 TraceCheckUtils]: 20: Hoare triple {5872#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5872#false} is VALID [2022-04-27 11:11:51,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {5872#false} ~cond := #in~cond; {5872#false} is VALID [2022-04-27 11:11:51,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {5872#false} assume 0 == ~cond; {5872#false} is VALID [2022-04-27 11:11:51,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {5872#false} assume !false; {5872#false} is VALID [2022-04-27 11:11:51,519 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:11:51,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:51,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {5872#false} assume !false; {5872#false} is VALID [2022-04-27 11:11:51,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {5872#false} assume 0 == ~cond; {5872#false} is VALID [2022-04-27 11:11:51,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {5872#false} ~cond := #in~cond; {5872#false} is VALID [2022-04-27 11:11:51,626 INFO L272 TraceCheckUtils]: 20: Hoare triple {5872#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5872#false} is VALID [2022-04-27 11:11:51,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5872#false} is VALID [2022-04-27 11:11:51,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {5927#(<= 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; {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {5927#(<= 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; {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {5927#(<= 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; {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {5876#(<= 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; {5927#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {5907#(<= 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; {5876#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:51,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {5911#(<= 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; {5907#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:11:51,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {5911#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {5911#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {5911#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5911#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {5907#(<= 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; {5911#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:11:51,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {5876#(<= 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; {5907#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:11:51,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {5871#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; {5876#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:51,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {5871#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5871#true} is VALID [2022-04-27 11:11:51,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#true} call #t~ret13 := main(); {5871#true} is VALID [2022-04-27 11:11:51,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#true} {5871#true} #72#return; {5871#true} is VALID [2022-04-27 11:11:51,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#true} assume true; {5871#true} is VALID [2022-04-27 11:11:51,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {5871#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5871#true} is VALID [2022-04-27 11:11:51,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {5871#true} call ULTIMATE.init(); {5871#true} is VALID [2022-04-27 11:11:51,635 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:11:51,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835194571] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:51,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:51,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-27 11:11:51,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510505877] [2022-04-27 11:11:51,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:51,636 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:11:51,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:51,637 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:11:51,668 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:11:51,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:11:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:51,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:11:51,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:11:51,669 INFO L87 Difference]: Start difference. First operand 77 states and 103 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:11:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:52,253 INFO L93 Difference]: Finished difference Result 102 states and 139 transitions. [2022-04-27 11:11:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:11:52,254 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:11:52,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:52,254 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:11:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-27 11:11:52,255 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:11:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-27 11:11:52,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-27 11:11:52,309 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:11:52,310 INFO L225 Difference]: With dead ends: 102 [2022-04-27 11:11:52,310 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 11:11:52,310 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:11:52,311 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:52,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 51 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:11:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 11:11:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-04-27 11:11:52,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:52,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:52,502 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:52,502 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:52,504 INFO L93 Difference]: Finished difference Result 97 states and 132 transitions. [2022-04-27 11:11:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2022-04-27 11:11:52,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:52,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:52,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-27 11:11:52,505 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-27 11:11:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:52,506 INFO L93 Difference]: Finished difference Result 97 states and 132 transitions. [2022-04-27 11:11:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2022-04-27 11:11:52,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:52,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:52,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:52,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 87 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2022-04-27 11:11:52,509 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 24 [2022-04-27 11:11:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:52,509 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2022-04-27 11:11:52,509 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:11:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2022-04-27 11:11:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:11:52,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:52,510 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:11:52,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-27 11:11:52,732 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,SelfDestructingSolverStorable13 [2022-04-27 11:11:52,732 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1108300783, now seen corresponding path program 5 times [2022-04-27 11:11:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:52,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012450876] [2022-04-27 11:11:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:52,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:52,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {6525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6511#true} is VALID [2022-04-27 11:11:52,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {6511#true} assume true; {6511#true} is VALID [2022-04-27 11:11:52,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6511#true} {6511#true} #72#return; {6511#true} is VALID [2022-04-27 11:11:52,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {6511#true} call ULTIMATE.init(); {6525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:52,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {6525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6511#true} is VALID [2022-04-27 11:11:52,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {6511#true} assume true; {6511#true} is VALID [2022-04-27 11:11:52,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6511#true} {6511#true} #72#return; {6511#true} is VALID [2022-04-27 11:11:52,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {6511#true} call #t~ret13 := main(); {6511#true} is VALID [2022-04-27 11:11:52,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {6511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6516#(= main_~y~0 0)} is VALID [2022-04-27 11:11:52,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {6516#(= 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; {6517#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:52,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {6517#(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; {6518#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:52,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {6518#(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; {6519#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:11:52,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {6519#(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; {6520#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:11:52,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {6520#(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; {6521#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:52,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {6521#(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; {6522#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:11:52,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {6522#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6522#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:11:52,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {6522#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6523#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:11:52,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {6523#(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; {6524#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:11:52,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {6524#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6512#false} is VALID [2022-04-27 11:11:52,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {6512#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; {6512#false} is VALID [2022-04-27 11:11:52,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {6512#false} assume !(~y~0 % 4294967296 > 0); {6512#false} is VALID [2022-04-27 11:11:52,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {6512#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6512#false} is VALID [2022-04-27 11:11:52,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {6512#false} assume !(~x~0 % 4294967296 > 0); {6512#false} is VALID [2022-04-27 11:11:52,902 INFO L272 TraceCheckUtils]: 20: Hoare triple {6512#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6512#false} is VALID [2022-04-27 11:11:52,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {6512#false} ~cond := #in~cond; {6512#false} is VALID [2022-04-27 11:11:52,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {6512#false} assume 0 == ~cond; {6512#false} is VALID [2022-04-27 11:11:52,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {6512#false} assume !false; {6512#false} is VALID [2022-04-27 11:11:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:11:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:52,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012450876] [2022-04-27 11:11:52,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012450876] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:52,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906750992] [2022-04-27 11:11:52,903 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:11:52,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:52,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:52,904 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:11:52,904 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:11:52,948 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:11:52,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:52,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 11:11:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:52,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:53,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {6511#true} call ULTIMATE.init(); {6511#true} is VALID [2022-04-27 11:11:53,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {6511#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6511#true} is VALID [2022-04-27 11:11:53,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {6511#true} assume true; {6511#true} is VALID [2022-04-27 11:11:53,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6511#true} {6511#true} #72#return; {6511#true} is VALID [2022-04-27 11:11:53,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {6511#true} call #t~ret13 := main(); {6511#true} is VALID [2022-04-27 11:11:53,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {6511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6516#(= main_~y~0 0)} is VALID [2022-04-27 11:11:53,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {6516#(= 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; {6517#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:53,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {6517#(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; {6518#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:53,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {6518#(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; {6519#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:11:53,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {6519#(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; {6520#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:11:53,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {6520#(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; {6521#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:53,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {6521#(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; {6522#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:11:53,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {6522#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6522#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:11:53,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {6522#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6523#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:11:53,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {6523#(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; {6571#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:11:53,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {6571#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6512#false} is VALID [2022-04-27 11:11:53,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {6512#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; {6512#false} is VALID [2022-04-27 11:11:53,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {6512#false} assume !(~y~0 % 4294967296 > 0); {6512#false} is VALID [2022-04-27 11:11:53,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {6512#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6512#false} is VALID [2022-04-27 11:11:53,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {6512#false} assume !(~x~0 % 4294967296 > 0); {6512#false} is VALID [2022-04-27 11:11:53,151 INFO L272 TraceCheckUtils]: 20: Hoare triple {6512#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6512#false} is VALID [2022-04-27 11:11:53,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {6512#false} ~cond := #in~cond; {6512#false} is VALID [2022-04-27 11:11:53,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {6512#false} assume 0 == ~cond; {6512#false} is VALID [2022-04-27 11:11:53,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {6512#false} assume !false; {6512#false} is VALID [2022-04-27 11:11:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:11:53,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:53,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {6512#false} assume !false; {6512#false} is VALID [2022-04-27 11:11:53,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {6512#false} assume 0 == ~cond; {6512#false} is VALID [2022-04-27 11:11:53,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {6512#false} ~cond := #in~cond; {6512#false} is VALID [2022-04-27 11:11:53,348 INFO L272 TraceCheckUtils]: 20: Hoare triple {6512#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6512#false} is VALID [2022-04-27 11:11:53,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {6512#false} assume !(~x~0 % 4294967296 > 0); {6512#false} is VALID [2022-04-27 11:11:53,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {6512#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6512#false} is VALID [2022-04-27 11:11:53,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {6512#false} assume !(~y~0 % 4294967296 > 0); {6512#false} is VALID [2022-04-27 11:11:53,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {6512#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; {6512#false} is VALID [2022-04-27 11:11:53,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {6623#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6512#false} is VALID [2022-04-27 11:11:53,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {6627#(< 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; {6623#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:11:53,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {6631#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {6627#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:11:53,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {6631#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6631#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:11:53,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {6638#(< 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; {6631#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:11:53,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {6642#(< 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; {6638#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:11:53,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {6646#(< 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; {6642#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:11:53,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {6650#(< 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; {6646#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:11:53,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {6654#(< 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; {6650#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:11:53,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {6658#(< 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; {6654#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:11:53,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {6511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6658#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:11:53,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {6511#true} call #t~ret13 := main(); {6511#true} is VALID [2022-04-27 11:11:53,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6511#true} {6511#true} #72#return; {6511#true} is VALID [2022-04-27 11:11:53,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {6511#true} assume true; {6511#true} is VALID [2022-04-27 11:11:53,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {6511#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6511#true} is VALID [2022-04-27 11:11:53,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {6511#true} call ULTIMATE.init(); {6511#true} is VALID [2022-04-27 11:11:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:11:53,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906750992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:53,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:53,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-27 11:11:53,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773549597] [2022-04-27 11:11:53,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:53,358 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (4), 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:11:53,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:53,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (4), 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:11:53,389 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:11:53,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:11:53,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:53,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:11:53,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:11:53,390 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (4), 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:12:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:01,083 INFO L93 Difference]: Finished difference Result 296 states and 424 transitions. [2022-04-27 11:12:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-27 11:12:01,083 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (4), 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:12:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:12:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (4), 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:12:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 237 transitions. [2022-04-27 11:12:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (4), 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:12:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 237 transitions. [2022-04-27 11:12:01,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 237 transitions. [2022-04-27 11:12:01,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:01,725 INFO L225 Difference]: With dead ends: 296 [2022-04-27 11:12:01,725 INFO L226 Difference]: Without dead ends: 270 [2022-04-27 11:12:01,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2412 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1734, Invalid=5406, Unknown=0, NotChecked=0, Total=7140 [2022-04-27 11:12:01,727 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 349 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:12:01,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 84 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 11:12:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-27 11:12:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 109. [2022-04-27 11:12:02,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:12:02,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 109 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:02,036 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 109 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:02,036 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 109 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:02,042 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2022-04-27 11:12:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 363 transitions. [2022-04-27 11:12:02,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:02,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:02,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 270 states. [2022-04-27 11:12:02,043 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 270 states. [2022-04-27 11:12:02,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:02,050 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2022-04-27 11:12:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 363 transitions. [2022-04-27 11:12:02,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:02,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:02,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:12:02,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:12:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2022-04-27 11:12:02,053 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 24 [2022-04-27 11:12:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:12:02,053 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2022-04-27 11:12:02,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (4), 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:12:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2022-04-27 11:12:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:12:02,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:12:02,054 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:12:02,081 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:12:02,268 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,SelfDestructingSolverStorable14 [2022-04-27 11:12:02,268 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:12:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:12:02,268 INFO L85 PathProgramCache]: Analyzing trace with hash 467119846, now seen corresponding path program 6 times [2022-04-27 11:12:02,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:12:02,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25200044] [2022-04-27 11:12:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:12:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:12:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:02,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:12:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:02,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {7922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7910#true} is VALID [2022-04-27 11:12:02,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-27 11:12:02,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7910#true} {7910#true} #72#return; {7910#true} is VALID [2022-04-27 11:12:02,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {7910#true} call ULTIMATE.init(); {7922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:12:02,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {7922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7910#true} is VALID [2022-04-27 11:12:02,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-27 11:12:02,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7910#true} {7910#true} #72#return; {7910#true} is VALID [2022-04-27 11:12:02,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {7910#true} call #t~ret13 := main(); {7910#true} is VALID [2022-04-27 11:12:02,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {7910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7915#(= main_~y~0 0)} is VALID [2022-04-27 11:12:02,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {7915#(= 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; {7916#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:02,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {7916#(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; {7917#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:02,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {7917#(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; {7918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:02,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {7918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:02,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {7918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {7919#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:12:02,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {7919#(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; {7920#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:12:02,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {7920#(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; {7921#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:12:02,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {7921#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7911#false} is VALID [2022-04-27 11:12:02,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {7911#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; {7911#false} is VALID [2022-04-27 11:12:02,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {7911#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; {7911#false} is VALID [2022-04-27 11:12:02,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {7911#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; {7911#false} is VALID [2022-04-27 11:12:02,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {7911#false} assume !(~y~0 % 4294967296 > 0); {7911#false} is VALID [2022-04-27 11:12:02,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {7911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7911#false} is VALID [2022-04-27 11:12:02,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {7911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7911#false} is VALID [2022-04-27 11:12:02,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {7911#false} assume !(~x~0 % 4294967296 > 0); {7911#false} is VALID [2022-04-27 11:12:02,380 INFO L272 TraceCheckUtils]: 21: Hoare triple {7911#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7911#false} is VALID [2022-04-27 11:12:02,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {7911#false} ~cond := #in~cond; {7911#false} is VALID [2022-04-27 11:12:02,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {7911#false} assume 0 == ~cond; {7911#false} is VALID [2022-04-27 11:12:02,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {7911#false} assume !false; {7911#false} is VALID [2022-04-27 11:12:02,380 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:12:02,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:12:02,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25200044] [2022-04-27 11:12:02,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25200044] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:12:02,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501045081] [2022-04-27 11:12:02,380 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:12:02,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:12:02,381 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:12:02,382 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:12:02,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:12:02,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:12:02,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:12:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:02,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:12:02,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {7910#true} call ULTIMATE.init(); {7910#true} is VALID [2022-04-27 11:12:02,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {7910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7910#true} is VALID [2022-04-27 11:12:02,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-27 11:12:02,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7910#true} {7910#true} #72#return; {7910#true} is VALID [2022-04-27 11:12:02,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {7910#true} call #t~ret13 := main(); {7910#true} is VALID [2022-04-27 11:12:02,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {7910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7915#(= main_~y~0 0)} is VALID [2022-04-27 11:12:02,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {7915#(= 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; {7916#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:02,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {7916#(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; {7917#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:02,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {7917#(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; {7918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:02,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {7918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:02,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {7918#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {7956#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:02,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {7956#(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; {7960#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:12:02,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {7960#(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; {7964#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:12:02,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {7964#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !(~z~0 % 4294967296 > 0); {7911#false} is VALID [2022-04-27 11:12:02,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {7911#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; {7911#false} is VALID [2022-04-27 11:12:02,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {7911#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; {7911#false} is VALID [2022-04-27 11:12:02,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {7911#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; {7911#false} is VALID [2022-04-27 11:12:02,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {7911#false} assume !(~y~0 % 4294967296 > 0); {7911#false} is VALID [2022-04-27 11:12:02,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {7911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7911#false} is VALID [2022-04-27 11:12:02,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {7911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7911#false} is VALID [2022-04-27 11:12:02,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {7911#false} assume !(~x~0 % 4294967296 > 0); {7911#false} is VALID [2022-04-27 11:12:02,557 INFO L272 TraceCheckUtils]: 21: Hoare triple {7911#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7911#false} is VALID [2022-04-27 11:12:02,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {7911#false} ~cond := #in~cond; {7911#false} is VALID [2022-04-27 11:12:02,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {7911#false} assume 0 == ~cond; {7911#false} is VALID [2022-04-27 11:12:02,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {7911#false} assume !false; {7911#false} is VALID [2022-04-27 11:12:02,558 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:12:02,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:12:02,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {7911#false} assume !false; {7911#false} is VALID [2022-04-27 11:12:02,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {7911#false} assume 0 == ~cond; {7911#false} is VALID [2022-04-27 11:12:02,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {7911#false} ~cond := #in~cond; {7911#false} is VALID [2022-04-27 11:12:02,730 INFO L272 TraceCheckUtils]: 21: Hoare triple {7911#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7911#false} is VALID [2022-04-27 11:12:02,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {7911#false} assume !(~x~0 % 4294967296 > 0); {7911#false} is VALID [2022-04-27 11:12:02,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {7911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7911#false} is VALID [2022-04-27 11:12:02,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {7911#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7911#false} is VALID [2022-04-27 11:12:02,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {7911#false} assume !(~y~0 % 4294967296 > 0); {7911#false} is VALID [2022-04-27 11:12:02,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {8025#(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; {7911#false} is VALID [2022-04-27 11:12:02,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {8029#(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; {8025#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:12:02,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {8033#(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; {8029#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:12:02,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {8037#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8033#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:12:02,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {8041#(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; {8037#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:12:02,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {8045#(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; {8041#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:12:02,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {7910#true} ~z~0 := ~y~0; {8045#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:12:02,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {7910#true} assume !(~x~0 % 4294967296 > 0); {7910#true} is VALID [2022-04-27 11:12:02,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {7910#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; {7910#true} is VALID [2022-04-27 11:12:02,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {7910#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; {7910#true} is VALID [2022-04-27 11:12:02,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {7910#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; {7910#true} is VALID [2022-04-27 11:12:02,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {7910#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7910#true} is VALID [2022-04-27 11:12:02,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {7910#true} call #t~ret13 := main(); {7910#true} is VALID [2022-04-27 11:12:02,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7910#true} {7910#true} #72#return; {7910#true} is VALID [2022-04-27 11:12:02,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-27 11:12:02,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {7910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7910#true} is VALID [2022-04-27 11:12:02,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {7910#true} call ULTIMATE.init(); {7910#true} is VALID [2022-04-27 11:12:02,737 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:12:02,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501045081] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:12:02,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:12:02,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-27 11:12:02,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080357487] [2022-04-27 11:12:02,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:12:02,738 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:12:02,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:12:02,738 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:12:02,770 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:12:02,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:12:02,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:12:02,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:12:02,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:12:02,771 INFO L87 Difference]: Start difference. First operand 109 states and 147 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:12:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:04,468 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2022-04-27 11:12:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 11:12:04,468 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:12:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:12:04,468 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:12:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 89 transitions. [2022-04-27 11:12:04,470 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:12:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 89 transitions. [2022-04-27 11:12:04,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 89 transitions. [2022-04-27 11:12:04,569 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:12:04,571 INFO L225 Difference]: With dead ends: 164 [2022-04-27 11:12:04,571 INFO L226 Difference]: Without dead ends: 144 [2022-04-27 11:12:04,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:12:04,573 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:12:04,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 71 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:12:04,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-27 11:12:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 105. [2022-04-27 11:12:04,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:12:04,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 105 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:04,906 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 105 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:04,907 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 105 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:04,909 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2022-04-27 11:12:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2022-04-27 11:12:04,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:04,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:04,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-27 11:12:04,910 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-27 11:12:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:04,913 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2022-04-27 11:12:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2022-04-27 11:12:04,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:04,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:04,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:12:04,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:12:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2022-04-27 11:12:04,916 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 25 [2022-04-27 11:12:04,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:12:04,916 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2022-04-27 11:12:04,916 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:12:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2022-04-27 11:12:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:12:04,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:12:04,918 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:12:04,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-27 11:12:05,119 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,SelfDestructingSolverStorable15 [2022-04-27 11:12:05,119 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:12:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:12:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -828351928, now seen corresponding path program 7 times [2022-04-27 11:12:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:12:05,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695495529] [2022-04-27 11:12:05,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:12:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:12:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:05,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:12:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:05,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {8818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8801#true} is VALID [2022-04-27 11:12:05,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {8801#true} assume true; {8801#true} is VALID [2022-04-27 11:12:05,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8801#true} {8801#true} #72#return; {8801#true} is VALID [2022-04-27 11:12:05,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {8801#true} call ULTIMATE.init(); {8818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:12:05,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {8818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8801#true} is VALID [2022-04-27 11:12:05,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {8801#true} assume true; {8801#true} is VALID [2022-04-27 11:12:05,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8801#true} {8801#true} #72#return; {8801#true} is VALID [2022-04-27 11:12:05,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {8801#true} call #t~ret13 := main(); {8801#true} is VALID [2022-04-27 11:12:05,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {8801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8806#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:12:05,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {8806#(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; {8807#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:05,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {8807#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~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; {8808#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:12:05,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {8808#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {8809#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-27 11:12:05,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {8809#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {8810#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-27 11:12:05,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {8810#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {8810#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-27 11:12:05,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {8810#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) 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; {8811#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-27 11:12:05,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {8811#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~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; {8811#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-27 11:12:05,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {8811#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~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; {8811#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-27 11:12:05,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {8811#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !(~z~0 % 4294967296 > 0); {8811#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-27 11:12:05,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {8811#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8812#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:05,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {8812#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8813#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:05,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {8813#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8814#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:05,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {8814#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {8814#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:05,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {8814#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8813#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:05,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {8813#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8812#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:05,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {8812#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8815#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:12:05,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {8815#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {8815#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:12:05,621 INFO L272 TraceCheckUtils]: 23: Hoare triple {8815#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8816#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:12:05,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {8816#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8817#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:12:05,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {8817#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8802#false} is VALID [2022-04-27 11:12:05,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {8802#false} assume !false; {8802#false} is VALID [2022-04-27 11:12:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:12:05,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:12:05,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695495529] [2022-04-27 11:12:05,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695495529] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:12:05,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389946411] [2022-04-27 11:12:05,622 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:12:05,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:05,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:12:05,623 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:12:05,624 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:12:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:05,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-27 11:12:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:05,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:12:14,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {8801#true} call ULTIMATE.init(); {8801#true} is VALID [2022-04-27 11:12:14,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {8801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8801#true} is VALID [2022-04-27 11:12:14,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {8801#true} assume true; {8801#true} is VALID [2022-04-27 11:12:14,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8801#true} {8801#true} #72#return; {8801#true} is VALID [2022-04-27 11:12:14,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {8801#true} call #t~ret13 := main(); {8801#true} is VALID [2022-04-27 11:12:14,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {8801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8806#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:12:14,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {8806#(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; {8807#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:14,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {8807#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~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; {8843#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:12:14,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {8843#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {8847#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:14,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {8847#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {8851#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:14,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {8851#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} ~z~0 := ~y~0; {8855#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:14,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {8855#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~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; {8859#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= main_~y~0 3) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:12:14,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {8859#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= main_~y~0 3) (<= (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; {8863#(and (<= main_~x~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 3) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-27 11:12:14,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {8863#(and (<= main_~x~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 3) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~x~0 1) 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; {8867#(and (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:12:14,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {8867#(and (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !(~z~0 % 4294967296 > 0); {8867#(and (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:12:14,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {8867#(and (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8874#(and (<= main_~y~0 2) (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:14,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {8874#(and (<= main_~y~0 2) (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~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; {8878#(and (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~x~0 (+ (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:14,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {8878#(and (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~x~0 (+ (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8882#(and (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~y~0 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:12:14,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {8882#(and (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~y~0 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !(~y~0 % 4294967296 > 0); {8882#(and (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~y~0 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:12:14,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {8882#(and (<= main_~x~0 main_~n~0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (<= main_~y~0 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8889#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:14,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {8889#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8893#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:12:14,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {8893#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8851#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:14,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {8851#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {8811#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-27 11:12:14,670 INFO L272 TraceCheckUtils]: 23: Hoare triple {8811#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:12:14,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {8903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:12:14,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {8907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8802#false} is VALID [2022-04-27 11:12:14,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {8802#false} assume !false; {8802#false} is VALID [2022-04-27 11:12:14,671 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:12:14,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:12:16,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {8802#false} assume !false; {8802#false} is VALID [2022-04-27 11:12:16,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {8907#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8802#false} is VALID [2022-04-27 11:12:16,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {8903#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8907#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:12:16,045 INFO L272 TraceCheckUtils]: 23: Hoare triple {8923#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8903#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:12:16,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {8927#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8923#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:12:16,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {8931#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8927#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:12:16,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {8935#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8931#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-27 11:12:16,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {8939#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8935#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-27 11:12:16,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {8939#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8939#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:12:16,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {8946#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8939#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:12:16,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {8950#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8946#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-27 11:12:16,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {8954#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (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; {8950#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-27 11:12:16,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {8954#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8954#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:12:16,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {8961#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8954#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:12:16,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {8965#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8961#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:12:16,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {8969#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8965#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:12:16,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {8973#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {8969#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:12:16,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {8973#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8973#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:12:16,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {8980#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))) (= (mod main_~n~0 4294967296) (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; {8973#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:12:16,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {8984#(or (not (< 0 (mod (+ main_~y~0 2) 4294967296))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (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; {8980#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-27 11:12:16,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {8988#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (<= (mod (+ main_~y~0 3) 4294967296) 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; {8984#(or (not (< 0 (mod (+ main_~y~0 2) 4294967296))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-27 11:12:16,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {8801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8988#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (<= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-27 11:12:16,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {8801#true} call #t~ret13 := main(); {8801#true} is VALID [2022-04-27 11:12:16,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8801#true} {8801#true} #72#return; {8801#true} is VALID [2022-04-27 11:12:16,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {8801#true} assume true; {8801#true} is VALID [2022-04-27 11:12:16,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {8801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8801#true} is VALID [2022-04-27 11:12:16,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {8801#true} call ULTIMATE.init(); {8801#true} is VALID [2022-04-27 11:12:16,067 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:12:16,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389946411] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:12:16,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:12:16,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 44 [2022-04-27 11:12:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496449086] [2022-04-27 11:12:16,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:12:16,068 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 41 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:12:16,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:12:16,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 41 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:16,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:16,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-27 11:12:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:12:16,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-27 11:12:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1552, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 11:12:16,216 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 41 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:29,031 INFO L93 Difference]: Finished difference Result 188 states and 243 transitions. [2022-04-27 11:12:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-27 11:12:29,032 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 41 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 11:12:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:12:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 41 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 142 transitions. [2022-04-27 11:12:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 41 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 142 transitions. [2022-04-27 11:12:29,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 142 transitions. [2022-04-27 11:12:29,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:29,859 INFO L225 Difference]: With dead ends: 188 [2022-04-27 11:12:29,860 INFO L226 Difference]: Without dead ends: 169 [2022-04-27 11:12:29,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3393 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1743, Invalid=9599, Unknown=0, NotChecked=0, Total=11342 [2022-04-27 11:12:29,863 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 182 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:12:29,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 88 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-27 11:12:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-27 11:12:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 129. [2022-04-27 11:12:30,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:12:30,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 129 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call 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:30,230 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 129 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call 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:30,231 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 129 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call 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:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:30,233 INFO L93 Difference]: Finished difference Result 169 states and 220 transitions. [2022-04-27 11:12:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 220 transitions. [2022-04-27 11:12:30,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:30,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:30,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states. [2022-04-27 11:12:30,234 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 169 states. [2022-04-27 11:12:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:30,237 INFO L93 Difference]: Finished difference Result 169 states and 220 transitions. [2022-04-27 11:12:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 220 transitions. [2022-04-27 11:12:30,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:30,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:30,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:12:30,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:12:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call 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:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2022-04-27 11:12:30,240 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 27 [2022-04-27 11:12:30,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:12:30,241 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2022-04-27 11:12:30,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 41 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2022-04-27 11:12:30,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:12:30,241 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:12:30,241 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:12:30,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 11:12:30,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:30,464 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:12:30,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:12:30,465 INFO L85 PathProgramCache]: Analyzing trace with hash -549567514, now seen corresponding path program 6 times [2022-04-27 11:12:30,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:12:30,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991487367] [2022-04-27 11:12:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:12:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:12:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:30,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:12:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:30,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {9935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9922#true} is VALID [2022-04-27 11:12:30,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {9922#true} assume true; {9922#true} is VALID [2022-04-27 11:12:30,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9922#true} {9922#true} #72#return; {9922#true} is VALID [2022-04-27 11:12:30,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {9922#true} call ULTIMATE.init(); {9935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:12:30,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {9935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9922#true} is VALID [2022-04-27 11:12:30,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {9922#true} assume true; {9922#true} is VALID [2022-04-27 11:12:30,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9922#true} {9922#true} #72#return; {9922#true} is VALID [2022-04-27 11:12:30,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {9922#true} call #t~ret13 := main(); {9922#true} is VALID [2022-04-27 11:12:30,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {9922#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9927#(= main_~y~0 0)} is VALID [2022-04-27 11:12:30,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {9927#(= 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; {9928#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:30,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {9928#(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; {9929#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:30,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {9929#(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; {9930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:30,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {9930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:30,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {9930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9931#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:12:30,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {9931#(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; {9932#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:12:30,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {9932#(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; {9933#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:12:30,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {9933#(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; {9934#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:12:30,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {9934#(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; {9923#false} is VALID [2022-04-27 11:12:30,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {9923#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; {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {9923#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; {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {9923#false} assume !(~z~0 % 4294967296 > 0); {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {9923#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; {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {9923#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; {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {9923#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; {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {9923#false} assume !(~y~0 % 4294967296 > 0); {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {9923#false} assume !(~x~0 % 4294967296 > 0); {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L272 TraceCheckUtils]: 23: Hoare triple {9923#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {9923#false} ~cond := #in~cond; {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {9923#false} assume 0 == ~cond; {9923#false} is VALID [2022-04-27 11:12:30,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {9923#false} assume !false; {9923#false} is VALID [2022-04-27 11:12:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:12:30,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:12:30,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991487367] [2022-04-27 11:12:30,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991487367] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:12:30,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245449102] [2022-04-27 11:12:30,614 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:12:30,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:30,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:12:30,616 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:12:30,644 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:12:30,679 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-27 11:12:30,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:12:30,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:12:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:30,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:12:30,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {9922#true} call ULTIMATE.init(); {9922#true} is VALID [2022-04-27 11:12:30,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {9922#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9922#true} is VALID [2022-04-27 11:12:30,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {9922#true} assume true; {9922#true} is VALID [2022-04-27 11:12:30,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9922#true} {9922#true} #72#return; {9922#true} is VALID [2022-04-27 11:12:30,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {9922#true} call #t~ret13 := main(); {9922#true} is VALID [2022-04-27 11:12:30,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {9922#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9927#(= main_~y~0 0)} is VALID [2022-04-27 11:12:30,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {9927#(= 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; {9928#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:30,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {9928#(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; {9929#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:30,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {9929#(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; {9930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:30,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {9930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:30,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {9930#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9969#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:30,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {9969#(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; {9973#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:12:30,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {9973#(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; {9977#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:30,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {9977#(and (= main_~y~0 (+ main_~z~0 2)) (<= 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; {9981#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {9981#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 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; {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {9923#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; {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {9923#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; {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {9923#false} assume !(~z~0 % 4294967296 > 0); {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {9923#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; {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {9923#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; {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {9923#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; {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {9923#false} assume !(~y~0 % 4294967296 > 0); {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {9923#false} assume !(~x~0 % 4294967296 > 0); {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L272 TraceCheckUtils]: 23: Hoare triple {9923#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {9923#false} ~cond := #in~cond; {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {9923#false} assume 0 == ~cond; {9923#false} is VALID [2022-04-27 11:12:30,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {9923#false} assume !false; {9923#false} is VALID [2022-04-27 11:12:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:12:30,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:12:31,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {9923#false} assume !false; {9923#false} is VALID [2022-04-27 11:12:31,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {9923#false} assume 0 == ~cond; {9923#false} is VALID [2022-04-27 11:12:31,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {9923#false} ~cond := #in~cond; {9923#false} is VALID [2022-04-27 11:12:31,044 INFO L272 TraceCheckUtils]: 23: Hoare triple {9923#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9923#false} is VALID [2022-04-27 11:12:31,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {9923#false} assume !(~x~0 % 4294967296 > 0); {9923#false} is VALID [2022-04-27 11:12:31,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {10036#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9923#false} is VALID [2022-04-27 11:12:31,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {10040#(< 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; {10036#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:12:31,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {10044#(< 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; {10040#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:12:31,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {10048#(< 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; {10044#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:12:31,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {10048#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {10048#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:12:31,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {10048#(< 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; {10048#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:12:31,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {10048#(< 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; {10048#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:12:31,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {10061#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10048#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:12:31,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {10065#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10061#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:12:31,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {10069#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10065#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:12:31,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {10073#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10069#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:12:31,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {9922#true} ~z~0 := ~y~0; {10073#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:12:31,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {9922#true} assume !(~x~0 % 4294967296 > 0); {9922#true} is VALID [2022-04-27 11:12:31,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {9922#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; {9922#true} is VALID [2022-04-27 11:12:31,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {9922#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; {9922#true} is VALID [2022-04-27 11:12:31,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {9922#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; {9922#true} is VALID [2022-04-27 11:12:31,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {9922#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9922#true} is VALID [2022-04-27 11:12:31,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {9922#true} call #t~ret13 := main(); {9922#true} is VALID [2022-04-27 11:12:31,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9922#true} {9922#true} #72#return; {9922#true} is VALID [2022-04-27 11:12:31,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {9922#true} assume true; {9922#true} is VALID [2022-04-27 11:12:31,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {9922#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9922#true} is VALID [2022-04-27 11:12:31,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {9922#true} call ULTIMATE.init(); {9922#true} is VALID [2022-04-27 11:12:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:12:31,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245449102] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:12:31,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:12:31,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-27 11:12:31,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120990962] [2022-04-27 11:12:31,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:12:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 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 27 [2022-04-27 11:12:31,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:12:31,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 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:12:31,085 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:12:31,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 11:12:31,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:12:31,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 11:12:31,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:12:31,086 INFO L87 Difference]: Start difference. First operand 129 states and 170 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 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:12:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:32,514 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2022-04-27 11:12:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 11:12:32,515 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 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 27 [2022-04-27 11:12:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:12:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 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:12:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 90 transitions. [2022-04-27 11:12:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 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:12:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 90 transitions. [2022-04-27 11:12:32,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 90 transitions. [2022-04-27 11:12:32,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:32,665 INFO L225 Difference]: With dead ends: 162 [2022-04-27 11:12:32,665 INFO L226 Difference]: Without dead ends: 136 [2022-04-27 11:12:32,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=366, Invalid=1614, Unknown=0, NotChecked=0, Total=1980 [2022-04-27 11:12:32,666 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 94 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:12:32,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 68 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:12:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-27 11:12:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2022-04-27 11:12:33,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:12:33,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 108 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 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:12:33,033 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 108 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 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:12:33,034 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 108 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 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:12:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:33,036 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2022-04-27 11:12:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2022-04-27 11:12:33,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:33,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:33,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 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 136 states. [2022-04-27 11:12:33,037 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 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 136 states. [2022-04-27 11:12:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:33,040 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2022-04-27 11:12:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2022-04-27 11:12:33,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:33,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:33,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:12:33,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:12:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 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:12:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 142 transitions. [2022-04-27 11:12:33,043 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 142 transitions. Word has length 27 [2022-04-27 11:12:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:12:33,044 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 142 transitions. [2022-04-27 11:12:33,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 22 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:12:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 142 transitions. [2022-04-27 11:12:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:12:33,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:12:33,044 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:12:33,067 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:12:33,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 11:12:33,259 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:12:33,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:12:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash -734568360, now seen corresponding path program 7 times [2022-04-27 11:12:33,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:12:33,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623143871] [2022-04-27 11:12:33,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:12:33,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:12:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:33,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:12:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:33,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {10829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10816#true} is VALID [2022-04-27 11:12:33,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {10816#true} assume true; {10816#true} is VALID [2022-04-27 11:12:33,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10816#true} {10816#true} #72#return; {10816#true} is VALID [2022-04-27 11:12:33,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {10816#true} call ULTIMATE.init(); {10829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:12:33,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {10829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10816#true} is VALID [2022-04-27 11:12:33,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {10816#true} assume true; {10816#true} is VALID [2022-04-27 11:12:33,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10816#true} {10816#true} #72#return; {10816#true} is VALID [2022-04-27 11:12:33,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {10816#true} call #t~ret13 := main(); {10816#true} is VALID [2022-04-27 11:12:33,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {10816#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10816#true} is VALID [2022-04-27 11:12:33,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {10816#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; {10821#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:12:33,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {10821#(<= 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; {10822#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:12:33,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {10822#(<= 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; {10823#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:12:33,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {10823#(<= 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; {10824#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:12:33,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {10824#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10824#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:12:33,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {10824#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {10824#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:12:33,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {10824#(<= (* (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; {10825#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-27 11:12:33,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {10825#(<= (+ (* 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; {10826#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:12:33,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {10826#(<= (+ 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; {10827#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:12:33,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {10827#(<= (+ 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; {10828#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:12:33,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {10828#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {10828#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:12:33,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {10828#(<= (+ 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; {10828#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:12:33,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {10828#(<= (+ 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; {10828#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:12:33,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {10828#(<= (+ 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; {10828#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:12:33,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {10828#(<= (+ 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; {10828#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:12:33,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {10828#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {10828#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:12:33,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {10828#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10817#false} is VALID [2022-04-27 11:12:33,412 INFO L272 TraceCheckUtils]: 23: Hoare triple {10817#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10817#false} is VALID [2022-04-27 11:12:33,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {10817#false} ~cond := #in~cond; {10817#false} is VALID [2022-04-27 11:12:33,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {10817#false} assume 0 == ~cond; {10817#false} is VALID [2022-04-27 11:12:33,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {10817#false} assume !false; {10817#false} is VALID [2022-04-27 11:12:33,413 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:12:33,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:12:33,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623143871] [2022-04-27 11:12:33,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623143871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:12:33,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158681914] [2022-04-27 11:12:33,413 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:12:33,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:33,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:12:33,416 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:12:33,417 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:12:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:33,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:12:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:33,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:12:33,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {10816#true} call ULTIMATE.init(); {10816#true} is VALID [2022-04-27 11:12:33,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {10816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10816#true} is VALID [2022-04-27 11:12:33,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {10816#true} assume true; {10816#true} is VALID [2022-04-27 11:12:33,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10816#true} {10816#true} #72#return; {10816#true} is VALID [2022-04-27 11:12:33,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {10816#true} call #t~ret13 := main(); {10816#true} is VALID [2022-04-27 11:12:33,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {10816#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10816#true} is VALID [2022-04-27 11:12:33,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {10816#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; {10821#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:12:33,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {10821#(<= 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; {10854#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:12:33,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {10854#(<= 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; {10858#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {10858#(<= 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; {10862#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:12:33,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {10862#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {10862#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:12:33,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {10862#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {10862#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:12:33,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {10862#(<= 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; {10858#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {10858#(<= 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; {10854#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:12:33,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {10854#(<= 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; {10821#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:12:33,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {10821#(<= 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; {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {10881#(<= 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; {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {10881#(<= 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; {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {10881#(<= 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; {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {10881#(<= 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; {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10817#false} is VALID [2022-04-27 11:12:33,716 INFO L272 TraceCheckUtils]: 23: Hoare triple {10817#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10817#false} is VALID [2022-04-27 11:12:33,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {10817#false} ~cond := #in~cond; {10817#false} is VALID [2022-04-27 11:12:33,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {10817#false} assume 0 == ~cond; {10817#false} is VALID [2022-04-27 11:12:33,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {10817#false} assume !false; {10817#false} is VALID [2022-04-27 11:12:33,716 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:12:33,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:12:33,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {10817#false} assume !false; {10817#false} is VALID [2022-04-27 11:12:33,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {10817#false} assume 0 == ~cond; {10817#false} is VALID [2022-04-27 11:12:33,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {10817#false} ~cond := #in~cond; {10817#false} is VALID [2022-04-27 11:12:33,820 INFO L272 TraceCheckUtils]: 23: Hoare triple {10817#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10817#false} is VALID [2022-04-27 11:12:33,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10817#false} is VALID [2022-04-27 11:12:33,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {10881#(<= 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; {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {10881#(<= 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; {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {10881#(<= 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; {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {10881#(<= 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; {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {10821#(<= 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; {10881#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {10854#(<= 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; {10821#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:12:33,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {10858#(<= 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; {10854#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:12:33,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {10862#(<= 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; {10858#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {10862#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {10862#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:12:33,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {10862#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {10862#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:12:33,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {10858#(<= 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; {10862#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:12:33,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {10854#(<= 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; {10858#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:12:33,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {10821#(<= 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; {10854#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:12:33,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {10816#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; {10821#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:12:33,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {10816#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10816#true} is VALID [2022-04-27 11:12:33,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {10816#true} call #t~ret13 := main(); {10816#true} is VALID [2022-04-27 11:12:33,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10816#true} {10816#true} #72#return; {10816#true} is VALID [2022-04-27 11:12:33,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {10816#true} assume true; {10816#true} is VALID [2022-04-27 11:12:33,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {10816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10816#true} is VALID [2022-04-27 11:12:33,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {10816#true} call ULTIMATE.init(); {10816#true} is VALID [2022-04-27 11:12:33,829 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:12:33,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158681914] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:12:33,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:12:33,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-27 11:12:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198264385] [2022-04-27 11:12:33,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:12:33,830 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:12:33,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:12:33,830 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:12:33,859 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:12:33,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:12:33,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:12:33,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:12:33,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:12:33,860 INFO L87 Difference]: Start difference. First operand 108 states and 142 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:12:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:34,785 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2022-04-27 11:12:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:12:34,785 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:12:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:12:34,786 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:12:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-27 11:12:34,787 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:12:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-27 11:12:34,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2022-04-27 11:12:34,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:34,870 INFO L225 Difference]: With dead ends: 140 [2022-04-27 11:12:34,870 INFO L226 Difference]: Without dead ends: 135 [2022-04-27 11:12:34,870 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:12:34,871 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:12:34,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 75 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:12:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-27 11:12:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2022-04-27 11:12:35,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:12:35,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 127 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:35,290 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 127 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:35,290 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 127 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:35,293 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2022-04-27 11:12:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2022-04-27 11:12:35,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:35,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:35,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-27 11:12:35,294 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 135 states. [2022-04-27 11:12:35,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:35,295 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2022-04-27 11:12:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2022-04-27 11:12:35,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:35,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:35,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:12:35,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:12:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 168 transitions. [2022-04-27 11:12:35,298 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 168 transitions. Word has length 27 [2022-04-27 11:12:35,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:12:35,298 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 168 transitions. [2022-04-27 11:12:35,298 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:12:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2022-04-27 11:12:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:12:35,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:12:35,299 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:12:35,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-27 11:12:35,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:35,511 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:12:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:12:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2010729856, now seen corresponding path program 8 times [2022-04-27 11:12:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:12:35,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949971269] [2022-04-27 11:12:35,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:12:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:12:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:12:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:35,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {11679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11664#true} is VALID [2022-04-27 11:12:35,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {11664#true} assume true; {11664#true} is VALID [2022-04-27 11:12:35,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11664#true} {11664#true} #72#return; {11664#true} is VALID [2022-04-27 11:12:35,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {11664#true} call ULTIMATE.init(); {11679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:12:35,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {11679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11664#true} is VALID [2022-04-27 11:12:35,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {11664#true} assume true; {11664#true} is VALID [2022-04-27 11:12:35,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11664#true} {11664#true} #72#return; {11664#true} is VALID [2022-04-27 11:12:35,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {11664#true} call #t~ret13 := main(); {11664#true} is VALID [2022-04-27 11:12:35,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {11664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11669#(= main_~y~0 0)} is VALID [2022-04-27 11:12:35,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {11669#(= 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; {11670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:35,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {11670#(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; {11671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:35,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {11671#(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; {11672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:35,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {11672#(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; {11673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:35,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {11673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:35,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {11673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {11674#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:12:35,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {11674#(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; {11675#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:12:35,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {11675#(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; {11676#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:12:35,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {11676#(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; {11677#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:12:35,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {11677#(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; {11678#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:12:35,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {11678#(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; {11665#false} is VALID [2022-04-27 11:12:35,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {11665#false} assume !(~z~0 % 4294967296 > 0); {11665#false} is VALID [2022-04-27 11:12:35,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {11665#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; {11665#false} is VALID [2022-04-27 11:12:35,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {11665#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; {11665#false} is VALID [2022-04-27 11:12:35,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {11665#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; {11665#false} is VALID [2022-04-27 11:12:35,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {11665#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; {11665#false} is VALID [2022-04-27 11:12:35,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {11665#false} assume !(~y~0 % 4294967296 > 0); {11665#false} is VALID [2022-04-27 11:12:35,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {11665#false} assume !(~x~0 % 4294967296 > 0); {11665#false} is VALID [2022-04-27 11:12:35,667 INFO L272 TraceCheckUtils]: 24: Hoare triple {11665#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11665#false} is VALID [2022-04-27 11:12:35,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {11665#false} ~cond := #in~cond; {11665#false} is VALID [2022-04-27 11:12:35,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {11665#false} assume 0 == ~cond; {11665#false} is VALID [2022-04-27 11:12:35,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {11665#false} assume !false; {11665#false} is VALID [2022-04-27 11:12:35,667 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:12:35,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:12:35,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949971269] [2022-04-27 11:12:35,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949971269] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:12:35,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491975568] [2022-04-27 11:12:35,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:12:35,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:35,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:12:35,669 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:12:35,692 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:12:35,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:12:35,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:12:35,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 11:12:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:35,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:12:35,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {11664#true} call ULTIMATE.init(); {11664#true} is VALID [2022-04-27 11:12:35,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {11664#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11664#true} is VALID [2022-04-27 11:12:35,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {11664#true} assume true; {11664#true} is VALID [2022-04-27 11:12:35,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11664#true} {11664#true} #72#return; {11664#true} is VALID [2022-04-27 11:12:35,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {11664#true} call #t~ret13 := main(); {11664#true} is VALID [2022-04-27 11:12:35,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {11664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11669#(= main_~y~0 0)} is VALID [2022-04-27 11:12:35,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {11669#(= 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; {11670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:35,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {11670#(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; {11671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:35,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {11671#(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; {11672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:35,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {11672#(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; {11673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:35,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {11673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:35,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {11673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {11716#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:35,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {11716#(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; {11720#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:12:35,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {11720#(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; {11724#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:35,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {11724#(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; {11728#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-27 11:12:35,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {11728#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11732#(and (<= main_~y~0 4) (= main_~y~0 (+ main_~z~0 4)) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:35,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {11732#(and (<= main_~y~0 4) (= main_~y~0 (+ main_~z~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; {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {11665#false} assume !(~z~0 % 4294967296 > 0); {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {11665#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; {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {11665#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; {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {11665#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; {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {11665#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; {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {11665#false} assume !(~y~0 % 4294967296 > 0); {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {11665#false} assume !(~x~0 % 4294967296 > 0); {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L272 TraceCheckUtils]: 24: Hoare triple {11665#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {11665#false} ~cond := #in~cond; {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {11665#false} assume 0 == ~cond; {11665#false} is VALID [2022-04-27 11:12:35,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {11665#false} assume !false; {11665#false} is VALID [2022-04-27 11:12:35,955 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:12:35,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:12:36,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {11665#false} assume !false; {11665#false} is VALID [2022-04-27 11:12:36,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {11665#false} assume 0 == ~cond; {11665#false} is VALID [2022-04-27 11:12:36,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {11665#false} ~cond := #in~cond; {11665#false} is VALID [2022-04-27 11:12:36,275 INFO L272 TraceCheckUtils]: 24: Hoare triple {11665#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11665#false} is VALID [2022-04-27 11:12:36,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {11665#false} assume !(~x~0 % 4294967296 > 0); {11665#false} is VALID [2022-04-27 11:12:36,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {11784#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11665#false} is VALID [2022-04-27 11:12:36,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {11788#(< 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; {11784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:12:36,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {11792#(< 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; {11788#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:12:36,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {11796#(< 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; {11792#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:12:36,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {11800#(< 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; {11796#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:12:36,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {11800#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11800#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:12:36,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {11807#(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; {11800#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:12:36,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {11811#(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; {11807#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:12:36,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {11815#(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; {11811#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:12:36,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {11819#(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; {11815#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:12:36,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {11823#(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; {11819#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:12:36,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {11664#true} ~z~0 := ~y~0; {11823#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:12:36,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {11664#true} assume !(~x~0 % 4294967296 > 0); {11664#true} is VALID [2022-04-27 11:12:36,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {11664#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; {11664#true} is VALID [2022-04-27 11:12:36,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {11664#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; {11664#true} is VALID [2022-04-27 11:12:36,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {11664#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; {11664#true} is VALID [2022-04-27 11:12:36,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {11664#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; {11664#true} is VALID [2022-04-27 11:12:36,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {11664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11664#true} is VALID [2022-04-27 11:12:36,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {11664#true} call #t~ret13 := main(); {11664#true} is VALID [2022-04-27 11:12:36,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11664#true} {11664#true} #72#return; {11664#true} is VALID [2022-04-27 11:12:36,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {11664#true} assume true; {11664#true} is VALID [2022-04-27 11:12:36,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {11664#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11664#true} is VALID [2022-04-27 11:12:36,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {11664#true} call ULTIMATE.init(); {11664#true} is VALID [2022-04-27 11:12:36,286 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:12:36,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491975568] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:12:36,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:12:36,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-04-27 11:12:36,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024588880] [2022-04-27 11:12:36,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:12:36,287 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:12:36,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:12:36,287 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:12:36,328 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:12:36,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 11:12:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:12:36,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 11:12:36,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:12:36,329 INFO L87 Difference]: Start difference. First operand 127 states and 168 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:12:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:39,865 INFO L93 Difference]: Finished difference Result 247 states and 315 transitions. [2022-04-27 11:12:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 11:12:39,866 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:12:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:12:39,866 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:12:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 143 transitions. [2022-04-27 11:12:39,868 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:12:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 143 transitions. [2022-04-27 11:12:39,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 143 transitions. [2022-04-27 11:12:40,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:40,139 INFO L225 Difference]: With dead ends: 247 [2022-04-27 11:12:40,140 INFO L226 Difference]: Without dead ends: 219 [2022-04-27 11:12:40,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=924, Invalid=4046, Unknown=0, NotChecked=0, Total=4970 [2022-04-27 11:12:40,142 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 168 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:12:40,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 81 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 11:12:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-27 11:12:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 144. [2022-04-27 11:12:40,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:12:40,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 144 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call 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:40,593 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 144 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call 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:40,593 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 144 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call 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:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:40,597 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2022-04-27 11:12:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2022-04-27 11:12:40,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:40,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:40,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 219 states. [2022-04-27 11:12:40,598 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 219 states. [2022-04-27 11:12:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:40,601 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2022-04-27 11:12:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2022-04-27 11:12:40,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:40,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:40,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:12:40,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:12:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call 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:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2022-04-27 11:12:40,604 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 28 [2022-04-27 11:12:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:12:40,605 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2022-04-27 11:12:40,605 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:12:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2022-04-27 11:12:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:12:40,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:12:40,605 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:12:40,631 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:12:40,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:40,832 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:12:40,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:12:40,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1472968031, now seen corresponding path program 3 times [2022-04-27 11:12:40,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:12:40,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311449303] [2022-04-27 11:12:40,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:12:40,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:12:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:41,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:12:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:41,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {12949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12929#true} is VALID [2022-04-27 11:12:41,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-27 11:12:41,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12929#true} {12929#true} #72#return; {12929#true} is VALID [2022-04-27 11:12:41,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {12929#true} call ULTIMATE.init(); {12949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:12:41,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {12949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12929#true} is VALID [2022-04-27 11:12:41,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-27 11:12:41,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12929#true} {12929#true} #72#return; {12929#true} is VALID [2022-04-27 11:12:41,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {12929#true} call #t~ret13 := main(); {12929#true} is VALID [2022-04-27 11:12:41,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {12929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12934#(= main_~y~0 0)} is VALID [2022-04-27 11:12:41,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {12934#(= 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; {12935#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:41,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {12935#(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; {12936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:41,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {12936#(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; {12937#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:41,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {12937#(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; {12938#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:41,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {12938#(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; {12939#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:12:41,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {12939#(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; {12940#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:12:41,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {12940#(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; {12941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:12:41,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {12941#(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; {12942#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:12:41,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {12942#(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; {12943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:12:41,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {12943#(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; {12944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:12:41,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {12944#(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; {12945#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:12:41,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {12945#(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; {12946#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:12:41,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {12946#(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; {12947#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:12:41,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {12947#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12947#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:12:41,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {12947#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {12948#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:12:41,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {12948#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12930#false} is VALID [2022-04-27 11:12:41,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {12930#false} assume !(~y~0 % 4294967296 > 0); {12930#false} is VALID [2022-04-27 11:12:41,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {12930#false} assume !(~x~0 % 4294967296 > 0); {12930#false} is VALID [2022-04-27 11:12:41,096 INFO L272 TraceCheckUtils]: 24: Hoare triple {12930#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12930#false} is VALID [2022-04-27 11:12:41,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {12930#false} ~cond := #in~cond; {12930#false} is VALID [2022-04-27 11:12:41,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {12930#false} assume 0 == ~cond; {12930#false} is VALID [2022-04-27 11:12:41,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {12930#false} assume !false; {12930#false} is VALID [2022-04-27 11:12:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:12:41,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:12:41,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311449303] [2022-04-27 11:12:41,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311449303] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:12:41,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34155780] [2022-04-27 11:12:41,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:12:41,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:41,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:12:41,100 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:12:41,109 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:12:41,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-27 11:12:41,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:12:41,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 11:12:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:41,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:12:41,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {12929#true} call ULTIMATE.init(); {12929#true} is VALID [2022-04-27 11:12:41,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {12929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12929#true} is VALID [2022-04-27 11:12:41,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-27 11:12:41,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12929#true} {12929#true} #72#return; {12929#true} is VALID [2022-04-27 11:12:41,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {12929#true} call #t~ret13 := main(); {12929#true} is VALID [2022-04-27 11:12:41,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {12929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12934#(= main_~y~0 0)} is VALID [2022-04-27 11:12:41,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {12934#(= 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; {12935#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:41,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {12935#(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; {12936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:41,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {12936#(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; {12937#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:41,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {12937#(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; {12938#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:41,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {12938#(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; {12939#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:12:41,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {12939#(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; {12940#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:12:41,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {12940#(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; {12941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:12:41,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {12941#(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; {12942#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:12:41,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {12942#(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; {12943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:12:41,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {12943#(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; {12944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:12:41,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {12944#(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; {12945#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:12:41,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {12945#(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; {12946#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:12:41,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {12946#(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; {12947#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:12:41,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {12947#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12947#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:12:41,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {12947#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {13013#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:12:41,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {13013#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {12930#false} is VALID [2022-04-27 11:12:41,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {12930#false} assume !(~y~0 % 4294967296 > 0); {12930#false} is VALID [2022-04-27 11:12:41,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {12930#false} assume !(~x~0 % 4294967296 > 0); {12930#false} is VALID [2022-04-27 11:12:41,631 INFO L272 TraceCheckUtils]: 24: Hoare triple {12930#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12930#false} is VALID [2022-04-27 11:12:41,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {12930#false} ~cond := #in~cond; {12930#false} is VALID [2022-04-27 11:12:41,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {12930#false} assume 0 == ~cond; {12930#false} is VALID [2022-04-27 11:12:41,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {12930#false} assume !false; {12930#false} is VALID [2022-04-27 11:12:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:12:41,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:12:42,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {12930#false} assume !false; {12930#false} is VALID [2022-04-27 11:12:42,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {12930#false} assume 0 == ~cond; {12930#false} is VALID [2022-04-27 11:12:42,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {12930#false} ~cond := #in~cond; {12930#false} is VALID [2022-04-27 11:12:42,052 INFO L272 TraceCheckUtils]: 24: Hoare triple {12930#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12930#false} is VALID [2022-04-27 11:12:42,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {12930#false} assume !(~x~0 % 4294967296 > 0); {12930#false} is VALID [2022-04-27 11:12:42,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {12930#false} assume !(~y~0 % 4294967296 > 0); {12930#false} is VALID [2022-04-27 11:12:42,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {13053#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12930#false} is VALID [2022-04-27 11:12:42,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {13057#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {13053#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:12:42,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {13057#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {13057#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:12:42,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {13064#(< 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; {13057#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:12:42,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {13068#(< 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; {13064#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:12:42,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {13072#(< 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; {13068#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:12:42,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {13076#(< 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; {13072#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:12:42,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {13080#(< 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; {13076#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:12:42,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {13084#(< 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; {13080#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:12:42,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {13088#(< 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; {13084#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:12:42,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {13092#(< 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; {13088#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:12:42,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {13096#(< 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; {13092#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:12:42,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {13100#(< 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; {13096#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:12:42,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {13104#(< 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; {13100#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:12:42,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {13108#(< 0 (mod (+ main_~y~0 12) 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; {13104#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:12:42,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {13112#(< 0 (mod (+ main_~y~0 13) 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; {13108#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:12:42,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {12929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13112#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-27 11:12:42,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {12929#true} call #t~ret13 := main(); {12929#true} is VALID [2022-04-27 11:12:42,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12929#true} {12929#true} #72#return; {12929#true} is VALID [2022-04-27 11:12:42,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {12929#true} assume true; {12929#true} is VALID [2022-04-27 11:12:42,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {12929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12929#true} is VALID [2022-04-27 11:12:42,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {12929#true} call ULTIMATE.init(); {12929#true} is VALID [2022-04-27 11:12:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:12:42,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34155780] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:12:42,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:12:42,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-27 11:12:42,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633415019] [2022-04-27 11:12:42,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:12:42,064 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 2 states have call successors, (4), 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:12:42,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:12:42,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 2 states have call successors, (4), 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:12:42,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:42,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 11:12:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:12:42,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 11:12:42,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 11:12:42,095 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 2 states have call successors, (4), 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,114 WARN L232 SmtUtils]: Spent 6.01s 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:13:26,345 WARN L232 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:13:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:52,583 INFO L93 Difference]: Finished difference Result 766 states and 1080 transitions. [2022-04-27 11:13:52,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-27 11:13:52,584 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:13:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 2 states have call successors, (4), 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:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 359 transitions. [2022-04-27 11:13:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 2 states have call successors, (4), 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:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 359 transitions. [2022-04-27 11:13:52,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 359 transitions. [2022-04-27 11:13:58,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 358 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:58,550 INFO L225 Difference]: With dead ends: 766 [2022-04-27 11:13:58,550 INFO L226 Difference]: Without dead ends: 725 [2022-04-27 11:13:58,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2678 ImplicationChecksByTransitivity, 60.5s TimeCoverageRelationStatistics Valid=2537, Invalid=7363, Unknown=0, NotChecked=0, Total=9900 [2022-04-27 11:13:58,553 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 988 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 833 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 833 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:58,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 144 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [833 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-27 11:13:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-04-27 11:13:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 206. [2022-04-27 11:13:59,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:59,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 725 states. Second operand has 206 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call 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,374 INFO L74 IsIncluded]: Start isIncluded. First operand 725 states. Second operand has 206 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call 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,374 INFO L87 Difference]: Start difference. First operand 725 states. Second operand has 206 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call 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,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:59,395 INFO L93 Difference]: Finished difference Result 725 states and 934 transitions. [2022-04-27 11:13:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 934 transitions. [2022-04-27 11:13:59,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:59,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:59,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 725 states. [2022-04-27 11:13:59,397 INFO L87 Difference]: Start difference. First operand has 206 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 725 states. [2022-04-27 11:13:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:59,417 INFO L93 Difference]: Finished difference Result 725 states and 934 transitions. [2022-04-27 11:13:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 934 transitions. [2022-04-27 11:13:59,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:59,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:59,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:59,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 201 states have (on average 1.36318407960199) internal successors, (274), 201 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call 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,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 278 transitions. [2022-04-27 11:13:59,422 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 278 transitions. Word has length 28 [2022-04-27 11:13:59,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:59,422 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 278 transitions. [2022-04-27 11:13:59,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 33 states have internal predecessors, (44), 2 states have call successors, (4), 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,423 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 278 transitions. [2022-04-27 11:13:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 11:13:59,423 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:59,423 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:13:59,439 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:13:59,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:59,628 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:59,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:59,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1541621168, now seen corresponding path program 9 times [2022-04-27 11:13:59,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:59,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652571012] [2022-04-27 11:13:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:59,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:59,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {16023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16008#true} is VALID [2022-04-27 11:13:59,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {16008#true} assume true; {16008#true} is VALID [2022-04-27 11:13:59,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16008#true} {16008#true} #72#return; {16008#true} is VALID [2022-04-27 11:13:59,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {16008#true} call ULTIMATE.init(); {16023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:59,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {16023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16008#true} is VALID [2022-04-27 11:13:59,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {16008#true} assume true; {16008#true} is VALID [2022-04-27 11:13:59,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16008#true} {16008#true} #72#return; {16008#true} is VALID [2022-04-27 11:13:59,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {16008#true} call #t~ret13 := main(); {16008#true} is VALID [2022-04-27 11:13:59,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {16008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16008#true} is VALID [2022-04-27 11:13:59,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {16008#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; {16013#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:59,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {16013#(<= 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; {16014#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:13:59,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {16014#(<= 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; {16015#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:59,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {16015#(<= 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; {16016#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:59,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {16016#(<= 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; {16017#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:13:59,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {16017#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {16017#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:13:59,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {16017#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {16017#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:13:59,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {16017#(<= (* (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; {16018#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:13:59,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {16018#(<= (+ (* (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; {16019#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-27 11:13:59,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {16019#(<= (+ (* 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; {16020#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:13:59,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {16020#(<= (+ 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; {16021#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:13:59,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {16021#(<= (+ (* (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; {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {16022#(<= (+ 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; {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {16022#(<= (+ 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; {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {16022#(<= (+ 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; {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {16022#(<= (+ 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; {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {16022#(<= (+ 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; {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:13:59,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {16022#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {16009#false} is VALID [2022-04-27 11:13:59,830 INFO L272 TraceCheckUtils]: 26: Hoare triple {16009#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16009#false} is VALID [2022-04-27 11:13:59,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {16009#false} ~cond := #in~cond; {16009#false} is VALID [2022-04-27 11:13:59,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {16009#false} assume 0 == ~cond; {16009#false} is VALID [2022-04-27 11:13:59,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {16009#false} assume !false; {16009#false} is VALID [2022-04-27 11:13:59,830 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:13:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:59,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652571012] [2022-04-27 11:13:59,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652571012] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:59,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827436859] [2022-04-27 11:13:59,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:59,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:59,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:59,832 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:13:59,834 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:13:59,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 11:13:59,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:59,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 11:13:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:59,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:00,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {16008#true} call ULTIMATE.init(); {16008#true} is VALID [2022-04-27 11:14:00,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {16008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16008#true} is VALID [2022-04-27 11:14:00,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {16008#true} assume true; {16008#true} is VALID [2022-04-27 11:14:00,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16008#true} {16008#true} #72#return; {16008#true} is VALID [2022-04-27 11:14:00,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {16008#true} call #t~ret13 := main(); {16008#true} is VALID [2022-04-27 11:14:00,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {16008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16042#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:14:00,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {16042#(= main_~n~0 main_~x~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; {16046#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-27 11:14:00,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {16046#(= (+ main_~x~0 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; {16050#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-27 11:14:00,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {16050#(= (+ 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; {16054#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-27 11:14:00,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {16054#(= (+ (- 2) main_~n~0) (+ main_~x~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; {16058#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-27 11:14:00,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {16058#(= (+ main_~n~0 (- 3)) (+ main_~x~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; {16062#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:14:00,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {16062#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} assume !(~x~0 % 4294967296 > 0); {16062#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:14:00,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {16062#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} ~z~0 := ~y~0; {16062#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-27 11:14:00,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {16062#(= (+ main_~x~0 1) (+ main_~n~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; {16058#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-27 11:14:00,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {16058#(= (+ main_~n~0 (- 3)) (+ main_~x~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; {16054#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-27 11:14:00,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {16054#(= (+ (- 2) main_~n~0) (+ main_~x~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; {16050#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-27 11:14:00,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {16050#(= (+ main_~x~0 1) (+ (- 1) 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; {16046#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-27 11:14:00,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {16046#(= (+ main_~x~0 1) 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; {16042#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:14:00,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {16042#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {16042#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:14:00,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {16042#(= main_~n~0 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; {16042#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:14:00,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {16042#(= main_~n~0 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; {16042#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:14:00,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {16042#(= main_~n~0 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; {16042#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:14:00,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {16042#(= main_~n~0 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; {16042#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:14:00,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {16042#(= main_~n~0 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; {16042#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 11:14:00,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {16042#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {16105#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:14:00,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {16105#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {16109#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-27 11:14:00,495 INFO L272 TraceCheckUtils]: 26: Hoare triple {16109#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16113#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:14:00,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {16113#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16117#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:14:00,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {16117#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16009#false} is VALID [2022-04-27 11:14:00,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {16009#false} assume !false; {16009#false} is VALID [2022-04-27 11:14:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:14:00,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:01,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {16009#false} assume !false; {16009#false} is VALID [2022-04-27 11:14:01,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {16117#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16009#false} is VALID [2022-04-27 11:14:01,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {16113#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16117#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:14:01,126 INFO L272 TraceCheckUtils]: 26: Hoare triple {16133#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16113#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:14:01,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {16137#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16133#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:14:01,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16137#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:14:01,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:01,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:01,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:01,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:01,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:01,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:01,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {16163#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:01,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {16167#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16163#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:14:01,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {16171#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16167#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:14:01,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {16175#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16171#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:14:01,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {16179#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16175#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:14:01,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {16179#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} ~z~0 := ~y~0; {16179#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:14:01,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {16179#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {16179#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:14:01,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {16175#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 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; {16179#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:14:01,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {16171#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 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; {16175#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:14:01,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {16167#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16171#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:14:01,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {16163#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 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; {16167#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:14:01,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod 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; {16163#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-27 11:14:01,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {16008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16141#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:14:01,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {16008#true} call #t~ret13 := main(); {16008#true} is VALID [2022-04-27 11:14:01,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16008#true} {16008#true} #72#return; {16008#true} is VALID [2022-04-27 11:14:01,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {16008#true} assume true; {16008#true} is VALID [2022-04-27 11:14:01,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {16008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16008#true} is VALID [2022-04-27 11:14:01,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {16008#true} call ULTIMATE.init(); {16008#true} is VALID [2022-04-27 11:14:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:14:01,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827436859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:01,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:01,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2022-04-27 11:14:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118440182] [2022-04-27 11:14:01,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:01,138 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 11:14:01,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:01,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:01,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:01,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 11:14:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 11:14:01,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:14:01,206 INFO L87 Difference]: Start difference. First operand 206 states and 278 transitions. Second operand has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:04,669 INFO L93 Difference]: Finished difference Result 294 states and 395 transitions. [2022-04-27 11:14:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 11:14:04,669 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 11:14:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 119 transitions. [2022-04-27 11:14:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 119 transitions. [2022-04-27 11:14:04,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 119 transitions. [2022-04-27 11:14:04,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:04,836 INFO L225 Difference]: With dead ends: 294 [2022-04-27 11:14:04,836 INFO L226 Difference]: Without dead ends: 289 [2022-04-27 11:14:04,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=504, Invalid=2918, Unknown=0, NotChecked=0, Total=3422 [2022-04-27 11:14:04,838 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 183 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:04,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 106 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 11:14:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-27 11:14:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 239. [2022-04-27 11:14:05,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:05,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 239 states, 234 states have (on average 1.3675213675213675) internal successors, (320), 234 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call 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:05,746 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 239 states, 234 states have (on average 1.3675213675213675) internal successors, (320), 234 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call 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:05,746 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 239 states, 234 states have (on average 1.3675213675213675) internal successors, (320), 234 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call 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:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:05,750 INFO L93 Difference]: Finished difference Result 289 states and 381 transitions. [2022-04-27 11:14:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 381 transitions. [2022-04-27 11:14:05,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:05,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:05,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.3675213675213675) internal successors, (320), 234 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-27 11:14:05,750 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.3675213675213675) internal successors, (320), 234 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-27 11:14:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:05,754 INFO L93 Difference]: Finished difference Result 289 states and 381 transitions. [2022-04-27 11:14:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 381 transitions. [2022-04-27 11:14:05,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:05,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:05,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:05,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.3675213675213675) internal successors, (320), 234 states have internal predecessors, (320), 3 states have call successors, (3), 3 states have call 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:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 324 transitions. [2022-04-27 11:14:05,759 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 324 transitions. Word has length 30 [2022-04-27 11:14:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:05,759 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 324 transitions. [2022-04-27 11:14:05,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 29 states have internal predecessors, (59), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 324 transitions. [2022-04-27 11:14:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:14:05,759 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:05,760 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:14:05,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 11:14:05,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:05,960 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1818120792, now seen corresponding path program 8 times [2022-04-27 11:14:05,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:05,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194204640] [2022-04-27 11:14:05,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:05,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:06,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:06,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {17645#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17626#true} is VALID [2022-04-27 11:14:06,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {17626#true} assume true; {17626#true} is VALID [2022-04-27 11:14:06,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17626#true} {17626#true} #72#return; {17626#true} is VALID [2022-04-27 11:14:06,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {17626#true} call ULTIMATE.init(); {17645#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:06,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {17645#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17626#true} is VALID [2022-04-27 11:14:06,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {17626#true} assume true; {17626#true} is VALID [2022-04-27 11:14:06,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17626#true} {17626#true} #72#return; {17626#true} is VALID [2022-04-27 11:14:06,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {17626#true} call #t~ret13 := main(); {17626#true} is VALID [2022-04-27 11:14:06,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {17626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17631#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:14:06,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {17631#(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; {17632#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:06,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {17632#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~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; {17633#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:14:06,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {17633#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {17634#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:06,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {17634#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {17635#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-27 11:14:06,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {17635#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {17636#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-27 11:14:06,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {17636#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {17636#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-27 11:14:06,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {17636#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) 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; {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-27 11:14:06,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~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; {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-27 11:14:06,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~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; {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-27 11:14:06,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~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; {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-27 11:14:06,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} assume !(~z~0 % 4294967296 > 0); {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-27 11:14:06,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~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; {17638#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-27 11:14:06,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {17638#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17639#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:06,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {17639#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17640#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:06,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {17640#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17641#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-27 11:14:06,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {17641#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {17641#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-27 11:14:06,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {17641#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17640#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:06,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {17640#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17639#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:06,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {17639#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17638#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-27 11:14:06,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {17638#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17642#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:14:06,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {17642#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {17642#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:14:06,413 INFO L272 TraceCheckUtils]: 27: Hoare triple {17642#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17643#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:14:06,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {17643#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17644#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:14:06,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {17644#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17627#false} is VALID [2022-04-27 11:14:06,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {17627#false} assume !false; {17627#false} is VALID [2022-04-27 11:14:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:14:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:06,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194204640] [2022-04-27 11:14:06,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194204640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:06,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011409882] [2022-04-27 11:14:06,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:14:06,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:06,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:06,416 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:14:06,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 11:14:06,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:14:06,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:06,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-27 11:14:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:06,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:10,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {17626#true} call ULTIMATE.init(); {17626#true} is VALID [2022-04-27 11:14:10,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {17626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17626#true} is VALID [2022-04-27 11:14:10,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {17626#true} assume true; {17626#true} is VALID [2022-04-27 11:14:10,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17626#true} {17626#true} #72#return; {17626#true} is VALID [2022-04-27 11:14:10,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {17626#true} call #t~ret13 := main(); {17626#true} is VALID [2022-04-27 11:14:10,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {17626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17631#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:14:10,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {17631#(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; {17632#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:10,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {17632#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~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; {17670#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:14:10,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {17670#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {17674#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:10,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {17674#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {17678#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:14:10,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {17678#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {17682#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:14:10,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {17682#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {17682#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:14:10,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {17682#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ 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; {17689#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~y~0 4) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)))} is VALID [2022-04-27 11:14:10,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {17689#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~y~0 4) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17693#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-27 11:14:10,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {17693#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~y~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; {17697#(and (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-27 11:14:10,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {17697#(and (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967294)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17701#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:14:10,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {17701#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !(~z~0 % 4294967296 > 0); {17701#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:14:10,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {17701#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17708#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:14:10,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {17708#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17712#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:10,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {17712#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~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; {17716#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:10,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {17716#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17720#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:14:10,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {17720#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !(~y~0 % 4294967296 > 0); {17720#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:14:10,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {17720#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17727#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:10,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {17727#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17731#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:14:10,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {17731#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17735#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:10,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {17735#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17682#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:14:10,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {17682#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-27 11:14:10,202 INFO L272 TraceCheckUtils]: 27: Hoare triple {17637#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:14:10,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {17745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:14:10,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {17749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17627#false} is VALID [2022-04-27 11:14:10,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {17627#false} assume !false; {17627#false} is VALID [2022-04-27 11:14:10,203 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:14:10,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:11,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {17627#false} assume !false; {17627#false} is VALID [2022-04-27 11:14:11,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {17749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17627#false} is VALID [2022-04-27 11:14:11,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {17745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:14:11,814 INFO L272 TraceCheckUtils]: 27: Hoare triple {17765#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:14:11,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {17769#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {17765#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:14:11,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {17773#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17769#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:14:11,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {17777#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17773#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-27 11:14:11,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {17781#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17777#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-27 11:14:11,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {17785#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17781#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:14:11,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {17785#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17785#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:14:11,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {17792#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 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; {17785#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:14:11,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {17796#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 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; {17792#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:14:11,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {17800#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 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; {17796#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:14:11,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {17804#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 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; {17800#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:14:11,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {17804#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17804#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:14:11,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {17811#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17804#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:14:11,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {17815#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17811#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:14:11,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {17819#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17815#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:14:11,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {17769#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17819#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:14:11,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {17769#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {17769#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:14:11,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {17769#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {17769#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:14:11,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {17773#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (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; {17769#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:14:11,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {17777#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (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; {17773#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-27 11:14:11,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {17781#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 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; {17777#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-27 11:14:11,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {17785#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 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; {17781#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:14:11,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {17626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17785#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:14:11,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {17626#true} call #t~ret13 := main(); {17626#true} is VALID [2022-04-27 11:14:11,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17626#true} {17626#true} #72#return; {17626#true} is VALID [2022-04-27 11:14:11,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {17626#true} assume true; {17626#true} is VALID [2022-04-27 11:14:11,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {17626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17626#true} is VALID [2022-04-27 11:14:11,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {17626#true} call ULTIMATE.init(); {17626#true} is VALID [2022-04-27 11:14:11,836 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:14:11,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011409882] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:11,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:11,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 17] total 47 [2022-04-27 11:14:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217373466] [2022-04-27 11:14:11,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:11,837 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 44 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 11:14:11,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:11,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 44 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:12,152 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:12,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-27 11:14:12,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:12,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-27 11:14:12,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1840, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 11:14:12,154 INFO L87 Difference]: Start difference. First operand 239 states and 324 transitions. Second operand has 47 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 44 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:15,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:14:30,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:14:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:33,134 INFO L93 Difference]: Finished difference Result 349 states and 437 transitions. [2022-04-27 11:14:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-27 11:14:33,135 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 44 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 11:14:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 44 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 108 transitions. [2022-04-27 11:14:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 44 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 108 transitions. [2022-04-27 11:14:33,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 108 transitions. [2022-04-27 11:14:33,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:33,548 INFO L225 Difference]: With dead ends: 349 [2022-04-27 11:14:33,548 INFO L226 Difference]: Without dead ends: 323 [2022-04-27 11:14:33,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1119, Invalid=7253, Unknown=0, NotChecked=0, Total=8372 [2022-04-27 11:14:33,550 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 143 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 263 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:33,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 110 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 784 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2022-04-27 11:14:33,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-27 11:14:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 237. [2022-04-27 11:14:34,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:34,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 237 states, 232 states have (on average 1.3706896551724137) internal successors, (318), 232 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call 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,431 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 237 states, 232 states have (on average 1.3706896551724137) internal successors, (318), 232 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call 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,431 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 237 states, 232 states have (on average 1.3706896551724137) internal successors, (318), 232 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call 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,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:34,437 INFO L93 Difference]: Finished difference Result 323 states and 408 transitions. [2022-04-27 11:14:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2022-04-27 11:14:34,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:34,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:34,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 232 states have (on average 1.3706896551724137) internal successors, (318), 232 states have internal predecessors, (318), 3 states have call successors, (3), 3 states 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:34,438 INFO L87 Difference]: Start difference. First operand has 237 states, 232 states have (on average 1.3706896551724137) internal successors, (318), 232 states have internal predecessors, (318), 3 states have call successors, (3), 3 states 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:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:34,443 INFO L93 Difference]: Finished difference Result 323 states and 408 transitions. [2022-04-27 11:14:34,443 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2022-04-27 11:14:34,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:34,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:34,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:34,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.3706896551724137) internal successors, (318), 232 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call 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,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 322 transitions. [2022-04-27 11:14:34,448 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 322 transitions. Word has length 31 [2022-04-27 11:14:34,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:34,448 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 322 transitions. [2022-04-27 11:14:34,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 44 states have internal predecessors, (70), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:34,449 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 322 transitions. [2022-04-27 11:14:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:14:34,449 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:34,449 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:34,475 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:14:34,671 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,SelfDestructingSolverStorable22 [2022-04-27 11:14:34,672 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1038157448, now seen corresponding path program 9 times [2022-04-27 11:14:34,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:34,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190401677] [2022-04-27 11:14:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:34,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:34,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:34,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {19432#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19417#true} is VALID [2022-04-27 11:14:34,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {19417#true} assume true; {19417#true} is VALID [2022-04-27 11:14:34,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19417#true} {19417#true} #72#return; {19417#true} is VALID [2022-04-27 11:14:34,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {19417#true} call ULTIMATE.init(); {19432#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:34,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {19432#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19417#true} is VALID [2022-04-27 11:14:34,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {19417#true} assume true; {19417#true} is VALID [2022-04-27 11:14:34,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19417#true} {19417#true} #72#return; {19417#true} is VALID [2022-04-27 11:14:34,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {19417#true} call #t~ret13 := main(); {19417#true} is VALID [2022-04-27 11:14:34,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {19417#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19422#(= main_~y~0 0)} is VALID [2022-04-27 11:14:34,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {19422#(= 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; {19423#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:34,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {19423#(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; {19424#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:34,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {19424#(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; {19425#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:34,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {19425#(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; {19426#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:34,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {19426#(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; {19427#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:34,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {19427#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {19427#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:34,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {19427#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {19428#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:14:34,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {19428#(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; {19429#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:14:34,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {19429#(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; {19430#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:34,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {19430#(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; {19431#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:34,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {19431#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19418#false} is VALID [2022-04-27 11:14:34,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {19418#false} assume !(~y~0 % 4294967296 > 0); {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {19418#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {19418#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {19418#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {19418#false} assume !(~x~0 % 4294967296 > 0); {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L272 TraceCheckUtils]: 27: Hoare triple {19418#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {19418#false} ~cond := #in~cond; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {19418#false} assume 0 == ~cond; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {19418#false} assume !false; {19418#false} is VALID [2022-04-27 11:14:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:14:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:34,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190401677] [2022-04-27 11:14:34,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190401677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:34,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166435172] [2022-04-27 11:14:34,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:14:34,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:34,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:34,846 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:14:34,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-27 11:14:34,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 11:14:34,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:34,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 11:14:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:34,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:35,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {19417#true} call ULTIMATE.init(); {19417#true} is VALID [2022-04-27 11:14:35,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {19417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19417#true} is VALID [2022-04-27 11:14:35,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {19417#true} assume true; {19417#true} is VALID [2022-04-27 11:14:35,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19417#true} {19417#true} #72#return; {19417#true} is VALID [2022-04-27 11:14:35,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {19417#true} call #t~ret13 := main(); {19417#true} is VALID [2022-04-27 11:14:35,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {19417#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19422#(= main_~y~0 0)} is VALID [2022-04-27 11:14:35,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {19422#(= 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; {19423#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:35,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {19423#(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; {19424#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:35,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {19424#(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; {19425#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:35,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {19425#(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; {19426#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:35,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {19426#(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; {19427#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:35,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {19427#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {19427#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:35,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {19427#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {19472#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:35,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {19472#(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; {19476#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:14:35,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {19476#(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; {19480#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:35,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {19480#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) 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; {19484#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {19484#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {19418#false} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {19418#false} assume !(~y~0 % 4294967296 > 0); {19418#false} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {19418#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19418#false} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {19418#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19418#false} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {19418#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19418#false} is VALID [2022-04-27 11:14:35,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {19418#false} assume !(~x~0 % 4294967296 > 0); {19418#false} is VALID [2022-04-27 11:14:35,113 INFO L272 TraceCheckUtils]: 27: Hoare triple {19418#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19418#false} is VALID [2022-04-27 11:14:35,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {19418#false} ~cond := #in~cond; {19418#false} is VALID [2022-04-27 11:14:35,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {19418#false} assume 0 == ~cond; {19418#false} is VALID [2022-04-27 11:14:35,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {19418#false} assume !false; {19418#false} is VALID [2022-04-27 11:14:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:14:35,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:35,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {19418#false} assume !false; {19418#false} is VALID [2022-04-27 11:14:35,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {19418#false} assume 0 == ~cond; {19418#false} is VALID [2022-04-27 11:14:35,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {19418#false} ~cond := #in~cond; {19418#false} is VALID [2022-04-27 11:14:35,330 INFO L272 TraceCheckUtils]: 27: Hoare triple {19418#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19418#false} is VALID [2022-04-27 11:14:35,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {19418#false} assume !(~x~0 % 4294967296 > 0); {19418#false} is VALID [2022-04-27 11:14:35,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {19418#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19418#false} is VALID [2022-04-27 11:14:35,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {19418#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19418#false} is VALID [2022-04-27 11:14:35,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {19418#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19418#false} is VALID [2022-04-27 11:14:35,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {19418#false} assume !(~y~0 % 4294967296 > 0); {19418#false} is VALID [2022-04-27 11:14:35,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {19418#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; {19418#false} is VALID [2022-04-27 11:14:35,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {19560#(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; {19418#false} is VALID [2022-04-27 11:14:35,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {19564#(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; {19560#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:14:35,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {19568#(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; {19564#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:14:35,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {19572#(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; {19568#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:14:35,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {19576#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19572#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:14:35,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {19580#(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; {19576#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-27 11:14:35,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {19584#(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; {19580#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:14:35,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {19588#(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; {19584#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-27 11:14:35,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {19417#true} ~z~0 := ~y~0; {19588#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:14:35,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {19417#true} assume !(~x~0 % 4294967296 > 0); {19417#true} is VALID [2022-04-27 11:14:35,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {19417#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; {19417#true} is VALID [2022-04-27 11:14:35,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {19417#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; {19417#true} is VALID [2022-04-27 11:14:35,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {19417#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; {19417#true} is VALID [2022-04-27 11:14:35,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {19417#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; {19417#true} is VALID [2022-04-27 11:14:35,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {19417#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; {19417#true} is VALID [2022-04-27 11:14:35,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {19417#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19417#true} is VALID [2022-04-27 11:14:35,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {19417#true} call #t~ret13 := main(); {19417#true} is VALID [2022-04-27 11:14:35,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19417#true} {19417#true} #72#return; {19417#true} is VALID [2022-04-27 11:14:35,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {19417#true} assume true; {19417#true} is VALID [2022-04-27 11:14:35,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {19417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19417#true} is VALID [2022-04-27 11:14:35,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {19417#true} call ULTIMATE.init(); {19417#true} is VALID [2022-04-27 11:14:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:14:35,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166435172] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:35,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:35,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 25 [2022-04-27 11:14:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274020456] [2022-04-27 11:14:35,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:35,338 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 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 31 [2022-04-27 11:14:35,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:35,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 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,368 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,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 11:14:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:35,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 11:14:35,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:14:35,369 INFO L87 Difference]: Start difference. First operand 237 states and 322 transitions. Second operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 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,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:39,151 INFO L93 Difference]: Finished difference Result 365 states and 466 transitions. [2022-04-27 11:14:39,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 11:14:39,151 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 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 31 [2022-04-27 11:14:39,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 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,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 111 transitions. [2022-04-27 11:14:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 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,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 111 transitions. [2022-04-27 11:14:39,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 111 transitions. [2022-04-27 11:14:39,253 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:14:39,257 INFO L225 Difference]: With dead ends: 365 [2022-04-27 11:14:39,257 INFO L226 Difference]: Without dead ends: 299 [2022-04-27 11:14:39,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=363, Invalid=2393, Unknown=0, NotChecked=0, Total=2756 [2022-04-27 11:14:39,258 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:39,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 102 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:14:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-27 11:14:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 222. [2022-04-27 11:14:40,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:40,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 222 states, 217 states have (on average 1.3410138248847927) internal successors, (291), 217 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call 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,172 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 222 states, 217 states have (on average 1.3410138248847927) internal successors, (291), 217 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call 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,173 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 222 states, 217 states have (on average 1.3410138248847927) internal successors, (291), 217 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call 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,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:40,177 INFO L93 Difference]: Finished difference Result 299 states and 385 transitions. [2022-04-27 11:14:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 385 transitions. [2022-04-27 11:14:40,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:40,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:40,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.3410138248847927) internal successors, (291), 217 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-27 11:14:40,177 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.3410138248847927) internal successors, (291), 217 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 299 states. [2022-04-27 11:14:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:40,182 INFO L93 Difference]: Finished difference Result 299 states and 385 transitions. [2022-04-27 11:14:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 385 transitions. [2022-04-27 11:14:40,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:40,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:40,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:40,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.3410138248847927) internal successors, (291), 217 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call 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,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 295 transitions. [2022-04-27 11:14:40,187 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 295 transitions. Word has length 31 [2022-04-27 11:14:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:40,187 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 295 transitions. [2022-04-27 11:14:40,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 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,187 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 295 transitions. [2022-04-27 11:14:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:14:40,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:40,188 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:40,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-27 11:14:40,399 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,SelfDestructingSolverStorable23 [2022-04-27 11:14:40,399 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1055332463, now seen corresponding path program 10 times [2022-04-27 11:14:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:40,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345426364] [2022-04-27 11:14:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:40,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:40,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {21142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21120#true} is VALID [2022-04-27 11:14:40,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {21120#true} assume true; {21120#true} is VALID [2022-04-27 11:14:40,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21120#true} {21120#true} #72#return; {21120#true} is VALID [2022-04-27 11:14:40,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {21120#true} call ULTIMATE.init(); {21142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:40,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {21142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21120#true} is VALID [2022-04-27 11:14:40,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {21120#true} assume true; {21120#true} is VALID [2022-04-27 11:14:40,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21120#true} {21120#true} #72#return; {21120#true} is VALID [2022-04-27 11:14:40,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {21120#true} call #t~ret13 := main(); {21120#true} is VALID [2022-04-27 11:14:40,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {21120#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21125#(= main_~y~0 0)} is VALID [2022-04-27 11:14:40,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {21125#(= 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; {21126#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:40,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(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; {21127#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:40,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {21127#(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; {21128#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:40,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {21128#(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; {21129#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:40,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {21129#(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; {21130#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:40,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {21130#(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; {21131#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:14:40,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {21131#(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; {21132#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:40,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {21132#(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; {21133#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:40,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {21133#(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; {21134#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:14:40,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {21134#(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; {21135#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:14:40,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {21135#(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; {21136#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:14:40,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {21136#(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; {21137#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:14:40,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {21137#(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; {21138#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:14:40,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {21138#(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; {21139#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:14:40,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {21139#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {21139#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:14:40,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {21139#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {21140#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:14:40,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {21140#(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; {21141#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:14:40,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {21141#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {21121#false} is VALID [2022-04-27 11:14:40,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {21121#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; {21121#false} is VALID [2022-04-27 11:14:40,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {21121#false} assume !(~y~0 % 4294967296 > 0); {21121#false} is VALID [2022-04-27 11:14:40,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {21121#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {21121#false} is VALID [2022-04-27 11:14:40,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {21121#false} assume !(~x~0 % 4294967296 > 0); {21121#false} is VALID [2022-04-27 11:14:40,710 INFO L272 TraceCheckUtils]: 28: Hoare triple {21121#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21121#false} is VALID [2022-04-27 11:14:40,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {21121#false} ~cond := #in~cond; {21121#false} is VALID [2022-04-27 11:14:40,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {21121#false} assume 0 == ~cond; {21121#false} is VALID [2022-04-27 11:14:40,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {21121#false} assume !false; {21121#false} is VALID [2022-04-27 11:14:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:14:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345426364] [2022-04-27 11:14:40,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345426364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404336554] [2022-04-27 11:14:40,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:14:40,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:40,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:40,712 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:14:40,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 11:14:40,760 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:14:40,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:40,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 11:14:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:40,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:41,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {21120#true} call ULTIMATE.init(); {21120#true} is VALID [2022-04-27 11:14:41,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {21120#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21120#true} is VALID [2022-04-27 11:14:41,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {21120#true} assume true; {21120#true} is VALID [2022-04-27 11:14:41,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21120#true} {21120#true} #72#return; {21120#true} is VALID [2022-04-27 11:14:41,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {21120#true} call #t~ret13 := main(); {21120#true} is VALID [2022-04-27 11:14:41,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {21120#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21125#(= main_~y~0 0)} is VALID [2022-04-27 11:14:41,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {21125#(= 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; {21126#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:41,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(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; {21127#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:41,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {21127#(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; {21128#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:41,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {21128#(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; {21129#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:41,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {21129#(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; {21130#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:41,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {21130#(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; {21131#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:14:41,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {21131#(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; {21132#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:14:41,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {21132#(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; {21133#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:14:41,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {21133#(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; {21134#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:14:41,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {21134#(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; {21135#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:14:41,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {21135#(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; {21136#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:14:41,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {21136#(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; {21137#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:14:41,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {21137#(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; {21138#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:14:41,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {21138#(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; {21139#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:14:41,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {21139#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {21139#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:14:41,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {21139#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {21140#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:14:41,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {21140#(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; {21212#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:14:41,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {21212#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {21121#false} is VALID [2022-04-27 11:14:41,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {21121#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; {21121#false} is VALID [2022-04-27 11:14:41,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {21121#false} assume !(~y~0 % 4294967296 > 0); {21121#false} is VALID [2022-04-27 11:14:41,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {21121#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {21121#false} is VALID [2022-04-27 11:14:41,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {21121#false} assume !(~x~0 % 4294967296 > 0); {21121#false} is VALID [2022-04-27 11:14:41,077 INFO L272 TraceCheckUtils]: 28: Hoare triple {21121#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21121#false} is VALID [2022-04-27 11:14:41,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {21121#false} ~cond := #in~cond; {21121#false} is VALID [2022-04-27 11:14:41,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {21121#false} assume 0 == ~cond; {21121#false} is VALID [2022-04-27 11:14:41,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {21121#false} assume !false; {21121#false} is VALID [2022-04-27 11:14:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:14:41,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:41,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {21121#false} assume !false; {21121#false} is VALID [2022-04-27 11:14:41,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {21121#false} assume 0 == ~cond; {21121#false} is VALID [2022-04-27 11:14:41,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {21121#false} ~cond := #in~cond; {21121#false} is VALID [2022-04-27 11:14:41,570 INFO L272 TraceCheckUtils]: 28: Hoare triple {21121#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21121#false} is VALID [2022-04-27 11:14:41,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {21121#false} assume !(~x~0 % 4294967296 > 0); {21121#false} is VALID [2022-04-27 11:14:41,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {21121#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {21121#false} is VALID [2022-04-27 11:14:41,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {21121#false} assume !(~y~0 % 4294967296 > 0); {21121#false} is VALID [2022-04-27 11:14:41,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {21121#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; {21121#false} is VALID [2022-04-27 11:14:41,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {21264#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21121#false} is VALID [2022-04-27 11:14:41,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {21268#(< 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; {21264#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:14:41,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {21272#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {21268#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:41,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {21272#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21272#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:41,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {21279#(< 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; {21272#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:41,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {21283#(< 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; {21279#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:14:41,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {21287#(< 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; {21283#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:14:41,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {21291#(< 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; {21287#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:14:41,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {21295#(< 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; {21291#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:14:41,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {21299#(< 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; {21295#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:14:41,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {21303#(< 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; {21299#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:14:41,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {21307#(< 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; {21303#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:14:41,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {21311#(< 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; {21307#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:14:41,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {21315#(< 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; {21311#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:14:41,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {21319#(< 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; {21315#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:14:41,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {21323#(< 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; {21319#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:14:41,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {21327#(< 0 (mod (+ main_~y~0 12) 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; {21323#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:14:41,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {21331#(< 0 (mod (+ main_~y~0 13) 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; {21327#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:14:41,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {21120#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21331#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-27 11:14:41,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {21120#true} call #t~ret13 := main(); {21120#true} is VALID [2022-04-27 11:14:41,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21120#true} {21120#true} #72#return; {21120#true} is VALID [2022-04-27 11:14:41,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {21120#true} assume true; {21120#true} is VALID [2022-04-27 11:14:41,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {21120#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21120#true} is VALID [2022-04-27 11:14:41,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {21120#true} call ULTIMATE.init(); {21120#true} is VALID [2022-04-27 11:14:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:14:41,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404336554] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:41,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:41,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-27 11:14:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291517017] [2022-04-27 11:14:41,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:41,584 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:14:41,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:41,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:41,625 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:41,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 11:14:41,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:41,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 11:14:41,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:14:41,626 INFO L87 Difference]: Start difference. First operand 222 states and 295 transitions. Second operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:15:02,157 WARN L232 SmtUtils]: Spent 10.98s 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:15:13,366 WARN L232 SmtUtils]: Spent 5.87s 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:15:28,995 WARN L232 SmtUtils]: Spent 12.21s 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:15:50,103 WARN L232 SmtUtils]: Spent 8.32s 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:15:59,263 WARN L232 SmtUtils]: Spent 6.70s 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) [2022-04-27 11:16:17,406 WARN L232 SmtUtils]: Spent 5.04s 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:16:32,483 WARN L232 SmtUtils]: Spent 5.99s 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:16:57,101 WARN L232 SmtUtils]: Spent 8.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:17:05,949 WARN L232 SmtUtils]: Spent 6.48s 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:18:52,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:19:29,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:19:47,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:19:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:52,984 INFO L93 Difference]: Finished difference Result 855 states and 1148 transitions. [2022-04-27 11:19:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-04-27 11:19:52,984 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:19:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 465 transitions. [2022-04-27 11:19:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 465 transitions. [2022-04-27 11:19:52,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 465 transitions. [2022-04-27 11:20:04,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 464 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:20:05,020 INFO L225 Difference]: With dead ends: 855 [2022-04-27 11:20:05,020 INFO L226 Difference]: Without dead ends: 817 [2022-04-27 11:20:05,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11648 ImplicationChecksByTransitivity, 239.4s TimeCoverageRelationStatistics Valid=7358, Invalid=23090, Unknown=2, NotChecked=0, Total=30450 [2022-04-27 11:20:05,023 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1121 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 1408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 3866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1408 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:20:05,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 179 Invalid, 3866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1408 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 29.4s Time] [2022-04-27 11:20:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-04-27 11:20:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 238. [2022-04-27 11:20:06,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:20:06,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 817 states. Second operand has 238 states, 233 states have (on average 1.3390557939914163) internal successors, (312), 233 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:06,056 INFO L74 IsIncluded]: Start isIncluded. First operand 817 states. Second operand has 238 states, 233 states have (on average 1.3390557939914163) internal successors, (312), 233 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:06,056 INFO L87 Difference]: Start difference. First operand 817 states. Second operand has 238 states, 233 states have (on average 1.3390557939914163) internal successors, (312), 233 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:20:06,075 INFO L93 Difference]: Finished difference Result 817 states and 1050 transitions. [2022-04-27 11:20:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1050 transitions. [2022-04-27 11:20:06,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:20:06,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:20:06,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.3390557939914163) internal successors, (312), 233 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 817 states. [2022-04-27 11:20:06,077 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.3390557939914163) internal successors, (312), 233 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 817 states. [2022-04-27 11:20:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:20:06,107 INFO L93 Difference]: Finished difference Result 817 states and 1050 transitions. [2022-04-27 11:20:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1050 transitions. [2022-04-27 11:20:06,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:20:06,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:20:06,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:20:06,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:20:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.3390557939914163) internal successors, (312), 233 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 316 transitions. [2022-04-27 11:20:06,113 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 316 transitions. Word has length 32 [2022-04-27 11:20:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:20:06,114 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 316 transitions. [2022-04-27 11:20:06,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 37 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 316 transitions. [2022-04-27 11:20:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 11:20:06,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:20:06,114 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:20:06,137 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:20:06,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:20:06,337 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:20:06,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:20:06,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1075287642, now seen corresponding path program 10 times [2022-04-27 11:20:06,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:20:06,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025219005] [2022-04-27 11:20:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:20:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:20:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:20:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:20:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:20:06,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {24766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24749#true} is VALID [2022-04-27 11:20:06,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {24749#true} assume true; {24749#true} is VALID [2022-04-27 11:20:06,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24749#true} {24749#true} #72#return; {24749#true} is VALID [2022-04-27 11:20:06,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {24749#true} call ULTIMATE.init(); {24766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:20:06,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {24766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24749#true} is VALID [2022-04-27 11:20:06,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {24749#true} assume true; {24749#true} is VALID [2022-04-27 11:20:06,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24749#true} {24749#true} #72#return; {24749#true} is VALID [2022-04-27 11:20:06,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {24749#true} call #t~ret13 := main(); {24749#true} is VALID [2022-04-27 11:20:06,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {24749#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24754#(= main_~y~0 0)} is VALID [2022-04-27 11:20:06,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {24754#(= 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; {24755#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:20:06,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {24755#(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; {24756#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:20:06,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {24756#(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; {24757#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:20:06,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {24757#(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; {24758#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:20:06,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {24758#(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; {24759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:06,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {24759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {24759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:06,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {24759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {24760#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:20:06,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {24760#(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; {24761#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:20:06,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {24761#(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; {24762#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:20:06,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {24762#(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; {24763#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:20:06,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {24763#(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; {24764#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:20:06,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {24764#(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; {24765#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:20:06,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {24765#(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; {24750#false} is VALID [2022-04-27 11:20:06,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:06,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:06,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {24750#false} assume !(~z~0 % 4294967296 > 0); {24750#false} is VALID [2022-04-27 11:20:06,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:06,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:06,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:06,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:06,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:06,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {24750#false} assume !(~y~0 % 4294967296 > 0); {24750#false} is VALID [2022-04-27 11:20:06,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {24750#false} assume !(~x~0 % 4294967296 > 0); {24750#false} is VALID [2022-04-27 11:20:06,657 INFO L272 TraceCheckUtils]: 29: Hoare triple {24750#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24750#false} is VALID [2022-04-27 11:20:06,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {24750#false} ~cond := #in~cond; {24750#false} is VALID [2022-04-27 11:20:06,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {24750#false} assume 0 == ~cond; {24750#false} is VALID [2022-04-27 11:20:06,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {24750#false} assume !false; {24750#false} is VALID [2022-04-27 11:20:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:20:06,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:20:06,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025219005] [2022-04-27 11:20:06,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025219005] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:20:06,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041307844] [2022-04-27 11:20:06,658 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:20:06,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:20:06,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:20:06,671 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:20:06,714 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:20:06,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:20:06,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:20:06,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 11:20:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:20:06,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:20:07,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {24749#true} call ULTIMATE.init(); {24749#true} is VALID [2022-04-27 11:20:07,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {24749#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24749#true} is VALID [2022-04-27 11:20:07,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {24749#true} assume true; {24749#true} is VALID [2022-04-27 11:20:07,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24749#true} {24749#true} #72#return; {24749#true} is VALID [2022-04-27 11:20:07,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {24749#true} call #t~ret13 := main(); {24749#true} is VALID [2022-04-27 11:20:07,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {24749#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24754#(= main_~y~0 0)} is VALID [2022-04-27 11:20:07,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {24754#(= 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; {24755#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:20:07,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {24755#(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; {24756#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:20:07,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {24756#(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; {24757#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:20:07,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {24757#(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; {24758#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:20:07,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {24758#(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; {24759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:07,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {24759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {24759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:07,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {24759#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {24806#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:07,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {24806#(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; {24810#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:20:07,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {24810#(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; {24814#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:07,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {24814#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) 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; {24818#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:07,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {24818#(and (= (+ (- 2) main_~y~0) (+ 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; {24822#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:07,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {24822#(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; {24826#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {24826#(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; {24750#false} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {24750#false} assume !(~z~0 % 4294967296 > 0); {24750#false} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {24750#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; {24750#false} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {24750#false} assume !(~y~0 % 4294967296 > 0); {24750#false} is VALID [2022-04-27 11:20:07,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {24750#false} assume !(~x~0 % 4294967296 > 0); {24750#false} is VALID [2022-04-27 11:20:07,187 INFO L272 TraceCheckUtils]: 29: Hoare triple {24750#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24750#false} is VALID [2022-04-27 11:20:07,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {24750#false} ~cond := #in~cond; {24750#false} is VALID [2022-04-27 11:20:07,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {24750#false} assume 0 == ~cond; {24750#false} is VALID [2022-04-27 11:20:07,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {24750#false} assume !false; {24750#false} is VALID [2022-04-27 11:20:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:20:07,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:20:07,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {24750#false} assume !false; {24750#false} is VALID [2022-04-27 11:20:07,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {24750#false} assume 0 == ~cond; {24750#false} is VALID [2022-04-27 11:20:07,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {24750#false} ~cond := #in~cond; {24750#false} is VALID [2022-04-27 11:20:07,533 INFO L272 TraceCheckUtils]: 29: Hoare triple {24750#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24750#false} is VALID [2022-04-27 11:20:07,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {24750#false} assume !(~x~0 % 4294967296 > 0); {24750#false} is VALID [2022-04-27 11:20:07,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {24887#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {24750#false} is VALID [2022-04-27 11:20:07,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {24891#(< 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; {24887#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:20:07,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {24895#(< 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; {24891#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:20:07,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {24899#(< 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; {24895#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:20:07,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {24903#(< 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; {24899#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:20:07,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {24907#(< 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; {24903#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:20:07,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {24907#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {24907#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:20:07,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {24907#(< 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; {24907#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:20:07,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {24907#(< 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; {24907#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:20:07,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {24920#(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; {24907#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:20:07,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {24924#(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; {24920#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:20:07,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {24928#(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; {24924#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:20:07,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {24932#(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; {24928#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:20:07,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {24936#(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; {24932#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:20:07,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {24940#(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; {24936#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:20:07,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {24749#true} ~z~0 := ~y~0; {24940#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:20:07,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {24749#true} assume !(~x~0 % 4294967296 > 0); {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {24749#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; {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {24749#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; {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {24749#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; {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {24749#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; {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {24749#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; {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {24749#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {24749#true} call #t~ret13 := main(); {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24749#true} {24749#true} #72#return; {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {24749#true} assume true; {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {24749#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24749#true} is VALID [2022-04-27 11:20:07,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {24749#true} call ULTIMATE.init(); {24749#true} is VALID [2022-04-27 11:20:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:20:07,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041307844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:20:07,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:20:07,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2022-04-27 11:20:07,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886037356] [2022-04-27 11:20:07,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:20:07,544 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:20:07,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:20:07,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:07,583 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:20:07,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-27 11:20:07,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:20:07,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-27 11:20:07,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:20:07,584 INFO L87 Difference]: Start difference. First operand 238 states and 316 transitions. Second operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:20:13,764 INFO L93 Difference]: Finished difference Result 435 states and 530 transitions. [2022-04-27 11:20:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-27 11:20:13,764 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:20:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:20:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 163 transitions. [2022-04-27 11:20:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 163 transitions. [2022-04-27 11:20:13,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 163 transitions. [2022-04-27 11:20:14,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:20:14,118 INFO L225 Difference]: With dead ends: 435 [2022-04-27 11:20:14,118 INFO L226 Difference]: Without dead ends: 415 [2022-04-27 11:20:14,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2122 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1384, Invalid=6272, Unknown=0, NotChecked=0, Total=7656 [2022-04-27 11:20:14,119 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 295 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:20:14,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 81 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 11:20:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-04-27 11:20:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 239. [2022-04-27 11:20:15,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:20:15,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states. Second operand has 239 states, 234 states have (on average 1.3333333333333333) internal successors, (312), 234 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:15,169 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand has 239 states, 234 states have (on average 1.3333333333333333) internal successors, (312), 234 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:15,169 INFO L87 Difference]: Start difference. First operand 415 states. Second operand has 239 states, 234 states have (on average 1.3333333333333333) internal successors, (312), 234 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:20:15,177 INFO L93 Difference]: Finished difference Result 415 states and 505 transitions. [2022-04-27 11:20:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 505 transitions. [2022-04-27 11:20:15,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:20:15,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:20:15,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.3333333333333333) internal successors, (312), 234 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 415 states. [2022-04-27 11:20:15,179 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.3333333333333333) internal successors, (312), 234 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 415 states. [2022-04-27 11:20:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:20:15,188 INFO L93 Difference]: Finished difference Result 415 states and 505 transitions. [2022-04-27 11:20:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 505 transitions. [2022-04-27 11:20:15,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:20:15,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:20:15,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:20:15,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:20:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.3333333333333333) internal successors, (312), 234 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 316 transitions. [2022-04-27 11:20:15,193 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 316 transitions. Word has length 33 [2022-04-27 11:20:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:20:15,193 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 316 transitions. [2022-04-27 11:20:15,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 316 transitions. [2022-04-27 11:20:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 11:20:15,194 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:20:15,194 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:20:15,219 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:20:15,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:20:15,415 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:20:15,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:20:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash -475206312, now seen corresponding path program 11 times [2022-04-27 11:20:15,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:20:15,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299789634] [2022-04-27 11:20:15,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:20:15,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:20:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:20:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:20:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:20:15,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {26881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26864#true} is VALID [2022-04-27 11:20:15,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {26864#true} assume true; {26864#true} is VALID [2022-04-27 11:20:15,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26864#true} {26864#true} #72#return; {26864#true} is VALID [2022-04-27 11:20:15,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {26864#true} call ULTIMATE.init(); {26881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:20:15,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {26881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26864#true} is VALID [2022-04-27 11:20:15,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {26864#true} assume true; {26864#true} is VALID [2022-04-27 11:20:15,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26864#true} {26864#true} #72#return; {26864#true} is VALID [2022-04-27 11:20:15,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {26864#true} call #t~ret13 := main(); {26864#true} is VALID [2022-04-27 11:20:15,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {26864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26864#true} is VALID [2022-04-27 11:20:15,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {26864#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; {26869#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:20:15,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {26869#(<= 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; {26870#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-27 11:20:15,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {26870#(<= 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; {26871#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:20:15,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {26871#(<= 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; {26872#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:20:15,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {26872#(<= 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; {26873#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:20:15,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {26873#(<= 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; {26874#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:20:15,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {26874#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {26874#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:20:15,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {26874#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {26874#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:20:15,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {26874#(<= (* 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; {26875#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:20:15,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {26875#(<= (+ (* (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; {26876#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-27 11:20:15,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {26876#(<= (+ (* (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; {26877#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-27 11:20:15,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {26877#(<= (+ (* 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; {26878#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:20:15,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {26878#(<= (+ (* (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; {26879#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:20:15,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {26879#(<= (+ 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; {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:20:15,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:20:15,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {26880#(<= (+ 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; {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:20:15,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {26880#(<= (+ 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; {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:20:15,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {26880#(<= (+ 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; {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:20:15,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {26880#(<= (+ 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; {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:20:15,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {26880#(<= (+ 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; {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:20:15,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {26880#(<= (+ 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; {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:20:15,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:20:15,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {26880#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {26865#false} is VALID [2022-04-27 11:20:15,638 INFO L272 TraceCheckUtils]: 29: Hoare triple {26865#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26865#false} is VALID [2022-04-27 11:20:15,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {26865#false} ~cond := #in~cond; {26865#false} is VALID [2022-04-27 11:20:15,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {26865#false} assume 0 == ~cond; {26865#false} is VALID [2022-04-27 11:20:15,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {26865#false} assume !false; {26865#false} is VALID [2022-04-27 11:20:15,639 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:20:15,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:20:15,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299789634] [2022-04-27 11:20:15,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299789634] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:20:15,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001619875] [2022-04-27 11:20:15,639 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:20:15,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:20:15,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:20:15,643 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:20:15,645 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:20:16,027 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:20:16,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:20:16,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:20:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:20:16,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:20:16,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {26864#true} call ULTIMATE.init(); {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {26864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {26864#true} assume true; {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26864#true} {26864#true} #72#return; {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {26864#true} call #t~ret13 := main(); {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {26864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {26864#true} assume !(~x~0 % 4294967296 > 0); {26921#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:20:16,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {26921#(not (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {26921#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:20:16,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {26921#(not (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26928#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:20:16,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {26928#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26932#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:20:16,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {26932#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26936#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:20:16,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {26936#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26940#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {26940#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26944#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {26944#(not (< 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; {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {26948#(not (< 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; {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {26948#(not (< 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; {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {26948#(not (< 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; {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {26948#(not (< 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; {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {26948#(not (< 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; {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {26948#(not (< 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; {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:16,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {26948#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {26865#false} is VALID [2022-04-27 11:20:16,443 INFO L272 TraceCheckUtils]: 29: Hoare triple {26865#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26865#false} is VALID [2022-04-27 11:20:16,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {26865#false} ~cond := #in~cond; {26865#false} is VALID [2022-04-27 11:20:16,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {26865#false} assume 0 == ~cond; {26865#false} is VALID [2022-04-27 11:20:16,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {26865#false} assume !false; {26865#false} is VALID [2022-04-27 11:20:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-27 11:20:16,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:20:16,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {26865#false} assume !false; {26865#false} is VALID [2022-04-27 11:20:16,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {26865#false} assume 0 == ~cond; {26865#false} is VALID [2022-04-27 11:20:16,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {26865#false} ~cond := #in~cond; {26865#false} is VALID [2022-04-27 11:20:16,636 INFO L272 TraceCheckUtils]: 29: Hoare triple {26865#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26865#false} is VALID [2022-04-27 11:20:16,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {27000#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {26865#false} is VALID [2022-04-27 11:20:16,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {27000#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {27000#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:20:16,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {27000#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27000#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:20:16,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {27000#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27000#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:20:16,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {27000#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27000#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:20:16,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {27000#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27000#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:20:16,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {27000#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27000#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:20:16,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {27000#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27000#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:20:16,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {27000#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27000#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:20:16,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {26869#(<= 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; {27000#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:20:16,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {27031#(<= 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; {26869#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:20:16,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {27035#(<= 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; {27031#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-27 11:20:16,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {27039#(<= 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; {27035#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-27 11:20:16,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {27043#(<= 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; {27039#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-27 11:20:16,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {27047#(<= 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; {27043#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-27 11:20:16,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {27047#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {27047#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:20:16,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {26864#true} assume !(~x~0 % 4294967296 > 0); {27047#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-27 11:20:16,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {26864#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; {26864#true} is VALID [2022-04-27 11:20:16,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {26864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26864#true} is VALID [2022-04-27 11:20:16,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {26864#true} call #t~ret13 := main(); {26864#true} is VALID [2022-04-27 11:20:16,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26864#true} {26864#true} #72#return; {26864#true} is VALID [2022-04-27 11:20:16,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {26864#true} assume true; {26864#true} is VALID [2022-04-27 11:20:16,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {26864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26864#true} is VALID [2022-04-27 11:20:16,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {26864#true} call ULTIMATE.init(); {26864#true} is VALID [2022-04-27 11:20:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-27 11:20:16,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001619875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:20:16,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:20:16,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 28 [2022-04-27 11:20:16,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60290168] [2022-04-27 11:20:16,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:20:16,648 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:20:16,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:20:16,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:16,699 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:20:16,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 11:20:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:20:16,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 11:20:16,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:20:16,701 INFO L87 Difference]: Start difference. First operand 239 states and 316 transitions. Second operand has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:20:36,171 INFO L93 Difference]: Finished difference Result 559 states and 780 transitions. [2022-04-27 11:20:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 11:20:36,171 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:20:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:20:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 168 transitions. [2022-04-27 11:20:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 168 transitions. [2022-04-27 11:20:36,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 168 transitions. [2022-04-27 11:20:36,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:20:36,472 INFO L225 Difference]: With dead ends: 559 [2022-04-27 11:20:36,472 INFO L226 Difference]: Without dead ends: 551 [2022-04-27 11:20:36,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1190, Invalid=3365, Unknown=1, NotChecked=0, Total=4556 [2022-04-27 11:20:36,474 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 233 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:20:36,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 90 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-27 11:20:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-04-27 11:20:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 372. [2022-04-27 11:20:38,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:20:38,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand has 372 states, 367 states have (on average 1.457765667574932) internal successors, (535), 367 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:38,216 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand has 372 states, 367 states have (on average 1.457765667574932) internal successors, (535), 367 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:38,217 INFO L87 Difference]: Start difference. First operand 551 states. Second operand has 372 states, 367 states have (on average 1.457765667574932) internal successors, (535), 367 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:20:38,230 INFO L93 Difference]: Finished difference Result 551 states and 736 transitions. [2022-04-27 11:20:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 736 transitions. [2022-04-27 11:20:38,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:20:38,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:20:38,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 372 states, 367 states have (on average 1.457765667574932) internal successors, (535), 367 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-27 11:20:38,232 INFO L87 Difference]: Start difference. First operand has 372 states, 367 states have (on average 1.457765667574932) internal successors, (535), 367 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 551 states. [2022-04-27 11:20:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:20:38,245 INFO L93 Difference]: Finished difference Result 551 states and 736 transitions. [2022-04-27 11:20:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 736 transitions. [2022-04-27 11:20:38,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:20:38,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:20:38,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:20:38,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:20:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 367 states have (on average 1.457765667574932) internal successors, (535), 367 states have internal predecessors, (535), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 539 transitions. [2022-04-27 11:20:38,255 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 539 transitions. Word has length 33 [2022-04-27 11:20:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:20:38,256 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 539 transitions. [2022-04-27 11:20:38,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:20:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 539 transitions. [2022-04-27 11:20:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:20:38,256 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:20:38,256 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:20:38,261 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:20:38,461 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,SelfDestructingSolverStorable26 [2022-04-27 11:20:38,461 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:20:38,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:20:38,462 INFO L85 PathProgramCache]: Analyzing trace with hash 144704712, now seen corresponding path program 11 times [2022-04-27 11:20:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:20:38,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669539364] [2022-04-27 11:20:38,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:20:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:20:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:20:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:20:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:20:39,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {29654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29633#true} is VALID [2022-04-27 11:20:39,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {29633#true} assume true; {29633#true} is VALID [2022-04-27 11:20:39,046 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29633#true} {29633#true} #72#return; {29633#true} is VALID [2022-04-27 11:20:39,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {29633#true} call ULTIMATE.init(); {29654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:20:39,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {29654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29633#true} is VALID [2022-04-27 11:20:39,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {29633#true} assume true; {29633#true} is VALID [2022-04-27 11:20:39,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29633#true} {29633#true} #72#return; {29633#true} is VALID [2022-04-27 11:20:39,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {29633#true} call #t~ret13 := main(); {29633#true} is VALID [2022-04-27 11:20:39,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {29633#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29638#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:20:39,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {29638#(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; {29639#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:20:39,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {29639#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~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; {29640#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:20:39,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {29640#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {29641#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:20:39,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {29641#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 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; {29642#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:20:39,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {29642#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) 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; {29643#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:39,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {29643#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {29644#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:39,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {29644#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 5))} ~z~0 := ~y~0; {29644#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:39,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {29644#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= 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; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:39,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) 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; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:39,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) 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; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:39,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) 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; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:39,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) 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; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:39,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:39,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-27 11:20:39,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~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; {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-27 11:20:39,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-27 11:20:39,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-27 11:20:39,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29650#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-27 11:20:39,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {29650#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} assume !(~y~0 % 4294967296 > 0); {29650#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-27 11:20:39,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {29650#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-27 11:20:39,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-27 11:20:39,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-27 11:20:39,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-27 11:20:39,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:39,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:39,081 INFO L272 TraceCheckUtils]: 31: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:20:39,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {29652#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29653#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:20:39,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {29653#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29634#false} is VALID [2022-04-27 11:20:39,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {29634#false} assume !false; {29634#false} is VALID [2022-04-27 11:20:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:20:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:20:39,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669539364] [2022-04-27 11:20:39,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669539364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:20:39,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310108883] [2022-04-27 11:20:39,082 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:20:39,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:20:39,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:20:39,083 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:20:39,084 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:20:39,312 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:20:39,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:20:39,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 11:20:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:20:39,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:20:40,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {29633#true} call ULTIMATE.init(); {29633#true} is VALID [2022-04-27 11:20:40,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {29633#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29633#true} is VALID [2022-04-27 11:20:40,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {29633#true} assume true; {29633#true} is VALID [2022-04-27 11:20:40,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29633#true} {29633#true} #72#return; {29633#true} is VALID [2022-04-27 11:20:40,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {29633#true} call #t~ret13 := main(); {29633#true} is VALID [2022-04-27 11:20:40,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {29633#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29638#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:20:40,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {29638#(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; {29676#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 11:20:40,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {29676#(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; {29680#(and (= (+ (- 2) main_~y~0) 0) (= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:20:40,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {29680#(and (= (+ (- 2) main_~y~0) 0) (= 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; {29684#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3))} is VALID [2022-04-27 11:20:40,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {29684#(and (= (+ main_~x~0 3) main_~n~0) (= 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; {29688#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)))} is VALID [2022-04-27 11:20:40,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {29688#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~n~0 (- 3)) (+ main_~x~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; {29643#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {29643#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} ~z~0 := ~y~0; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) 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; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) 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; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) 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; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) 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; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) 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; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-27 11:20:40,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~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; {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-27 11:20:40,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-27 11:20:40,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-27 11:20:40,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29650#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-27 11:20:40,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {29650#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} assume !(~y~0 % 4294967296 > 0); {29650#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-27 11:20:40,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {29650#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-27 11:20:40,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-27 11:20:40,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-27 11:20:40,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-27 11:20:40,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:20:40,194 INFO L272 TraceCheckUtils]: 31: Hoare triple {29645#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29755#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:20:40,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {29755#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29759#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:20:40,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {29759#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29634#false} is VALID [2022-04-27 11:20:40,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {29634#false} assume !false; {29634#false} is VALID [2022-04-27 11:20:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:20:40,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:20:41,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {29634#false} assume !false; {29634#false} is VALID [2022-04-27 11:20:41,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {29759#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29634#false} is VALID [2022-04-27 11:20:41,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {29755#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29759#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:20:41,424 INFO L272 TraceCheckUtils]: 31: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29755#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:20:41,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {29781#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {29785#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29781#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:20:41,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {29789#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29785#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {29793#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29789#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4)))} is VALID [2022-04-27 11:20:41,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {29797#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {29793#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} is VALID [2022-04-27 11:20:41,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {29797#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {29797#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:20:41,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {29793#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29797#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:20:41,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {29789#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 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; {29793#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} is VALID [2022-04-27 11:20:41,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {29785#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) 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; {29789#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4)))} is VALID [2022-04-27 11:20:41,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {29781#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~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; {29785#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) 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; {29781#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:20:41,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) 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; {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) 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; {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) 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; {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) 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; {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) 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; {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {29840#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {29651#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:20:41,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {29844#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 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; {29840#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:20:41,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {29848#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 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; {29844#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:20:41,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {29852#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 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; {29848#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:20:41,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {29856#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 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; {29852#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:20:41,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {29860#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 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; {29856#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:20:41,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {29633#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29860#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:20:41,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {29633#true} call #t~ret13 := main(); {29633#true} is VALID [2022-04-27 11:20:41,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29633#true} {29633#true} #72#return; {29633#true} is VALID [2022-04-27 11:20:41,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {29633#true} assume true; {29633#true} is VALID [2022-04-27 11:20:41,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {29633#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29633#true} is VALID [2022-04-27 11:20:41,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {29633#true} call ULTIMATE.init(); {29633#true} is VALID [2022-04-27 11:20:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:20:41,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310108883] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:20:41,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:20:41,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 36 [2022-04-27 11:20:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568998122] [2022-04-27 11:20:41,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:20:41,450 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 33 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 35 [2022-04-27 11:20:41,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:20:41,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 33 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:20:41,655 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:20:41,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-27 11:20:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:20:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-27 11:20:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 11:20:41,656 INFO L87 Difference]: Start difference. First operand 372 states and 539 transitions. Second operand has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 33 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:21:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:04,399 INFO L93 Difference]: Finished difference Result 570 states and 736 transitions. [2022-04-27 11:21:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-27 11:21:04,400 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 33 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 35 [2022-04-27 11:21:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:21:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 33 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:21:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 86 transitions. [2022-04-27 11:21:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 33 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:21:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 86 transitions. [2022-04-27 11:21:04,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 86 transitions. [2022-04-27 11:21:04,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:04,761 INFO L225 Difference]: With dead ends: 570 [2022-04-27 11:21:04,761 INFO L226 Difference]: Without dead ends: 546 [2022-04-27 11:21:04,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=628, Invalid=5376, Unknown=2, NotChecked=0, Total=6006 [2022-04-27 11:21:04,762 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 94 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:21:04,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 80 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 11:21:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-04-27 11:21:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 365. [2022-04-27 11:21:06,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:21:06,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 546 states. Second operand has 365 states, 360 states have (on average 1.4638888888888888) internal successors, (527), 360 states have internal predecessors, (527), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:06,690 INFO L74 IsIncluded]: Start isIncluded. First operand 546 states. Second operand has 365 states, 360 states have (on average 1.4638888888888888) internal successors, (527), 360 states have internal predecessors, (527), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:06,690 INFO L87 Difference]: Start difference. First operand 546 states. Second operand has 365 states, 360 states have (on average 1.4638888888888888) internal successors, (527), 360 states have internal predecessors, (527), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:06,704 INFO L93 Difference]: Finished difference Result 546 states and 712 transitions. [2022-04-27 11:21:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 712 transitions. [2022-04-27 11:21:06,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:06,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:06,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 360 states have (on average 1.4638888888888888) internal successors, (527), 360 states have internal predecessors, (527), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 546 states. [2022-04-27 11:21:06,706 INFO L87 Difference]: Start difference. First operand has 365 states, 360 states have (on average 1.4638888888888888) internal successors, (527), 360 states have internal predecessors, (527), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 546 states. [2022-04-27 11:21:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:06,719 INFO L93 Difference]: Finished difference Result 546 states and 712 transitions. [2022-04-27 11:21:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 712 transitions. [2022-04-27 11:21:06,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:06,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:06,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:21:06,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:21:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.4638888888888888) internal successors, (527), 360 states have internal predecessors, (527), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 531 transitions. [2022-04-27 11:21:06,729 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 531 transitions. Word has length 35 [2022-04-27 11:21:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:21:06,729 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 531 transitions. [2022-04-27 11:21:06,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 33 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:21:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 531 transitions. [2022-04-27 11:21:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:21:06,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:21:06,730 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:21:06,735 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:21:06,935 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,SelfDestructingSolverStorable27 [2022-04-27 11:21:06,935 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:21:06,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:21:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1255449176, now seen corresponding path program 12 times [2022-04-27 11:21:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:21:06,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829827510] [2022-04-27 11:21:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:21:06,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:21:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:07,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:21:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:07,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {32425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32408#true} is VALID [2022-04-27 11:21:07,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {32408#true} assume true; {32408#true} is VALID [2022-04-27 11:21:07,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32408#true} {32408#true} #72#return; {32408#true} is VALID [2022-04-27 11:21:07,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {32408#true} call ULTIMATE.init(); {32425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:21:07,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {32425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32408#true} is VALID [2022-04-27 11:21:07,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {32408#true} assume true; {32408#true} is VALID [2022-04-27 11:21:07,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32408#true} {32408#true} #72#return; {32408#true} is VALID [2022-04-27 11:21:07,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {32408#true} call #t~ret13 := main(); {32408#true} is VALID [2022-04-27 11:21:07,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {32408#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32413#(= main_~y~0 0)} is VALID [2022-04-27 11:21:07,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {32413#(= 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; {32414#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:21:07,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {32414#(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; {32415#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:21:07,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {32415#(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; {32416#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:21:07,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {32416#(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; {32417#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:21:07,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {32417#(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; {32418#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:21:07,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {32418#(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; {32419#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:07,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {32419#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32419#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:07,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {32419#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32420#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:21:07,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {32420#(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; {32421#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:21:07,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {32421#(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; {32422#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:21:07,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {32422#(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; {32423#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:21:07,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {32423#(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; {32424#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:21:07,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {32424#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {32409#false} assume !(~y~0 % 4294967296 > 0); {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {32409#false} assume !(~x~0 % 4294967296 > 0); {32409#false} is VALID [2022-04-27 11:21:07,157 INFO L272 TraceCheckUtils]: 31: Hoare triple {32409#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32409#false} is VALID [2022-04-27 11:21:07,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {32409#false} ~cond := #in~cond; {32409#false} is VALID [2022-04-27 11:21:07,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {32409#false} assume 0 == ~cond; {32409#false} is VALID [2022-04-27 11:21:07,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {32409#false} assume !false; {32409#false} is VALID [2022-04-27 11:21:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-27 11:21:07,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:21:07,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829827510] [2022-04-27 11:21:07,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829827510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:21:07,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142289104] [2022-04-27 11:21:07,157 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:21:07,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:07,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:21:07,159 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:21:07,163 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:21:07,236 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-27 11:21:07,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:21:07,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 11:21:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:07,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:21:07,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {32408#true} call ULTIMATE.init(); {32408#true} is VALID [2022-04-27 11:21:07,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {32408#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32408#true} is VALID [2022-04-27 11:21:07,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {32408#true} assume true; {32408#true} is VALID [2022-04-27 11:21:07,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32408#true} {32408#true} #72#return; {32408#true} is VALID [2022-04-27 11:21:07,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {32408#true} call #t~ret13 := main(); {32408#true} is VALID [2022-04-27 11:21:07,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {32408#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32413#(= main_~y~0 0)} is VALID [2022-04-27 11:21:07,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {32413#(= 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; {32414#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:21:07,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {32414#(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; {32415#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:21:07,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {32415#(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; {32416#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:21:07,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {32416#(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; {32417#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:21:07,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {32417#(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; {32418#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:21:07,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {32418#(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; {32419#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:07,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {32419#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32419#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:07,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {32419#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32468#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:07,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {32468#(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; {32472#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:21:07,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {32472#(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; {32476#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:07,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {32476#(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; {32480#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:07,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {32480#(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; {32484#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:07,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {32484#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {32409#false} is VALID [2022-04-27 11:21:07,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {32409#false} assume !(~y~0 % 4294967296 > 0); {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {32409#false} assume !(~x~0 % 4294967296 > 0); {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L272 TraceCheckUtils]: 31: Hoare triple {32409#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {32409#false} ~cond := #in~cond; {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {32409#false} assume 0 == ~cond; {32409#false} is VALID [2022-04-27 11:21:07,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {32409#false} assume !false; {32409#false} is VALID [2022-04-27 11:21:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-27 11:21:07,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:21:07,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {32409#false} assume !false; {32409#false} is VALID [2022-04-27 11:21:07,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {32409#false} assume 0 == ~cond; {32409#false} is VALID [2022-04-27 11:21:07,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {32409#false} ~cond := #in~cond; {32409#false} is VALID [2022-04-27 11:21:07,847 INFO L272 TraceCheckUtils]: 31: Hoare triple {32409#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32409#false} is VALID [2022-04-27 11:21:07,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {32409#false} assume !(~x~0 % 4294967296 > 0); {32409#false} is VALID [2022-04-27 11:21:07,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {32409#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32409#false} is VALID [2022-04-27 11:21:07,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {32409#false} assume !(~y~0 % 4294967296 > 0); {32409#false} is VALID [2022-04-27 11:21:07,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {32409#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; {32409#false} is VALID [2022-04-27 11:21:07,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {32569#(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; {32409#false} is VALID [2022-04-27 11:21:07,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {32573#(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; {32569#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:21:07,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {32577#(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; {32573#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:21:07,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {32581#(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; {32577#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:21:07,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {32585#(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; {32581#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:21:07,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {32589#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {32585#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:21:07,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {32593#(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; {32589#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:21:07,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {32597#(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; {32593#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:21:07,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {32601#(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; {32597#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:21:07,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {32605#(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; {32601#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:21:07,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {32408#true} ~z~0 := ~y~0; {32605#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:21:07,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {32408#true} assume !(~x~0 % 4294967296 > 0); {32408#true} is VALID [2022-04-27 11:21:07,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {32408#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; {32408#true} is VALID [2022-04-27 11:21:07,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {32408#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; {32408#true} is VALID [2022-04-27 11:21:07,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {32408#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; {32408#true} is VALID [2022-04-27 11:21:07,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {32408#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; {32408#true} is VALID [2022-04-27 11:21:07,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {32408#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; {32408#true} is VALID [2022-04-27 11:21:07,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {32408#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; {32408#true} is VALID [2022-04-27 11:21:07,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {32408#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32408#true} is VALID [2022-04-27 11:21:07,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {32408#true} call #t~ret13 := main(); {32408#true} is VALID [2022-04-27 11:21:07,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32408#true} {32408#true} #72#return; {32408#true} is VALID [2022-04-27 11:21:07,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {32408#true} assume true; {32408#true} is VALID [2022-04-27 11:21:07,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {32408#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32408#true} is VALID [2022-04-27 11:21:07,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {32408#true} call ULTIMATE.init(); {32408#true} is VALID [2022-04-27 11:21:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-27 11:21:07,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142289104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:21:07,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:21:07,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 30 [2022-04-27 11:21:07,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889216781] [2022-04-27 11:21:07,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:21:07,858 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 29 states have internal predecessors, (44), 2 states have call successors, (4), 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:21:07,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:21:07,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 29 states have internal predecessors, (44), 2 states have call successors, (4), 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:21:07,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:07,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 11:21:07,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:21:07,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 11:21:07,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2022-04-27 11:21:07,894 INFO L87 Difference]: Start difference. First operand 365 states and 531 transitions. Second operand has 30 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 29 states have internal predecessors, (44), 2 states have call successors, (4), 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:21:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:14,649 INFO L93 Difference]: Finished difference Result 559 states and 741 transitions. [2022-04-27 11:21:14,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-27 11:21:14,650 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 29 states have internal predecessors, (44), 2 states have call successors, (4), 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:21:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:21:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 29 states have internal predecessors, (44), 2 states have call successors, (4), 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:21:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 128 transitions. [2022-04-27 11:21:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 29 states have internal predecessors, (44), 2 states have call successors, (4), 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:21:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 128 transitions. [2022-04-27 11:21:14,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 128 transitions. [2022-04-27 11:21:14,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:21:14,790 INFO L225 Difference]: With dead ends: 559 [2022-04-27 11:21:14,790 INFO L226 Difference]: Without dead ends: 475 [2022-04-27 11:21:14,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=486, Invalid=3546, Unknown=0, NotChecked=0, Total=4032 [2022-04-27 11:21:14,791 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:21:14,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 120 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-27 11:21:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-27 11:21:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 347. [2022-04-27 11:21:16,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:21:16,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 347 states, 342 states have (on average 1.4415204678362572) internal successors, (493), 342 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:16,654 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 347 states, 342 states have (on average 1.4415204678362572) internal successors, (493), 342 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:16,655 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 347 states, 342 states have (on average 1.4415204678362572) internal successors, (493), 342 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:16,665 INFO L93 Difference]: Finished difference Result 475 states and 641 transitions. [2022-04-27 11:21:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 641 transitions. [2022-04-27 11:21:16,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:16,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:16,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 347 states, 342 states have (on average 1.4415204678362572) internal successors, (493), 342 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 475 states. [2022-04-27 11:21:16,667 INFO L87 Difference]: Start difference. First operand has 347 states, 342 states have (on average 1.4415204678362572) internal successors, (493), 342 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 475 states. [2022-04-27 11:21:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:21:16,677 INFO L93 Difference]: Finished difference Result 475 states and 641 transitions. [2022-04-27 11:21:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 641 transitions. [2022-04-27 11:21:16,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:21:16,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:21:16,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:21:16,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:21:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 342 states have (on average 1.4415204678362572) internal successors, (493), 342 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 497 transitions. [2022-04-27 11:21:16,686 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 497 transitions. Word has length 35 [2022-04-27 11:21:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:21:16,687 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 497 transitions. [2022-04-27 11:21:16,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 29 states have internal predecessors, (44), 2 states have call successors, (4), 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:21:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 497 transitions. [2022-04-27 11:21:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:21:16,688 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:21:16,688 INFO L195 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:21:16,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-27 11:21:16,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-27 11:21:16,911 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:21:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:21:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash 662902689, now seen corresponding path program 13 times [2022-04-27 11:21:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:21:16,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602810406] [2022-04-27 11:21:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:21:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:21:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:17,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:21:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:17,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {35031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35007#true} is VALID [2022-04-27 11:21:17,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {35007#true} assume true; {35007#true} is VALID [2022-04-27 11:21:17,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35007#true} {35007#true} #72#return; {35007#true} is VALID [2022-04-27 11:21:17,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {35007#true} call ULTIMATE.init(); {35031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:21:17,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {35031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35007#true} is VALID [2022-04-27 11:21:17,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {35007#true} assume true; {35007#true} is VALID [2022-04-27 11:21:17,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35007#true} {35007#true} #72#return; {35007#true} is VALID [2022-04-27 11:21:17,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {35007#true} call #t~ret13 := main(); {35007#true} is VALID [2022-04-27 11:21:17,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {35007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35012#(= main_~y~0 0)} is VALID [2022-04-27 11:21:17,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {35012#(= 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; {35013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:21:17,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {35013#(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; {35014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:21:17,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {35014#(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; {35015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:21:17,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {35015#(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; {35016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:21:17,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {35016#(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; {35017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:21:17,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {35017#(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; {35018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:17,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {35018#(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; {35019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:17,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {35019#(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; {35020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:21:17,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {35020#(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; {35021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:21:17,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {35021#(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; {35022#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:21:17,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {35022#(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; {35023#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:21:17,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {35023#(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; {35024#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:21:17,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {35024#(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; {35025#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:21:17,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {35025#(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; {35026#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:21:17,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {35026#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:21:17,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {35027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {35027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:21:17,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {35027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {35028#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:21:17,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {35028#(and (<= main_~z~0 15) (<= 15 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; {35029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:21:17,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {35029#(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; {35030#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:21:17,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {35030#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {35008#false} is VALID [2022-04-27 11:21:17,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {35008#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; {35008#false} is VALID [2022-04-27 11:21:17,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {35008#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; {35008#false} is VALID [2022-04-27 11:21:17,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {35008#false} assume !(~y~0 % 4294967296 > 0); {35008#false} is VALID [2022-04-27 11:21:17,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {35008#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35008#false} is VALID [2022-04-27 11:21:17,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {35008#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35008#false} is VALID [2022-04-27 11:21:17,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {35008#false} assume !(~x~0 % 4294967296 > 0); {35008#false} is VALID [2022-04-27 11:21:17,288 INFO L272 TraceCheckUtils]: 32: Hoare triple {35008#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35008#false} is VALID [2022-04-27 11:21:17,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {35008#false} ~cond := #in~cond; {35008#false} is VALID [2022-04-27 11:21:17,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {35008#false} assume 0 == ~cond; {35008#false} is VALID [2022-04-27 11:21:17,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {35008#false} assume !false; {35008#false} is VALID [2022-04-27 11:21:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:21:17,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:21:17,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602810406] [2022-04-27 11:21:17,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602810406] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:21:17,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84335065] [2022-04-27 11:21:17,289 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:21:17,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:21:17,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:21:17,291 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:21:17,291 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:21:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:17,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 11:21:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:21:17,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:21:17,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {35007#true} call ULTIMATE.init(); {35007#true} is VALID [2022-04-27 11:21:17,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {35007#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35007#true} is VALID [2022-04-27 11:21:17,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {35007#true} assume true; {35007#true} is VALID [2022-04-27 11:21:17,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35007#true} {35007#true} #72#return; {35007#true} is VALID [2022-04-27 11:21:17,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {35007#true} call #t~ret13 := main(); {35007#true} is VALID [2022-04-27 11:21:17,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {35007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35012#(= main_~y~0 0)} is VALID [2022-04-27 11:21:17,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {35012#(= 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; {35013#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:21:17,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {35013#(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; {35014#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:21:17,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {35014#(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; {35015#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:21:17,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {35015#(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; {35016#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:21:17,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {35016#(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; {35017#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:21:17,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {35017#(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; {35018#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:21:17,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {35018#(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; {35019#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:21:17,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {35019#(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; {35020#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:21:17,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {35020#(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; {35021#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:21:17,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {35021#(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; {35022#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:21:17,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {35022#(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; {35023#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:21:17,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {35023#(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; {35024#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:21:17,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {35024#(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; {35025#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:21:17,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {35025#(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; {35026#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:21:17,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {35026#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:21:17,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {35027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {35027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:21:17,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {35027#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {35028#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:21:17,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {35028#(and (<= main_~z~0 15) (<= 15 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; {35029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:21:17,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {35029#(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; {35107#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:21:17,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {35107#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {35008#false} is VALID [2022-04-27 11:21:17,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {35008#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; {35008#false} is VALID [2022-04-27 11:21:17,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {35008#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; {35008#false} is VALID [2022-04-27 11:21:17,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {35008#false} assume !(~y~0 % 4294967296 > 0); {35008#false} is VALID [2022-04-27 11:21:17,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {35008#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35008#false} is VALID [2022-04-27 11:21:17,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {35008#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35008#false} is VALID [2022-04-27 11:21:17,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {35008#false} assume !(~x~0 % 4294967296 > 0); {35008#false} is VALID [2022-04-27 11:21:17,668 INFO L272 TraceCheckUtils]: 32: Hoare triple {35008#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35008#false} is VALID [2022-04-27 11:21:17,668 INFO L290 TraceCheckUtils]: 33: Hoare triple {35008#false} ~cond := #in~cond; {35008#false} is VALID [2022-04-27 11:21:17,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {35008#false} assume 0 == ~cond; {35008#false} is VALID [2022-04-27 11:21:17,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {35008#false} assume !false; {35008#false} is VALID [2022-04-27 11:21:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:21:17,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:21:18,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {35008#false} assume !false; {35008#false} is VALID [2022-04-27 11:21:18,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {35008#false} assume 0 == ~cond; {35008#false} is VALID [2022-04-27 11:21:18,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {35008#false} ~cond := #in~cond; {35008#false} is VALID [2022-04-27 11:21:18,274 INFO L272 TraceCheckUtils]: 32: Hoare triple {35008#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35008#false} is VALID [2022-04-27 11:21:18,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {35008#false} assume !(~x~0 % 4294967296 > 0); {35008#false} is VALID [2022-04-27 11:21:18,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {35008#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35008#false} is VALID [2022-04-27 11:21:18,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {35008#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35008#false} is VALID [2022-04-27 11:21:18,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {35008#false} assume !(~y~0 % 4294967296 > 0); {35008#false} is VALID [2022-04-27 11:21:18,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {35008#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; {35008#false} is VALID [2022-04-27 11:21:18,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {35008#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; {35008#false} is VALID [2022-04-27 11:21:18,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {35171#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35008#false} is VALID [2022-04-27 11:21:18,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {35175#(< 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; {35171#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:21:18,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {35179#(< 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; {35175#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:18,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {35183#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {35179#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:18,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {35183#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35183#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:18,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {35190#(< 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; {35183#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:21:18,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {35194#(< 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; {35190#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:21:18,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {35198#(< 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; {35194#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:21:18,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {35202#(< 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; {35198#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:21:18,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {35206#(< 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; {35202#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:21:18,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {35210#(< 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; {35206#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:21:18,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {35214#(< 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; {35210#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:21:18,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {35218#(< 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; {35214#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:21:18,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {35222#(< 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; {35218#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:21:18,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {35226#(< 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; {35222#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:21:18,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {35230#(< 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; {35226#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:21:18,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {35234#(< 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; {35230#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:21:18,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {35238#(< 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; {35234#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:21:18,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {35242#(< 0 (mod (+ main_~y~0 12) 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; {35238#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:21:18,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {35246#(< 0 (mod (+ main_~y~0 13) 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; {35242#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:21:18,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {35007#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35246#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-27 11:21:18,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {35007#true} call #t~ret13 := main(); {35007#true} is VALID [2022-04-27 11:21:18,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35007#true} {35007#true} #72#return; {35007#true} is VALID [2022-04-27 11:21:18,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {35007#true} assume true; {35007#true} is VALID [2022-04-27 11:21:18,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {35007#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35007#true} is VALID [2022-04-27 11:21:18,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {35007#true} call ULTIMATE.init(); {35007#true} is VALID [2022-04-27 11:21:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:21:18,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84335065] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:21:18,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:21:18,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-27 11:21:18,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400081834] [2022-04-27 11:21:18,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:21:18,290 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 36 [2022-04-27 11:21:18,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:21:18,291 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:21:18,329 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:21:18,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-27 11:21:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:21:18,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-27 11:21:18,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 11:21:18,331 INFO L87 Difference]: Start difference. First operand 347 states and 497 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:21:41,708 WARN L232 SmtUtils]: Spent 8.01s 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:21:57,805 WARN L232 SmtUtils]: Spent 10.37s 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:22:25,704 WARN L232 SmtUtils]: Spent 18.31s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:22:58,768 WARN L232 SmtUtils]: Spent 13.04s 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:23:00,872 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (mod (+ 2 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~z~0) 4294967296)) (= |c_#NULL.base| |c_old(#NULL.base)|) (< 0 (mod (+ 4294967294 c_main_~z~0) 4294967296)) (< 0 (mod (+ 11 c_main_~y~0) 4294967296)) (< 0 (mod c_main_~y~0 4294967296)) (< 0 (mod (+ 4294967294 c_main_~y~0) 4294967296)) (< 0 (mod (+ 3 c_main_~y~0) 4294967296)) (< 0 (mod (+ c_main_~y~0 1) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~y~0) 4294967296)) (< 0 (mod (+ 8 c_main_~y~0) 4294967296)) (< 0 (mod c_main_~z~0 4294967296)) (< 0 (mod (+ 6 c_main_~y~0) 4294967296)) (< 0 (mod (+ 5 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4 c_main_~y~0) 4294967296)) (< 0 (mod (+ 9 c_main_~y~0) 4294967296)) (< 0 (mod (+ 10 c_main_~y~0) 4294967296)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< 0 (mod (+ 7 c_main_~y~0) 4294967296)) (< 0 (mod (+ 12 c_main_~y~0) 4294967296))) is different from false [2022-04-27 11:23:12,756 WARN L232 SmtUtils]: Spent 6.94s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:23:29,052 WARN L232 SmtUtils]: Spent 10.50s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:23:44,698 WARN L232 SmtUtils]: Spent 11.12s 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:24:02,401 WARN L232 SmtUtils]: Spent 5.50s 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) [2022-04-27 11:24:12,968 WARN L232 SmtUtils]: Spent 6.08s 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:24:44,875 WARN L232 SmtUtils]: Spent 19.89s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:25:05,758 WARN L232 SmtUtils]: Spent 7.07s 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)