/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-34549b5 [2022-04-07 11:54:36,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 11:54:36,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 11:54:36,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 11:54:36,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 11:54:36,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 11:54:36,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 11:54:36,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 11:54:36,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 11:54:36,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 11:54:36,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 11:54:36,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 11:54:36,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 11:54:36,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 11:54:36,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 11:54:36,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 11:54:36,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 11:54:36,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 11:54:36,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 11:54:36,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 11:54:36,825 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 11:54:36,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 11:54:36,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 11:54:36,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 11:54:36,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 11:54:36,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 11:54:36,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 11:54:36,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 11:54:36,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 11:54:36,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 11:54:36,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 11:54:36,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 11:54:36,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 11:54:36,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 11:54:36,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 11:54:36,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 11:54:36,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 11:54:36,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 11:54:36,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 11:54:36,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 11:54:36,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 11:54:36,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 11:54:36,840 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-07 11:54:36,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 11:54:36,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 11:54:36,863 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 11:54:36,864 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 11:54:36,864 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 11:54:36,864 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 11:54:36,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 11:54:36,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 11:54:36,865 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 11:54:36,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 11:54:36,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 11:54:36,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 11:54:36,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 11:54:36,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 11:54:36,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 11:54:36,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 11:54:36,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 11:54:36,866 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 11:54:36,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 11:54:36,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 11:54:36,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 11:54:36,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 11:54:36,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 11:54:36,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 11:54:36,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:54:36,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 11:54:36,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 11:54:36,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 11:54:36,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 11:54:36,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 11:54:36,869 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 11:54:36,869 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 11:54:36,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 11:54:36,869 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-07 11:54:37,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 11:54:37,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 11:54:37,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 11:54:37,072 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 11:54:37,072 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 11:54:37,073 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-07 11:54:37,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5e544bf2/3fcc76345d6a48dc9bb5494249791b4c/FLAG75ff0916d [2022-04-07 11:54:37,474 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 11:54:37,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-07 11:54:37,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5e544bf2/3fcc76345d6a48dc9bb5494249791b4c/FLAG75ff0916d [2022-04-07 11:54:37,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5e544bf2/3fcc76345d6a48dc9bb5494249791b4c [2022-04-07 11:54:37,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 11:54:37,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 11:54:37,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 11:54:37,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 11:54:37,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 11:54:37,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:54:37" (1/1) ... [2022-04-07 11:54:37,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d6712a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37, skipping insertion in model container [2022-04-07 11:54:37,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:54:37" (1/1) ... [2022-04-07 11:54:37,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 11:54:37,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 11:54:37,661 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-07 11:54:37,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:54:37,697 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 11:54:37,704 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-07 11:54:37,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:54:37,720 INFO L208 MainTranslator]: Completed translation [2022-04-07 11:54:37,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37 WrapperNode [2022-04-07 11:54:37,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 11:54:37,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 11:54:37,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 11:54:37,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 11:54:37,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37" (1/1) ... [2022-04-07 11:54:37,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37" (1/1) ... [2022-04-07 11:54:37,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37" (1/1) ... [2022-04-07 11:54:37,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37" (1/1) ... [2022-04-07 11:54:37,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37" (1/1) ... [2022-04-07 11:54:37,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37" (1/1) ... [2022-04-07 11:54:37,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37" (1/1) ... [2022-04-07 11:54:37,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 11:54:37,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 11:54:37,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 11:54:37,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 11:54:37,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37" (1/1) ... [2022-04-07 11:54:37,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:54:37,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:54:37,778 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-07 11:54:37,786 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-07 11:54:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 11:54:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 11:54:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 11:54:37,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 11:54:37,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 11:54:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 11:54:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 11:54:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 11:54:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 11:54:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 11:54:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 11:54:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 11:54:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 11:54:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 11:54:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 11:54:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 11:54:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 11:54:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 11:54:37,859 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 11:54:37,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 11:54:38,029 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 11:54:38,033 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 11:54:38,033 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-07 11:54:38,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:54:38 BoogieIcfgContainer [2022-04-07 11:54:38,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 11:54:38,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 11:54:38,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 11:54:38,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 11:54:38,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:54:37" (1/3) ... [2022-04-07 11:54:38,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6782677f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:54:38, skipping insertion in model container [2022-04-07 11:54:38,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:54:37" (2/3) ... [2022-04-07 11:54:38,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6782677f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:54:38, skipping insertion in model container [2022-04-07 11:54:38,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:54:38" (3/3) ... [2022-04-07 11:54:38,040 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de41.c [2022-04-07 11:54:38,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 11:54:38,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 11:54:38,070 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 11:54:38,074 INFO L340 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 [2022-04-07 11:54:38,074 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 11:54:38,090 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-07 11:54:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 11:54:38,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:38,094 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:38,095 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:38,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-07 11:54:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:38,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687263679] [2022-04-07 11:54:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:38,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:38,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:38,292 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-07 11:54:38,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-07 11:54:38,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-07 11:54:38,295 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-07 11:54:38,295 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-07 11:54:38,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-07 11:54:38,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-07 11:54:38,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-07 11:54:38,296 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-07 11:54:38,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-07 11:54:38,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-07 11:54:38,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-07 11:54:38,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-07 11:54:38,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-07 11:54:38,298 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-07 11:54:38,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-07 11:54:38,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-07 11:54:38,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-07 11:54:38,299 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-07 11:54:38,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:38,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687263679] [2022-04-07 11:54:38,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687263679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:54:38,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:54:38,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 11:54:38,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177000721] [2022-04-07 11:54:38,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:54:38,305 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-07 11:54:38,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:38,309 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-07 11:54:38,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:54:38,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 11:54:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:38,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 11:54:38,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 11:54:38,351 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-07 11:54:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:38,431 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-07 11:54:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 11:54:38,432 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-07 11:54:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:38,433 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-07 11:54:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-07 11:54:38,437 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-07 11:54:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-07 11:54:38,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-07 11:54:38,497 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-07 11:54:38,502 INFO L225 Difference]: With dead ends: 39 [2022-04-07 11:54:38,502 INFO L226 Difference]: Without dead ends: 16 [2022-04-07 11:54:38,504 INFO L912 BasicCegarLoop]: 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-07 11:54:38,506 INFO L913 BasicCegarLoop]: 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-07 11:54:38,506 INFO L914 BasicCegarLoop]: 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-07 11:54:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-07 11:54:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-07 11:54:38,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:38,553 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-07 11:54:38,554 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-07 11:54:38,554 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-07 11:54:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:38,556 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-07 11:54:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-07 11:54:38,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:38,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:38,557 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-07 11:54:38,557 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-07 11:54:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:38,559 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-07 11:54:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-07 11:54:38,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:38,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:38,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:38,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:38,560 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-07 11:54:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-07 11:54:38,562 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-07 11:54:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:38,563 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-07 11:54:38,563 INFO L479 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-07 11:54:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-07 11:54:38,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 11:54:38,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:38,564 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:38,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 11:54:38,564 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:38,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-07 11:54:38,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:38,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452386552] [2022-04-07 11:54:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:38,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:38,884 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-07 11:54:38,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume true; {140#true} is VALID [2022-04-07 11:54:38,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {140#true} {140#true} #72#return; {140#true} is VALID [2022-04-07 11:54:38,885 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-07 11:54:38,886 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-07 11:54:38,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume true; {140#true} is VALID [2022-04-07 11:54:38,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140#true} {140#true} #72#return; {140#true} is VALID [2022-04-07 11:54:38,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {140#true} call #t~ret13 := main(); {140#true} is VALID [2022-04-07 11:54:38,887 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-07 11:54:38,888 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-07 11:54:38,888 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-07 11:54:38,889 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-07 11:54:38,889 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-07 11:54:38,890 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-07 11:54:38,891 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-07 11:54:38,891 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-07 11:54:38,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {141#false} is VALID [2022-04-07 11:54:38,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-04-07 11:54:38,892 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-07 11:54:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:38,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452386552] [2022-04-07 11:54:38,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452386552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:54:38,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:54:38,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 11:54:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986841123] [2022-04-07 11:54:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:54:38,894 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-07 11:54:38,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:38,895 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-07 11:54:38,905 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-07 11:54:38,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 11:54:38,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:38,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 11:54:38,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-07 11:54:38,907 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-07 11:54:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:39,172 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-07 11:54:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 11:54:39,173 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-07 11:54:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:39,173 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-07 11:54:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-07 11:54:39,179 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-07 11:54:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-07 11:54:39,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-07 11:54:39,225 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-07 11:54:39,226 INFO L225 Difference]: With dead ends: 35 [2022-04-07 11:54:39,226 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 11:54:39,227 INFO L912 BasicCegarLoop]: 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-07 11:54:39,227 INFO L913 BasicCegarLoop]: 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-07 11:54:39,228 INFO L914 BasicCegarLoop]: 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-07 11:54:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 11:54:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-07 11:54:39,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:39,233 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-07 11:54:39,233 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-07 11:54:39,233 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-07 11:54:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:39,234 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-07 11:54:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-07 11:54:39,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:39,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:39,235 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-07 11:54:39,235 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-07 11:54:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:39,236 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-07 11:54:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-07 11:54:39,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:39,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:39,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:39,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:39,237 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-07 11:54:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-07 11:54:39,238 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-07 11:54:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:39,239 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-07 11:54:39,239 INFO L479 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-07 11:54:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-07 11:54:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 11:54:39,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:39,239 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:39,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 11:54:39,240 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:39,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:39,240 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-07 11:54:39,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:39,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124402840] [2022-04-07 11:54:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:39,311 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-07 11:54:39,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-07 11:54:39,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291#true} {291#true} #72#return; {291#true} is VALID [2022-04-07 11:54:39,312 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-07 11:54:39,312 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-07 11:54:39,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-07 11:54:39,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #72#return; {291#true} is VALID [2022-04-07 11:54:39,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret13 := main(); {291#true} is VALID [2022-04-07 11:54:39,313 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-07 11:54:39,313 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-07 11:54:39,314 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-07 11:54:39,314 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-07 11:54:39,315 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-07 11:54:39,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {292#false} assume !(~y~0 % 4294967296 > 0); {292#false} is VALID [2022-04-07 11:54:39,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(~x~0 % 4294967296 > 0); {292#false} is VALID [2022-04-07 11:54:39,315 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-07 11:54:39,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2022-04-07 11:54:39,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2022-04-07 11:54:39,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-07 11:54:39,316 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-07 11:54:39,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:39,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124402840] [2022-04-07 11:54:39,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124402840] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:54:39,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819772775] [2022-04-07 11:54:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:39,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:54:39,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:54:39,328 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-07 11:54:39,331 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-07 11:54:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:39,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 11:54:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:39,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:54:39,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2022-04-07 11:54:39,603 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-07 11:54:39,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-07 11:54:39,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #72#return; {291#true} is VALID [2022-04-07 11:54:39,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret13 := main(); {291#true} is VALID [2022-04-07 11:54:39,604 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-07 11:54:39,605 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-07 11:54:39,605 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-07 11:54:39,606 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-07 11:54:39,606 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-07 11:54:39,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {292#false} assume !(~y~0 % 4294967296 > 0); {292#false} is VALID [2022-04-07 11:54:39,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(~x~0 % 4294967296 > 0); {292#false} is VALID [2022-04-07 11:54:39,608 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-07 11:54:39,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2022-04-07 11:54:39,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2022-04-07 11:54:39,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-07 11:54:39,608 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-07 11:54:39,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:54:39,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-04-07 11:54:39,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#false} assume 0 == ~cond; {292#false} is VALID [2022-04-07 11:54:39,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#false} ~cond := #in~cond; {292#false} is VALID [2022-04-07 11:54:39,702 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-07 11:54:39,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#false} assume !(~x~0 % 4294967296 > 0); {292#false} is VALID [2022-04-07 11:54:39,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {292#false} assume !(~y~0 % 4294967296 > 0); {292#false} is VALID [2022-04-07 11:54:39,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {292#false} is VALID [2022-04-07 11:54:39,704 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-07 11:54:39,704 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-07 11:54:39,705 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-07 11:54:39,705 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-07 11:54:39,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret13 := main(); {291#true} is VALID [2022-04-07 11:54:39,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #72#return; {291#true} is VALID [2022-04-07 11:54:39,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2022-04-07 11:54:39,706 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-07 11:54:39,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2022-04-07 11:54:39,706 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-07 11:54:39,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819772775] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:54:39,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:54:39,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-07 11:54:39,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432684191] [2022-04-07 11:54:39,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:54:39,708 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-07 11:54:39,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:39,709 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-07 11:54:39,725 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-07 11:54:39,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 11:54:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:39,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 11:54:39,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 11:54:39,730 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-07 11:54:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:40,142 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2022-04-07 11:54:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 11:54:40,142 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-07 11:54:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:40,143 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-07 11:54:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-07 11:54:40,145 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-07 11:54:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-04-07 11:54:40,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2022-04-07 11:54:40,212 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-07 11:54:40,213 INFO L225 Difference]: With dead ends: 56 [2022-04-07 11:54:40,213 INFO L226 Difference]: Without dead ends: 49 [2022-04-07 11:54:40,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-04-07 11:54:40,215 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 68 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:54:40,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 45 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:54:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-07 11:54:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2022-04-07 11:54:40,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:40,233 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-07 11:54:40,234 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-07 11:54:40,235 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-07 11:54:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:40,237 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-07 11:54:40,237 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2022-04-07 11:54:40,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:40,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:40,237 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-07 11:54:40,238 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-07 11:54:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:40,239 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-07 11:54:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2022-04-07 11:54:40,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:40,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:40,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:40,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:40,240 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-07 11:54:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-04-07 11:54:40,241 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 16 [2022-04-07 11:54:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:40,241 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-04-07 11:54:40,242 INFO L479 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-07 11:54:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-07 11:54:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 11:54:40,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:40,242 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:40,279 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-07 11:54:40,443 WARN L460 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-07 11:54:40,443 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:40,444 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 1 times [2022-04-07 11:54:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:40,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301556249] [2022-04-07 11:54:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:40,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:40,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:40,497 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-07 11:54:40,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {648#true} assume true; {648#true} is VALID [2022-04-07 11:54:40,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {648#true} {648#true} #72#return; {648#true} is VALID [2022-04-07 11:54:40,497 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-07 11:54:40,498 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-07 11:54:40,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {648#true} assume true; {648#true} is VALID [2022-04-07 11:54:40,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {648#true} {648#true} #72#return; {648#true} is VALID [2022-04-07 11:54:40,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {648#true} call #t~ret13 := main(); {648#true} is VALID [2022-04-07 11:54:40,498 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-07 11:54:40,499 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-07 11:54:40,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#(= main_~y~0 0)} ~z~0 := ~y~0; {654#(= main_~z~0 0)} is VALID [2022-04-07 11:54:40,500 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-07 11:54:40,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#false} assume !(~z~0 % 4294967296 > 0); {649#false} is VALID [2022-04-07 11:54:40,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {649#false} assume !(~y~0 % 4294967296 > 0); {649#false} is VALID [2022-04-07 11:54:40,500 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-07 11:54:40,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {649#false} assume !(~x~0 % 4294967296 > 0); {649#false} is VALID [2022-04-07 11:54:40,500 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-07 11:54:40,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {649#false} ~cond := #in~cond; {649#false} is VALID [2022-04-07 11:54:40,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {649#false} assume 0 == ~cond; {649#false} is VALID [2022-04-07 11:54:40,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {649#false} assume !false; {649#false} is VALID [2022-04-07 11:54:40,501 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-07 11:54:40,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:40,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301556249] [2022-04-07 11:54:40,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301556249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:54:40,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:54:40,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 11:54:40,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544889608] [2022-04-07 11:54:40,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:54:40,502 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-07 11:54:40,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:40,502 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-07 11:54:40,511 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-07 11:54:40,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 11:54:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:40,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 11:54:40,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 11:54:40,512 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-07 11:54:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:40,586 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-07 11:54:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 11:54:40,586 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-07 11:54:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:40,587 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-07 11:54:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-07 11:54:40,588 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-07 11:54:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-07 11:54:40,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-07 11:54:40,611 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-07 11:54:40,612 INFO L225 Difference]: With dead ends: 40 [2022-04-07 11:54:40,612 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 11:54:40,613 INFO L912 BasicCegarLoop]: 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-07 11:54:40,613 INFO L913 BasicCegarLoop]: 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-07 11:54:40,614 INFO L914 BasicCegarLoop]: 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-07 11:54:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 11:54:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-07 11:54:40,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:40,626 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-07 11:54:40,626 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-07 11:54:40,626 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-07 11:54:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:40,628 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-07 11:54:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-07 11:54:40,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:40,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:40,628 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-07 11:54:40,628 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-07 11:54:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:40,629 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-07 11:54:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-07 11:54:40,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:40,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:40,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:40,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:40,630 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-07 11:54:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-07 11:54:40,631 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2022-04-07 11:54:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:40,631 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-07 11:54:40,631 INFO L479 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-07 11:54:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-07 11:54:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 11:54:40,631 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:40,632 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:40,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 11:54:40,632 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-07 11:54:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:40,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060189120] [2022-04-07 11:54:40,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:40,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:40,720 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-07 11:54:40,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-07 11:54:40,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {825#true} {825#true} #72#return; {825#true} is VALID [2022-04-07 11:54:40,721 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-07 11:54:40,721 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-07 11:54:40,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-07 11:54:40,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #72#return; {825#true} is VALID [2022-04-07 11:54:40,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret13 := main(); {825#true} is VALID [2022-04-07 11:54:40,723 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-07 11:54:40,724 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-07 11:54:40,725 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-07 11:54:40,725 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-07 11:54:40,732 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-07 11:54:40,733 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-07 11:54:40,736 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-07 11:54:40,736 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-07 11:54:40,737 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-07 11:54:40,737 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-07 11:54:40,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-07 11:54:40,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-07 11:54:40,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-07 11:54:40,738 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-07 11:54:40,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:40,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060189120] [2022-04-07 11:54:40,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060189120] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:54:40,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231143360] [2022-04-07 11:54:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:40,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:54:40,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:54:40,741 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-07 11:54:40,742 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-07 11:54:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:40,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 11:54:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:40,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:54:41,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2022-04-07 11:54:41,013 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-07 11:54:41,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-07 11:54:41,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #72#return; {825#true} is VALID [2022-04-07 11:54:41,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret13 := main(); {825#true} is VALID [2022-04-07 11:54:41,014 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-07 11:54:41,015 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-07 11:54:41,015 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-07 11:54:41,016 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-07 11:54:41,017 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-07 11:54:41,022 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-07 11:54:41,023 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-07 11:54:41,023 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-07 11:54:41,023 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-07 11:54:41,023 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-07 11:54:41,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-07 11:54:41,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-07 11:54:41,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-07 11:54:41,024 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-07 11:54:41,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:54:41,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-07 11:54:41,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-07 11:54:41,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-07 11:54:41,095 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-07 11:54:41,096 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-07 11:54:41,096 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-07 11:54:41,096 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-07 11:54:41,097 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-07 11:54:41,098 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-07 11:54:41,098 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-07 11:54:41,098 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-07 11:54:41,099 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-07 11:54:41,099 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-07 11:54:41,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret13 := main(); {825#true} is VALID [2022-04-07 11:54:41,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #72#return; {825#true} is VALID [2022-04-07 11:54:41,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-07 11:54:41,100 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-07 11:54:41,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2022-04-07 11:54:41,100 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-07 11:54:41,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231143360] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:54:41,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:54:41,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-07 11:54:41,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753950487] [2022-04-07 11:54:41,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:54:41,101 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-07 11:54:41,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:41,101 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-07 11:54:41,112 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-07 11:54:41,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 11:54:41,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:41,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 11:54:41,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 11:54:41,113 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-07 11:54:41,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:41,232 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-07 11:54:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 11:54:41,232 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-07 11:54:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:41,232 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-07 11:54:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-07 11:54:41,233 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-07 11:54:41,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-07 11:54:41,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-07 11:54:41,273 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-07 11:54:41,274 INFO L225 Difference]: With dead ends: 45 [2022-04-07 11:54:41,274 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 11:54:41,274 INFO L912 BasicCegarLoop]: 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-07 11:54:41,275 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:54:41,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 11:54:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 11:54:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-04-07 11:54:41,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:41,296 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-07 11:54:41,296 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-07 11:54:41,296 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-07 11:54:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:41,297 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-07 11:54:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-04-07 11:54:41,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:41,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:41,298 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-07 11:54:41,298 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-07 11:54:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:41,299 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-07 11:54:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2022-04-07 11:54:41,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:41,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:41,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:41,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:41,300 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-07 11:54:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2022-04-07 11:54:41,301 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 18 [2022-04-07 11:54:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:41,301 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-04-07 11:54:41,301 INFO L479 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-07 11:54:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-04-07 11:54:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 11:54:41,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:41,302 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:41,331 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-07 11:54:41,502 WARN L460 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-07 11:54:41,502 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:41,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-07 11:54:41,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:41,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142133885] [2022-04-07 11:54:41,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:41,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:41,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:41,698 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-07 11:54:41,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-07 11:54:41,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1149#true} {1149#true} #72#return; {1149#true} is VALID [2022-04-07 11:54:41,698 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-07 11:54:41,699 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-07 11:54:41,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-07 11:54:41,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1149#true} {1149#true} #72#return; {1149#true} is VALID [2022-04-07 11:54:41,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {1149#true} call #t~ret13 := main(); {1149#true} is VALID [2022-04-07 11:54:41,699 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-07 11:54:41,701 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-07 11:54:41,702 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-07 11:54:41,702 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-07 11:54:41,703 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-07 11:54:41,703 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-07 11:54:41,706 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-07 11:54:41,707 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-07 11:54:41,709 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-07 11:54:41,709 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-07 11:54:41,710 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-07 11:54:41,711 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-07 11:54:41,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {1160#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1150#false} is VALID [2022-04-07 11:54:41,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-07 11:54:41,711 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-07 11:54:41,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:41,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142133885] [2022-04-07 11:54:41,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142133885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:54:41,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850031760] [2022-04-07 11:54:41,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:41,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:54:41,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:54:41,712 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-07 11:54:41,713 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-07 11:54:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:41,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-07 11:54:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:41,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:54:42,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-07 11:54:42,136 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-07 11:54:42,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-07 11:54:42,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1149#true} {1149#true} #72#return; {1149#true} is VALID [2022-04-07 11:54:42,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {1149#true} call #t~ret13 := main(); {1149#true} is VALID [2022-04-07 11:54:42,137 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-07 11:54:42,137 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-07 11:54:42,138 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-07 11:54:42,138 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-07 11:54:42,139 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-07 11:54:42,140 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-07 11:54:42,141 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-07 11:54:42,141 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-07 11:54:42,141 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-07 11:54:42,142 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-07 11:54:42,146 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-07 11:54:42,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {1215#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1219#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:54:42,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {1219#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1150#false} is VALID [2022-04-07 11:54:42,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-07 11:54:42,147 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-07 11:54:42,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:54:42,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {1150#false} assume !false; {1150#false} is VALID [2022-04-07 11:54:42,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {1219#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1150#false} is VALID [2022-04-07 11:54:42,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {1215#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1219#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:54:42,538 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-07 11:54:42,538 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-07 11:54:42,539 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-07 11:54:42,540 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-07 11:54:42,541 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-07 11:54:42,541 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-07 11:54:42,542 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-07 11:54:42,542 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-07 11:54:42,543 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-07 11:54:42,546 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-07 11:54:42,547 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-07 11:54:42,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {1149#true} call #t~ret13 := main(); {1149#true} is VALID [2022-04-07 11:54:42,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1149#true} {1149#true} #72#return; {1149#true} is VALID [2022-04-07 11:54:42,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#true} assume true; {1149#true} is VALID [2022-04-07 11:54:42,547 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-07 11:54:42,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} call ULTIMATE.init(); {1149#true} is VALID [2022-04-07 11:54:42,548 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-07 11:54:42,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850031760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:54:42,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:54:42,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-04-07 11:54:42,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373906534] [2022-04-07 11:54:42,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:54:42,549 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-07 11:54:42,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:42,549 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-07 11:54:42,589 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-07 11:54:42,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 11:54:42,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:42,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 11:54:42,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-04-07 11:54:42,590 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-07 11:54:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:46,209 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2022-04-07 11:54:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-07 11:54:46,210 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-07 11:54:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:46,210 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-07 11:54:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 75 transitions. [2022-04-07 11:54:46,212 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-07 11:54:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 75 transitions. [2022-04-07 11:54:46,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 75 transitions. [2022-04-07 11:54:46,315 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-07 11:54:46,316 INFO L225 Difference]: With dead ends: 70 [2022-04-07 11:54:46,316 INFO L226 Difference]: Without dead ends: 64 [2022-04-07 11:54:46,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=370, Invalid=1610, Unknown=0, NotChecked=0, Total=1980 [2022-04-07 11:54:46,317 INFO L913 BasicCegarLoop]: 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-07 11:54:46,318 INFO L914 BasicCegarLoop]: 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-07 11:54:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-07 11:54:46,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2022-04-07 11:54:46,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:46,364 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-07 11:54:46,364 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-07 11:54:46,364 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-07 11:54:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:46,366 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2022-04-07 11:54:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2022-04-07 11:54:46,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:46,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:46,367 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-07 11:54:46,367 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-07 11:54:46,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:46,368 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2022-04-07 11:54:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2022-04-07 11:54:46,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:46,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:46,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:46,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:46,369 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-07 11:54:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-04-07 11:54:46,370 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 19 [2022-04-07 11:54:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:46,370 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-04-07 11:54:46,370 INFO L479 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-07 11:54:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2022-04-07 11:54:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 11:54:46,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:46,371 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:46,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 11:54:46,588 WARN L460 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-07 11:54:46,588 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:46,589 INFO L85 PathProgramCache]: Analyzing trace with hash -343761690, now seen corresponding path program 2 times [2022-04-07 11:54:46,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:46,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444646844] [2022-04-07 11:54:46,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:46,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:46,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:46,653 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-07 11:54:46,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-07 11:54:46,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1623#true} {1623#true} #72#return; {1623#true} is VALID [2022-04-07 11:54:46,654 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-07 11:54:46,654 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-07 11:54:46,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-07 11:54:46,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} #72#return; {1623#true} is VALID [2022-04-07 11:54:46,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} call #t~ret13 := main(); {1623#true} is VALID [2022-04-07 11:54:46,656 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-07 11:54:46,656 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-07 11:54:46,657 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-07 11:54:46,657 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-07 11:54:46,658 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-07 11:54:46,658 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-07 11:54:46,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {1624#false} assume !(~z~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-07 11:54:46,658 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-07 11:54:46,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {1624#false} assume !(~y~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-07 11:54:46,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {1624#false} assume !(~x~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-07 11:54:46,662 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-07 11:54:46,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {1624#false} ~cond := #in~cond; {1624#false} is VALID [2022-04-07 11:54:46,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {1624#false} assume 0 == ~cond; {1624#false} is VALID [2022-04-07 11:54:46,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {1624#false} assume !false; {1624#false} is VALID [2022-04-07 11:54:46,663 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-07 11:54:46,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:46,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444646844] [2022-04-07 11:54:46,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444646844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:54:46,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474811812] [2022-04-07 11:54:46,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:54:46,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:54:46,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:54:46,665 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-07 11:54:46,666 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-07 11:54:46,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:54:46,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:54:46,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 11:54:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:46,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:54:46,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {1623#true} call ULTIMATE.init(); {1623#true} is VALID [2022-04-07 11:54:46,791 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-07 11:54:46,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-07 11:54:46,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} #72#return; {1623#true} is VALID [2022-04-07 11:54:46,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} call #t~ret13 := main(); {1623#true} is VALID [2022-04-07 11:54:46,791 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-07 11:54:46,792 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-07 11:54:46,792 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-07 11:54:46,793 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-07 11:54:46,793 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-07 11:54:46,794 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-07 11:54:46,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {1624#false} assume !(~z~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-07 11:54:46,794 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-07 11:54:46,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {1624#false} assume !(~y~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-07 11:54:46,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {1624#false} assume !(~x~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-07 11:54:46,794 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-07 11:54:46,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {1624#false} ~cond := #in~cond; {1624#false} is VALID [2022-04-07 11:54:46,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {1624#false} assume 0 == ~cond; {1624#false} is VALID [2022-04-07 11:54:46,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {1624#false} assume !false; {1624#false} is VALID [2022-04-07 11:54:46,794 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-07 11:54:46,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:54:46,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {1624#false} assume !false; {1624#false} is VALID [2022-04-07 11:54:46,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {1624#false} assume 0 == ~cond; {1624#false} is VALID [2022-04-07 11:54:46,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {1624#false} ~cond := #in~cond; {1624#false} is VALID [2022-04-07 11:54:46,892 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-07 11:54:46,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {1624#false} assume !(~x~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-07 11:54:46,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {1707#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1624#false} is VALID [2022-04-07 11:54:46,894 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-07 11:54:46,894 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-07 11:54:46,894 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-07 11:54:46,895 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-07 11:54:46,896 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-07 11:54:46,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {1623#true} assume !(~x~0 % 4294967296 > 0); {1623#true} is VALID [2022-04-07 11:54:46,896 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-07 11:54:46,896 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-07 11:54:46,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} call #t~ret13 := main(); {1623#true} is VALID [2022-04-07 11:54:46,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} #72#return; {1623#true} is VALID [2022-04-07 11:54:46,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-07 11:54:46,896 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-07 11:54:46,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {1623#true} call ULTIMATE.init(); {1623#true} is VALID [2022-04-07 11:54:46,896 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-07 11:54:46,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474811812] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:54:46,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:54:46,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-07 11:54:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042978980] [2022-04-07 11:54:46,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:54:46,897 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-07 11:54:46,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:46,897 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-07 11:54:46,919 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-07 11:54:46,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 11:54:46,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:46,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 11:54:46,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-07 11:54:46,919 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-07 11:54:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:47,461 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2022-04-07 11:54:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-07 11:54:47,461 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-07 11:54:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:47,461 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-07 11:54:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-07 11:54:47,463 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-07 11:54:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-07 11:54:47,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-04-07 11:54:47,531 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-07 11:54:47,532 INFO L225 Difference]: With dead ends: 68 [2022-04-07 11:54:47,532 INFO L226 Difference]: Without dead ends: 56 [2022-04-07 11:54:47,533 INFO L912 BasicCegarLoop]: 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-07 11:54:47,533 INFO L913 BasicCegarLoop]: 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-07 11:54:47,533 INFO L914 BasicCegarLoop]: 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-07 11:54:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-07 11:54:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 39. [2022-04-07 11:54:47,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:47,586 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-07 11:54:47,587 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-07 11:54:47,587 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-07 11:54:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:47,588 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2022-04-07 11:54:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-04-07 11:54:47,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:47,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:47,588 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-07 11:54:47,589 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-07 11:54:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:47,590 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2022-04-07 11:54:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-04-07 11:54:47,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:47,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:47,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:47,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:47,590 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-07 11:54:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-07 11:54:47,591 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 19 [2022-04-07 11:54:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:47,591 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-04-07 11:54:47,591 INFO L479 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-07 11:54:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-04-07 11:54:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 11:54:47,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:47,592 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:47,607 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-07 11:54:47,799 WARN L460 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-07 11:54:47,799 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 146579608, now seen corresponding path program 2 times [2022-04-07 11:54:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:47,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728053832] [2022-04-07 11:54:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:47,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:47,909 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-07 11:54:47,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-07 11:54:47,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2047#true} {2047#true} #72#return; {2047#true} is VALID [2022-04-07 11:54:47,910 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-07 11:54:47,910 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-07 11:54:47,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-07 11:54:47,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #72#return; {2047#true} is VALID [2022-04-07 11:54:47,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret13 := main(); {2047#true} is VALID [2022-04-07 11:54:47,910 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-07 11:54:47,911 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-07 11:54:47,911 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-07 11:54:47,912 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-07 11:54:47,912 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-07 11:54:47,913 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-07 11:54:47,913 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-07 11:54:47,914 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-07 11:54:47,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#false} assume !(~y~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-07 11:54:47,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#false} assume !(~x~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-07 11:54:47,914 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-07 11:54:47,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {2048#false} ~cond := #in~cond; {2048#false} is VALID [2022-04-07 11:54:47,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {2048#false} assume 0 == ~cond; {2048#false} is VALID [2022-04-07 11:54:47,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2022-04-07 11:54:47,914 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-07 11:54:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:47,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728053832] [2022-04-07 11:54:47,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728053832] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:54:47,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974772729] [2022-04-07 11:54:47,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:54:47,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:54:47,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:54:47,916 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-07 11:54:47,917 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-07 11:54:47,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:54:47,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:54:47,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 11:54:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:47,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:54:48,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2047#true} is VALID [2022-04-07 11:54:48,125 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-07 11:54:48,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-07 11:54:48,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #72#return; {2047#true} is VALID [2022-04-07 11:54:48,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret13 := main(); {2047#true} is VALID [2022-04-07 11:54:48,126 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-07 11:54:48,127 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-07 11:54:48,127 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-07 11:54:48,128 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-07 11:54:48,128 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-07 11:54:48,129 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-07 11:54:48,129 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-07 11:54:48,130 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-07 11:54:48,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#false} assume !(~y~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-07 11:54:48,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#false} assume !(~x~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-07 11:54:48,130 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-07 11:54:48,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {2048#false} ~cond := #in~cond; {2048#false} is VALID [2022-04-07 11:54:48,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {2048#false} assume 0 == ~cond; {2048#false} is VALID [2022-04-07 11:54:48,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2022-04-07 11:54:48,130 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-07 11:54:48,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:54:48,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {2048#false} assume !false; {2048#false} is VALID [2022-04-07 11:54:48,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {2048#false} assume 0 == ~cond; {2048#false} is VALID [2022-04-07 11:54:48,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {2048#false} ~cond := #in~cond; {2048#false} is VALID [2022-04-07 11:54:48,257 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-07 11:54:48,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#false} assume !(~x~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-07 11:54:48,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#false} assume !(~y~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-07 11:54:48,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {2135#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2048#false} is VALID [2022-04-07 11:54:48,258 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-07 11:54:48,259 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-07 11:54:48,261 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-07 11:54:48,262 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-07 11:54:48,263 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-07 11:54:48,263 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-07 11:54:48,264 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-07 11:54:48,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {2047#true} call #t~ret13 := main(); {2047#true} is VALID [2022-04-07 11:54:48,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2047#true} {2047#true} #72#return; {2047#true} is VALID [2022-04-07 11:54:48,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {2047#true} assume true; {2047#true} is VALID [2022-04-07 11:54:48,264 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-07 11:54:48,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {2047#true} call ULTIMATE.init(); {2047#true} is VALID [2022-04-07 11:54:48,264 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-07 11:54:48,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974772729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:54:48,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:54:48,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-07 11:54:48,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856039187] [2022-04-07 11:54:48,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:54:48,265 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-07 11:54:48,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:48,265 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-07 11:54:48,283 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-07 11:54:48,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 11:54:48,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 11:54:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-07 11:54:48,283 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-07 11:54:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:49,941 INFO L93 Difference]: Finished difference Result 139 states and 213 transitions. [2022-04-07 11:54:49,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-07 11:54:49,942 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-07 11:54:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:49,942 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-07 11:54:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 149 transitions. [2022-04-07 11:54:49,944 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-07 11:54:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 149 transitions. [2022-04-07 11:54:49,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 149 transitions. [2022-04-07 11:54:50,107 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-07 11:54:50,109 INFO L225 Difference]: With dead ends: 139 [2022-04-07 11:54:50,109 INFO L226 Difference]: Without dead ends: 128 [2022-04-07 11:54:50,109 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2022-04-07 11:54:50,110 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 219 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 11:54:50,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 64 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 11:54:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-07 11:54:50,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 65. [2022-04-07 11:54:50,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:50,229 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-07 11:54:50,230 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-07 11:54:50,230 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-07 11:54:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:50,233 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2022-04-07 11:54:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2022-04-07 11:54:50,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:50,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:50,234 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-07 11:54:50,234 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-07 11:54:50,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:50,237 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2022-04-07 11:54:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2022-04-07 11:54:50,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:50,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:50,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:50,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:50,237 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-07 11:54:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2022-04-07 11:54:50,238 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 19 [2022-04-07 11:54:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:50,239 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2022-04-07 11:54:50,239 INFO L479 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-07 11:54:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2022-04-07 11:54:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 11:54:50,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:50,239 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:50,257 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-07 11:54:50,447 WARN L460 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-07 11:54:50,447 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 2 times [2022-04-07 11:54:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:50,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776269166] [2022-04-07 11:54:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:50,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:50,492 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-07 11:54:50,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 11:54:50,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2780#true} {2780#true} #72#return; {2780#true} is VALID [2022-04-07 11:54:50,493 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-07 11:54:50,493 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-07 11:54:50,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 11:54:50,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #72#return; {2780#true} is VALID [2022-04-07 11:54:50,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret13 := main(); {2780#true} is VALID [2022-04-07 11:54:50,494 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-07 11:54:50,494 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-07 11:54:50,494 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-07 11:54:50,494 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-07 11:54:50,495 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-07 11:54:50,495 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-07 11:54:50,496 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-07 11:54:50,496 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-07 11:54:50,496 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-07 11:54:50,497 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-07 11:54:50,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {2781#false} assume !(~x~0 % 4294967296 > 0); {2781#false} is VALID [2022-04-07 11:54:50,497 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-07 11:54:50,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {2781#false} ~cond := #in~cond; {2781#false} is VALID [2022-04-07 11:54:50,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {2781#false} assume 0 == ~cond; {2781#false} is VALID [2022-04-07 11:54:50,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-07 11:54:50,497 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-07 11:54:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:50,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776269166] [2022-04-07 11:54:50,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776269166] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:54:50,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950884659] [2022-04-07 11:54:50,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:54:50,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:54:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:54:50,499 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-07 11:54:50,500 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-07 11:54:50,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:54:50,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:54:50,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-07 11:54:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:50,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:54:50,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-07 11:54:50,705 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-07 11:54:50,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 11:54:50,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #72#return; {2780#true} is VALID [2022-04-07 11:54:50,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret13 := main(); {2780#true} is VALID [2022-04-07 11:54:50,705 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-07 11:54:50,706 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-07 11:54:50,709 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-07 11:54:50,709 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-07 11:54:50,710 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-07 11:54:50,710 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-07 11:54:50,710 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-07 11:54:50,710 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-07 11:54:50,711 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-07 11:54:50,712 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-07 11:54:50,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {2781#false} assume !(~x~0 % 4294967296 > 0); {2781#false} is VALID [2022-04-07 11:54:50,712 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-07 11:54:50,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {2781#false} ~cond := #in~cond; {2781#false} is VALID [2022-04-07 11:54:50,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {2781#false} assume 0 == ~cond; {2781#false} is VALID [2022-04-07 11:54:50,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-07 11:54:50,712 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-07 11:54:50,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:54:50,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-07 11:54:50,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {2781#false} assume 0 == ~cond; {2781#false} is VALID [2022-04-07 11:54:50,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {2781#false} ~cond := #in~cond; {2781#false} is VALID [2022-04-07 11:54:50,881 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-07 11:54:50,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {2781#false} assume !(~x~0 % 4294967296 > 0); {2781#false} is VALID [2022-04-07 11:54:50,882 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-07 11:54:50,883 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-07 11:54:50,883 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-07 11:54:50,883 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-07 11:54:50,884 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-07 11:54:50,884 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-07 11:54:50,884 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-07 11:54:50,885 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-07 11:54:50,885 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-07 11:54:50,885 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-07 11:54:50,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret13 := main(); {2780#true} is VALID [2022-04-07 11:54:50,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #72#return; {2780#true} is VALID [2022-04-07 11:54:50,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-07 11:54:50,885 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-07 11:54:50,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-07 11:54:50,886 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-07 11:54:50,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950884659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:54:50,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:54:50,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-07 11:54:50,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513803518] [2022-04-07 11:54:50,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:54:50,886 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-07 11:54:50,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:50,887 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-07 11:54:50,906 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-07 11:54:50,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 11:54:50,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:50,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 11:54:50,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 11:54:50,906 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-07 11:54:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:51,097 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2022-04-07 11:54:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 11:54:51,097 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-07 11:54:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:51,098 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-07 11:54:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-07 11:54:51,098 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-07 11:54:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-07 11:54:51,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-07 11:54:51,125 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-07 11:54:51,126 INFO L225 Difference]: With dead ends: 76 [2022-04-07 11:54:51,126 INFO L226 Difference]: Without dead ends: 63 [2022-04-07 11:54:51,126 INFO L912 BasicCegarLoop]: 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-07 11:54:51,127 INFO L913 BasicCegarLoop]: 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-07 11:54:51,127 INFO L914 BasicCegarLoop]: 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-07 11:54:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-07 11:54:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-07 11:54:51,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:51,235 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-07 11:54:51,236 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-07 11:54:51,236 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-07 11:54:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:51,238 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2022-04-07 11:54:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-04-07 11:54:51,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:51,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:51,238 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-07 11:54:51,238 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-07 11:54:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:51,239 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2022-04-07 11:54:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-04-07 11:54:51,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:51,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:51,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:51,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:51,240 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-07 11:54:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-04-07 11:54:51,241 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 20 [2022-04-07 11:54:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:51,241 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-04-07 11:54:51,241 INFO L479 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-07 11:54:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-04-07 11:54:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 11:54:51,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:51,242 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:51,257 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-07 11:54:51,449 WARN L460 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-07 11:54:51,449 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1586904504, now seen corresponding path program 3 times [2022-04-07 11:54:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:51,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601875174] [2022-04-07 11:54:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:51,518 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-07 11:54:51,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {3244#true} assume true; {3244#true} is VALID [2022-04-07 11:54:51,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3244#true} {3244#true} #72#return; {3244#true} is VALID [2022-04-07 11:54:51,519 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-07 11:54:51,519 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-07 11:54:51,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {3244#true} assume true; {3244#true} is VALID [2022-04-07 11:54:51,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3244#true} {3244#true} #72#return; {3244#true} is VALID [2022-04-07 11:54:51,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {3244#true} call #t~ret13 := main(); {3244#true} is VALID [2022-04-07 11:54:51,519 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-07 11:54:51,520 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-07 11:54:51,520 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-07 11:54:51,521 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-07 11:54:51,521 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-07 11:54:51,522 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-07 11:54:51,522 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-07 11:54:51,522 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-07 11:54:51,522 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-07 11:54:51,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {3245#false} assume !(~y~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-07 11:54:51,522 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-07 11:54:51,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {3245#false} assume !(~x~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-07 11:54:51,522 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-07 11:54:51,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {3245#false} ~cond := #in~cond; {3245#false} is VALID [2022-04-07 11:54:51,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {3245#false} assume 0 == ~cond; {3245#false} is VALID [2022-04-07 11:54:51,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {3245#false} assume !false; {3245#false} is VALID [2022-04-07 11:54:51,523 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-07 11:54:51,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:51,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601875174] [2022-04-07 11:54:51,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601875174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:54:51,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746450518] [2022-04-07 11:54:51,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 11:54:51,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:54:51,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:54:51,524 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-07 11:54:51,524 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-07 11:54:51,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 11:54:51,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:54:51,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 11:54:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:51,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:54:51,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {3244#true} call ULTIMATE.init(); {3244#true} is VALID [2022-04-07 11:54:51,656 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-07 11:54:51,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {3244#true} assume true; {3244#true} is VALID [2022-04-07 11:54:51,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3244#true} {3244#true} #72#return; {3244#true} is VALID [2022-04-07 11:54:51,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {3244#true} call #t~ret13 := main(); {3244#true} is VALID [2022-04-07 11:54:51,657 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-07 11:54:51,657 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-07 11:54:51,658 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-07 11:54:51,658 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-07 11:54:51,658 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-07 11:54:51,659 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-07 11:54:51,659 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-07 11:54:51,659 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-07 11:54:51,659 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-07 11:54:51,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {3245#false} assume !(~y~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-07 11:54:51,659 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-07 11:54:51,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {3245#false} assume !(~x~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-07 11:54:51,659 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-07 11:54:51,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {3245#false} ~cond := #in~cond; {3245#false} is VALID [2022-04-07 11:54:51,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {3245#false} assume 0 == ~cond; {3245#false} is VALID [2022-04-07 11:54:51,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {3245#false} assume !false; {3245#false} is VALID [2022-04-07 11:54:51,660 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-07 11:54:51,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:54:51,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {3245#false} assume !false; {3245#false} is VALID [2022-04-07 11:54:51,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {3245#false} assume 0 == ~cond; {3245#false} is VALID [2022-04-07 11:54:51,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {3245#false} ~cond := #in~cond; {3245#false} is VALID [2022-04-07 11:54:51,764 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-07 11:54:51,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {3245#false} assume !(~x~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-07 11:54:51,764 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-07 11:54:51,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {3245#false} assume !(~y~0 % 4294967296 > 0); {3245#false} is VALID [2022-04-07 11:54:51,765 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-07 11:54:51,765 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-07 11:54:51,766 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-07 11:54:51,767 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-07 11:54:51,767 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-07 11:54:51,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {3244#true} assume !(~x~0 % 4294967296 > 0); {3244#true} is VALID [2022-04-07 11:54:51,767 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-07 11:54:51,767 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-07 11:54:51,767 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-07 11:54:51,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {3244#true} call #t~ret13 := main(); {3244#true} is VALID [2022-04-07 11:54:51,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3244#true} {3244#true} #72#return; {3244#true} is VALID [2022-04-07 11:54:51,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {3244#true} assume true; {3244#true} is VALID [2022-04-07 11:54:51,768 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-07 11:54:51,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {3244#true} call ULTIMATE.init(); {3244#true} is VALID [2022-04-07 11:54:51,768 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-07 11:54:51,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746450518] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:54:51,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:54:51,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-07 11:54:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250015066] [2022-04-07 11:54:51,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:54:51,769 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-07 11:54:51,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:51,769 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-07 11:54:51,792 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-07 11:54:51,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 11:54:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:51,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 11:54:51,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-07 11:54:51,793 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-07 11:54:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:52,485 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2022-04-07 11:54:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-07 11:54:52,485 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-07 11:54:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:52,486 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-07 11:54:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2022-04-07 11:54:52,487 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-07 11:54:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2022-04-07 11:54:52,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 72 transitions. [2022-04-07 11:54:52,543 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-07 11:54:52,544 INFO L225 Difference]: With dead ends: 97 [2022-04-07 11:54:52,544 INFO L226 Difference]: Without dead ends: 80 [2022-04-07 11:54:52,545 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2022-04-07 11:54:52,545 INFO L913 BasicCegarLoop]: 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-07 11:54:52,545 INFO L914 BasicCegarLoop]: 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-07 11:54:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-07 11:54:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2022-04-07 11:54:52,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:52,661 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-07 11:54:52,661 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-07 11:54:52,661 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-07 11:54:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:52,662 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2022-04-07 11:54:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2022-04-07 11:54:52,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:52,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:52,663 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-07 11:54:52,663 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-07 11:54:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:52,664 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2022-04-07 11:54:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2022-04-07 11:54:52,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:52,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:52,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:52,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:52,664 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-07 11:54:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-04-07 11:54:52,665 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 21 [2022-04-07 11:54:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:52,665 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-04-07 11:54:52,666 INFO L479 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-07 11:54:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-07 11:54:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 11:54:52,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:52,666 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:52,682 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-07 11:54:52,871 WARN L460 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-07 11:54:52,871 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:52,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:52,872 INFO L85 PathProgramCache]: Analyzing trace with hash 323810136, now seen corresponding path program 3 times [2022-04-07 11:54:52,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:52,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607066153] [2022-04-07 11:54:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:52,929 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-07 11:54:52,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {3807#true} assume true; {3807#true} is VALID [2022-04-07 11:54:52,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3807#true} {3807#true} #72#return; {3807#true} is VALID [2022-04-07 11:54:52,930 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-07 11:54:52,930 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-07 11:54:52,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {3807#true} assume true; {3807#true} is VALID [2022-04-07 11:54:52,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3807#true} {3807#true} #72#return; {3807#true} is VALID [2022-04-07 11:54:52,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {3807#true} call #t~ret13 := main(); {3807#true} is VALID [2022-04-07 11:54:52,930 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-07 11:54:52,931 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-07 11:54:52,932 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-07 11:54:52,932 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-07 11:54:52,933 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-07 11:54:52,933 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-07 11:54:52,934 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-07 11:54:52,934 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-07 11:54:52,935 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-07 11:54:52,935 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-07 11:54:52,935 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-07 11:54:52,936 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-07 11:54:52,936 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-07 11:54:52,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {3808#false} ~cond := #in~cond; {3808#false} is VALID [2022-04-07 11:54:52,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {3808#false} assume 0 == ~cond; {3808#false} is VALID [2022-04-07 11:54:52,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {3808#false} assume !false; {3808#false} is VALID [2022-04-07 11:54:52,936 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-07 11:54:52,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:52,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607066153] [2022-04-07 11:54:52,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607066153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:54:52,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762298470] [2022-04-07 11:54:52,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 11:54:52,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:54:52,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:54:52,938 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-07 11:54:52,938 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-07 11:54:52,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 11:54:52,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:54:52,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 11:54:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:52,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:54:53,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {3807#true} call ULTIMATE.init(); {3807#true} is VALID [2022-04-07 11:54:53,434 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-07 11:54:53,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {3807#true} assume true; {3807#true} is VALID [2022-04-07 11:54:53,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3807#true} {3807#true} #72#return; {3807#true} is VALID [2022-04-07 11:54:53,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {3807#true} call #t~ret13 := main(); {3807#true} is VALID [2022-04-07 11:54:53,435 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-07 11:54:53,435 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-07 11:54:53,436 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-07 11:54:53,436 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-07 11:54:53,436 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-07 11:54:53,447 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-07 11:54:53,448 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-07 11:54:53,448 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-07 11:54:53,449 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-07 11:54:53,449 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-07 11:54:53,449 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-07 11:54:53,450 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-07 11:54:53,450 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-07 11:54:53,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {3876#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3880#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:54:53,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {3880#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3808#false} is VALID [2022-04-07 11:54:53,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {3808#false} assume !false; {3808#false} is VALID [2022-04-07 11:54:53,451 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-07 11:54:53,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:54:53,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {3808#false} assume !false; {3808#false} is VALID [2022-04-07 11:54:53,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {3880#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3808#false} is VALID [2022-04-07 11:54:53,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {3876#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3880#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:54:53,865 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-07 11:54:53,865 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-07 11:54:53,866 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-07 11:54:53,866 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-07 11:54:53,866 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-07 11:54:53,867 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-07 11:54:53,867 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-07 11:54:53,868 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-07 11:54:53,868 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-07 11:54:53,869 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-07 11:54:53,869 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-07 11:54:53,870 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-07 11:54:53,870 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-07 11:54:53,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {3807#true} call #t~ret13 := main(); {3807#true} is VALID [2022-04-07 11:54:53,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3807#true} {3807#true} #72#return; {3807#true} is VALID [2022-04-07 11:54:53,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {3807#true} assume true; {3807#true} is VALID [2022-04-07 11:54:53,871 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-07 11:54:53,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {3807#true} call ULTIMATE.init(); {3807#true} is VALID [2022-04-07 11:54:53,871 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-07 11:54:53,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762298470] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:54:53,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:54:53,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2022-04-07 11:54:53,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945918493] [2022-04-07 11:54:53,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:54:53,872 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-07 11:54:53,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:54:53,872 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-07 11:54:53,908 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-07 11:54:53,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 11:54:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:54:53,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 11:54:53,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-04-07 11:54:53,909 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-07 11:54:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:54,691 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-07 11:54:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 11:54:54,692 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-07 11:54:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:54:54,692 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-07 11:54:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2022-04-07 11:54:54,693 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-07 11:54:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2022-04-07 11:54:54,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 61 transitions. [2022-04-07 11:54:54,757 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-07 11:54:54,758 INFO L225 Difference]: With dead ends: 90 [2022-04-07 11:54:54,758 INFO L226 Difference]: Without dead ends: 85 [2022-04-07 11:54:54,758 INFO L912 BasicCegarLoop]: 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-07 11:54:54,759 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:54:54,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 62 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 11:54:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-07 11:54:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2022-04-07 11:54:54,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:54:54,911 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-07 11:54:54,911 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-07 11:54:54,911 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-07 11:54:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:54,912 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2022-04-07 11:54:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2022-04-07 11:54:54,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:54,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:54,913 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-07 11:54:54,913 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-07 11:54:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:54:54,914 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2022-04-07 11:54:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2022-04-07 11:54:54,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:54:54,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:54:54,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:54:54,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:54:54,914 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-07 11:54:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-04-07 11:54:54,915 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 21 [2022-04-07 11:54:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:54:54,915 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-04-07 11:54:54,916 INFO L479 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-07 11:54:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-04-07 11:54:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 11:54:54,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:54:54,916 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:54:54,934 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-07 11:54:55,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-07 11:54:55,131 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:54:55,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:54:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 4 times [2022-04-07 11:54:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:54:55,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357145692] [2022-04-07 11:54:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:54:55,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:54:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:54:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:55,434 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-07 11:54:55,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-07 11:54:55,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4389#true} {4389#true} #72#return; {4389#true} is VALID [2022-04-07 11:54:55,434 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-07 11:54:55,435 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-07 11:54:55,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-07 11:54:55,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4389#true} {4389#true} #72#return; {4389#true} is VALID [2022-04-07 11:54:55,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {4389#true} call #t~ret13 := main(); {4389#true} is VALID [2022-04-07 11:54:55,435 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-07 11:54:55,436 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-07 11:54:55,441 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-07 11:54:55,442 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-07 11:54:55,442 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-07 11:54:55,443 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-07 11:54:55,443 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-07 11:54:55,444 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-07 11:54:55,444 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-07 11:54:55,445 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-07 11:54:55,446 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-07 11:54:55,446 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-07 11:54:55,448 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-07 11:54:55,448 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-07 11:54:55,449 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-07 11:54:55,449 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-07 11:54:55,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4390#false} is VALID [2022-04-07 11:54:55,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {4390#false} assume !false; {4390#false} is VALID [2022-04-07 11:54:55,450 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-07 11:54:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:54:55,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357145692] [2022-04-07 11:54:55,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357145692] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:54:55,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422876496] [2022-04-07 11:54:55,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 11:54:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:54:55,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:54:55,451 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-07 11:54:55,452 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-07 11:54:55,503 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 11:54:55,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:54:55,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-07 11:54:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:54:55,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:55:04,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {4389#true} call ULTIMATE.init(); {4389#true} is VALID [2022-04-07 11:55:04,491 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-07 11:55:04,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-07 11:55:04,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4389#true} {4389#true} #72#return; {4389#true} is VALID [2022-04-07 11:55:04,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {4389#true} call #t~ret13 := main(); {4389#true} is VALID [2022-04-07 11:55:04,492 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-07 11:55:04,493 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-07 11:55:04,494 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-07 11:55:04,515 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-07 11:55:04,516 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-07 11:55:04,517 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-07 11:55:04,520 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-07 11:55:04,520 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-07 11:55:04,522 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-07 11:55:04,527 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-07 11:55:04,528 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-07 11:55:04,533 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-07 11:55:04,535 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-07 11:55:04,538 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-07 11:55:04,540 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-07 11:55:04,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {4471#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4475#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:55:04,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {4475#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4390#false} is VALID [2022-04-07 11:55:04,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {4390#false} assume !false; {4390#false} is VALID [2022-04-07 11:55:04,541 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-07 11:55:04,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:55:05,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {4390#false} assume !false; {4390#false} is VALID [2022-04-07 11:55:05,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {4475#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4390#false} is VALID [2022-04-07 11:55:05,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {4471#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4475#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:55:05,687 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-07 11:55:05,687 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-07 11:55:05,689 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-07 11:55:05,690 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-07 11:55:05,691 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-07 11:55:05,692 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-07 11:55:05,693 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-07 11:55:05,694 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-07 11:55:05,695 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-07 11:55:05,696 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-07 11:55:05,696 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-07 11:55:05,697 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-07 11:55:05,700 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-07 11:55:05,702 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-07 11:55:05,702 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-07 11:55:05,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {4389#true} call #t~ret13 := main(); {4389#true} is VALID [2022-04-07 11:55:05,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4389#true} {4389#true} #72#return; {4389#true} is VALID [2022-04-07 11:55:05,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-07 11:55:05,703 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-07 11:55:05,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {4389#true} call ULTIMATE.init(); {4389#true} is VALID [2022-04-07 11:55:05,703 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-07 11:55:05,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422876496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:55:05,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:55:05,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 31 [2022-04-07 11:55:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884043804] [2022-04-07 11:55:05,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:55:05,704 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-07 11:55:05,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:55:05,704 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-07 11:55:06,153 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-07 11:55:06,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-07 11:55:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:55:06,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-07 11:55:06,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2022-04-07 11:55:06,154 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-07 11:55:11,066 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-07 11:55:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:15,689 INFO L93 Difference]: Finished difference Result 140 states and 185 transitions. [2022-04-07 11:55:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-07 11:55:15,689 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-07 11:55:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:55:15,689 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-07 11:55:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-04-07 11:55:15,691 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-07 11:55:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 117 transitions. [2022-04-07 11:55:15,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 117 transitions. [2022-04-07 11:55:16,036 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-07 11:55:16,037 INFO L225 Difference]: With dead ends: 140 [2022-04-07 11:55:16,037 INFO L226 Difference]: Without dead ends: 119 [2022-04-07 11:55:16,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=972, Invalid=4880, Unknown=0, NotChecked=0, Total=5852 [2022-04-07 11:55:16,039 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 138 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 177 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-07 11:55:16,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 91 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 527 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-04-07 11:55:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-07 11:55:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2022-04-07 11:55:16,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:55:16,223 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-07 11:55:16,223 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-07 11:55:16,224 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-07 11:55:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:16,225 INFO L93 Difference]: Finished difference Result 119 states and 159 transitions. [2022-04-07 11:55:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 159 transitions. [2022-04-07 11:55:16,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:16,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:16,226 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-07 11:55:16,226 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-07 11:55:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:16,227 INFO L93 Difference]: Finished difference Result 119 states and 159 transitions. [2022-04-07 11:55:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 159 transitions. [2022-04-07 11:55:16,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:16,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:16,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:55:16,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:55:16,228 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-07 11:55:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2022-04-07 11:55:16,229 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 23 [2022-04-07 11:55:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:55:16,229 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2022-04-07 11:55:16,229 INFO L479 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-07 11:55:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2022-04-07 11:55:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 11:55:16,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:55:16,230 INFO L499 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:55:16,246 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-07 11:55:16,446 WARN L460 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-07 11:55:16,446 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:55:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:55:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1283424344, now seen corresponding path program 4 times [2022-04-07 11:55:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:55:16,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132484038] [2022-04-07 11:55:16,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:55:16,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:55:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:55:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:16,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {5230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5219#true} is VALID [2022-04-07 11:55:16,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-07 11:55:16,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5219#true} {5219#true} #72#return; {5219#true} is VALID [2022-04-07 11:55:16,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:55:16,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {5230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5219#true} is VALID [2022-04-07 11:55:16,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-07 11:55:16,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #72#return; {5219#true} is VALID [2022-04-07 11:55:16,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret13 := main(); {5219#true} is VALID [2022-04-07 11:55:16,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5224#(= main_~y~0 0)} is VALID [2022-04-07 11:55:16,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {5224#(= 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; {5225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:16,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {5225#(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; {5226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:16,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {5226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:16,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {5226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5227#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:55:16,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {5227#(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; {5228#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:55:16,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {5228#(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; {5229#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:55:16,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {5229#(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; {5220#false} is VALID [2022-04-07 11:55:16,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {5220#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; {5220#false} is VALID [2022-04-07 11:55:16,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {5220#false} assume !(~z~0 % 4294967296 > 0); {5220#false} is VALID [2022-04-07 11:55:16,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {5220#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; {5220#false} is VALID [2022-04-07 11:55:16,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {5220#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; {5220#false} is VALID [2022-04-07 11:55:16,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {5220#false} assume !(~y~0 % 4294967296 > 0); {5220#false} is VALID [2022-04-07 11:55:16,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {5220#false} assume !(~x~0 % 4294967296 > 0); {5220#false} is VALID [2022-04-07 11:55:16,537 INFO L272 TraceCheckUtils]: 19: Hoare triple {5220#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5220#false} is VALID [2022-04-07 11:55:16,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-07 11:55:16,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-07 11:55:16,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-07 11:55:16,537 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-07 11:55:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:55:16,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132484038] [2022-04-07 11:55:16,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132484038] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:55:16,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43810589] [2022-04-07 11:55:16,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 11:55:16,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:55:16,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:55:16,538 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-07 11:55:16,539 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-07 11:55:16,569 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 11:55:16,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:55:16,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 11:55:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:16,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:55:16,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5219#true} is VALID [2022-04-07 11:55:16,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5219#true} is VALID [2022-04-07 11:55:16,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-07 11:55:16,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #72#return; {5219#true} is VALID [2022-04-07 11:55:16,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret13 := main(); {5219#true} is VALID [2022-04-07 11:55:16,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5224#(= main_~y~0 0)} is VALID [2022-04-07 11:55:16,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {5224#(= 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; {5225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:16,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {5225#(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; {5226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:16,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {5226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {5226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:16,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {5226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {5261#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:16,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {5261#(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; {5265#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-07 11:55:16,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {5265#(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; {5269#(and (= main_~y~0 (+ main_~z~0 2)) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:16,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {5269#(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; {5220#false} is VALID [2022-04-07 11:55:16,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {5220#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; {5220#false} is VALID [2022-04-07 11:55:16,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {5220#false} assume !(~z~0 % 4294967296 > 0); {5220#false} is VALID [2022-04-07 11:55:16,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {5220#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; {5220#false} is VALID [2022-04-07 11:55:16,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {5220#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; {5220#false} is VALID [2022-04-07 11:55:16,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {5220#false} assume !(~y~0 % 4294967296 > 0); {5220#false} is VALID [2022-04-07 11:55:16,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {5220#false} assume !(~x~0 % 4294967296 > 0); {5220#false} is VALID [2022-04-07 11:55:16,688 INFO L272 TraceCheckUtils]: 19: Hoare triple {5220#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5220#false} is VALID [2022-04-07 11:55:16,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-07 11:55:16,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-07 11:55:16,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-07 11:55:16,689 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-07 11:55:16,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:55:16,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-07 11:55:16,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-07 11:55:16,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-07 11:55:16,824 INFO L272 TraceCheckUtils]: 19: Hoare triple {5220#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5220#false} is VALID [2022-04-07 11:55:16,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {5220#false} assume !(~x~0 % 4294967296 > 0); {5220#false} is VALID [2022-04-07 11:55:16,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {5318#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5220#false} is VALID [2022-04-07 11:55:16,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {5322#(< 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; {5318#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:55:16,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {5326#(< 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; {5322#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:55:16,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {5326#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5326#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:55:16,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {5326#(< 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; {5326#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:55:16,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {5336#(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; {5326#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:55:16,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {5340#(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; {5336#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-07 11:55:16,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {5344#(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; {5340#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-07 11:55:16,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {5219#true} ~z~0 := ~y~0; {5344#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-07 11:55:16,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {5219#true} assume !(~x~0 % 4294967296 > 0); {5219#true} is VALID [2022-04-07 11:55:16,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {5219#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5219#true} is VALID [2022-04-07 11:55:16,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {5219#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5219#true} is VALID [2022-04-07 11:55:16,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5219#true} is VALID [2022-04-07 11:55:16,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret13 := main(); {5219#true} is VALID [2022-04-07 11:55:16,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #72#return; {5219#true} is VALID [2022-04-07 11:55:16,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-07 11:55:16,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5219#true} is VALID [2022-04-07 11:55:16,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5219#true} is VALID [2022-04-07 11:55:16,832 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-07 11:55:16,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43810589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:55:16,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:55:16,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-07 11:55:16,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466225888] [2022-04-07 11:55:16,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:55:16,833 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-07 11:55:16,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:55:16,833 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-07 11:55:16,858 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-07 11:55:16,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 11:55:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:55:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 11:55:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-07 11:55:16,859 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-07 11:55:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:17,757 INFO L93 Difference]: Finished difference Result 115 states and 152 transitions. [2022-04-07 11:55:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-07 11:55:17,758 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-07 11:55:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:55:17,758 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-07 11:55:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2022-04-07 11:55:17,759 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-07 11:55:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2022-04-07 11:55:17,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 73 transitions. [2022-04-07 11:55:17,823 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-07 11:55:17,824 INFO L225 Difference]: With dead ends: 115 [2022-04-07 11:55:17,824 INFO L226 Difference]: Without dead ends: 94 [2022-04-07 11:55:17,825 INFO L912 BasicCegarLoop]: 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-07 11:55:17,825 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:55:17,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 73 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 11:55:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-07 11:55:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2022-04-07 11:55:17,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:55:17,972 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-07 11:55:17,972 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-07 11:55:17,972 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-07 11:55:17,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:17,973 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2022-04-07 11:55:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 123 transitions. [2022-04-07 11:55:17,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:17,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:17,974 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-07 11:55:17,974 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-07 11:55:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:17,975 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2022-04-07 11:55:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 123 transitions. [2022-04-07 11:55:17,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:17,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:17,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:55:17,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:55:17,975 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-07 11:55:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2022-04-07 11:55:17,976 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 23 [2022-04-07 11:55:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:55:17,976 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2022-04-07 11:55:17,977 INFO L479 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-07 11:55:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2022-04-07 11:55:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 11:55:17,977 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:55:17,977 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:55:17,995 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-07 11:55:18,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 11:55:18,193 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:55:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:55:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1347388208, now seen corresponding path program 5 times [2022-04-07 11:55:18,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:55:18,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831566166] [2022-04-07 11:55:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:55:18,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:55:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:18,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:55:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:18,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {5883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5872#true} is VALID [2022-04-07 11:55:18,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {5872#true} assume true; {5872#true} is VALID [2022-04-07 11:55:18,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5872#true} {5872#true} #72#return; {5872#true} is VALID [2022-04-07 11:55:18,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {5872#true} call ULTIMATE.init(); {5883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:55:18,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {5883#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5872#true} is VALID [2022-04-07 11:55:18,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {5872#true} assume true; {5872#true} is VALID [2022-04-07 11:55:18,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5872#true} {5872#true} #72#return; {5872#true} is VALID [2022-04-07 11:55:18,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {5872#true} call #t~ret13 := main(); {5872#true} is VALID [2022-04-07 11:55:18,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {5872#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5872#true} is VALID [2022-04-07 11:55:18,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {5872#true} assume !!(~x~0 % 4294967296 > 0);#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 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:18,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {5877#(<= 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; {5878#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-07 11:55:18,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {5878#(<= 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; {5879#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-07 11:55:18,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {5879#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5879#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-07 11:55:18,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {5879#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {5879#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-07 11:55:18,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {5879#(<= (* 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; {5880#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-07 11:55:18,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {5880#(<= (+ (* (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; {5881#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-07 11:55:18,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {5881#(<= (+ 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; {5882#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:18,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {5882#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5882#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:18,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {5882#(<= (+ 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; {5882#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:18,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {5882#(<= (+ 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; {5882#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:18,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {5882#(<= (+ 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; {5882#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:18,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {5882#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5882#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:18,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {5882#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5873#false} is VALID [2022-04-07 11:55:18,277 INFO L272 TraceCheckUtils]: 20: Hoare triple {5873#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5873#false} is VALID [2022-04-07 11:55:18,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {5873#false} ~cond := #in~cond; {5873#false} is VALID [2022-04-07 11:55:18,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {5873#false} assume 0 == ~cond; {5873#false} is VALID [2022-04-07 11:55:18,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {5873#false} assume !false; {5873#false} is VALID [2022-04-07 11:55:18,278 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-07 11:55:18,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:55:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831566166] [2022-04-07 11:55:18,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831566166] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:55:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280479159] [2022-04-07 11:55:18,278 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 11:55:18,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:55:18,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:55:18,279 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-07 11:55:18,280 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-07 11:55:18,322 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-07 11:55:18,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:55:18,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-07 11:55:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:18,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:55:18,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {5872#true} call ULTIMATE.init(); {5872#true} is VALID [2022-04-07 11:55:18,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {5872#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5872#true} is VALID [2022-04-07 11:55:18,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {5872#true} assume true; {5872#true} is VALID [2022-04-07 11:55:18,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5872#true} {5872#true} #72#return; {5872#true} is VALID [2022-04-07 11:55:18,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {5872#true} call #t~ret13 := main(); {5872#true} is VALID [2022-04-07 11:55:18,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {5872#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5872#true} is VALID [2022-04-07 11:55:18,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {5872#true} assume !!(~x~0 % 4294967296 > 0);#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 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:18,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {5877#(<= 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; {5908#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-07 11:55:18,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {5908#(<= 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; {5912#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {5912#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5912#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {5912#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {5912#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {5912#(<= 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; {5908#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-07 11:55:18,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {5908#(<= 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; {5877#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:18,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {5877#(<= 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; {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {5928#(<= 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; {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {5928#(<= 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; {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {5928#(<= 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; {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5873#false} is VALID [2022-04-07 11:55:18,538 INFO L272 TraceCheckUtils]: 20: Hoare triple {5873#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5873#false} is VALID [2022-04-07 11:55:18,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {5873#false} ~cond := #in~cond; {5873#false} is VALID [2022-04-07 11:55:18,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {5873#false} assume 0 == ~cond; {5873#false} is VALID [2022-04-07 11:55:18,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {5873#false} assume !false; {5873#false} is VALID [2022-04-07 11:55:18,539 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-07 11:55:18,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:55:18,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {5873#false} assume !false; {5873#false} is VALID [2022-04-07 11:55:18,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {5873#false} assume 0 == ~cond; {5873#false} is VALID [2022-04-07 11:55:18,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {5873#false} ~cond := #in~cond; {5873#false} is VALID [2022-04-07 11:55:18,619 INFO L272 TraceCheckUtils]: 20: Hoare triple {5873#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5873#false} is VALID [2022-04-07 11:55:18,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5873#false} is VALID [2022-04-07 11:55:18,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {5928#(<= 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; {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {5928#(<= 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; {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {5928#(<= 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; {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {5877#(<= 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; {5928#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {5908#(<= 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; {5877#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:18,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {5912#(<= 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; {5908#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-07 11:55:18,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {5912#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {5912#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {5912#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5912#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {5908#(<= 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; {5912#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:18,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {5877#(<= 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; {5908#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-07 11:55:18,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {5872#true} assume !!(~x~0 % 4294967296 > 0);#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 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:18,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {5872#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5872#true} is VALID [2022-04-07 11:55:18,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {5872#true} call #t~ret13 := main(); {5872#true} is VALID [2022-04-07 11:55:18,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5872#true} {5872#true} #72#return; {5872#true} is VALID [2022-04-07 11:55:18,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {5872#true} assume true; {5872#true} is VALID [2022-04-07 11:55:18,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {5872#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5872#true} is VALID [2022-04-07 11:55:18,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {5872#true} call ULTIMATE.init(); {5872#true} is VALID [2022-04-07 11:55:18,626 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-07 11:55:18,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280479159] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:55:18,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:55:18,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-07 11:55:18,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085151862] [2022-04-07 11:55:18,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:55:18,627 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-07 11:55:18,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:55:18,627 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-07 11:55:18,651 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-07 11:55:18,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 11:55:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:55:18,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 11:55:18,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-07 11:55:18,652 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-07 11:55:19,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:19,140 INFO L93 Difference]: Finished difference Result 102 states and 139 transitions. [2022-04-07 11:55:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 11:55:19,140 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-07 11:55:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:55:19,141 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-07 11:55:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-07 11:55:19,141 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-07 11:55:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-07 11:55:19,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-07 11:55:19,203 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-07 11:55:19,204 INFO L225 Difference]: With dead ends: 102 [2022-04-07 11:55:19,204 INFO L226 Difference]: Without dead ends: 97 [2022-04-07 11:55:19,204 INFO L912 BasicCegarLoop]: 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-07 11:55:19,204 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:55:19,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 46 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:55:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-07 11:55:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-04-07 11:55:19,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:55:19,373 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-07 11:55:19,373 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-07 11:55:19,373 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-07 11:55:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:19,374 INFO L93 Difference]: Finished difference Result 97 states and 132 transitions. [2022-04-07 11:55:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2022-04-07 11:55:19,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:19,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:19,375 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-07 11:55:19,375 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-07 11:55:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:19,376 INFO L93 Difference]: Finished difference Result 97 states and 132 transitions. [2022-04-07 11:55:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 132 transitions. [2022-04-07 11:55:19,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:19,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:19,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:55:19,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:55:19,377 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-07 11:55:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2022-04-07 11:55:19,378 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 24 [2022-04-07 11:55:19,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:55:19,378 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2022-04-07 11:55:19,378 INFO L479 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-07 11:55:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2022-04-07 11:55:19,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 11:55:19,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:55:19,378 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:55:19,394 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-07 11:55:19,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-07 11:55:19,583 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:55:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:55:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1108300783, now seen corresponding path program 5 times [2022-04-07 11:55:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:55:19,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138018319] [2022-04-07 11:55:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:55:19,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:55:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:19,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:55:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:19,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {6526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6512#true} is VALID [2022-04-07 11:55:19,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-07 11:55:19,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-07 11:55:19,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} call ULTIMATE.init(); {6526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:55:19,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {6526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6512#true} is VALID [2022-04-07 11:55:19,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-07 11:55:19,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-07 11:55:19,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} call #t~ret13 := main(); {6512#true} is VALID [2022-04-07 11:55:19,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6517#(= main_~y~0 0)} is VALID [2022-04-07 11:55:19,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {6517#(= 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; {6518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:19,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {6518#(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; {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:19,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {6519#(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; {6520#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:19,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {6520#(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; {6521#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:55:19,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {6521#(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; {6522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:55:19,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {6522#(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; {6523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:55:19,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {6523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:55:19,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {6523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:55:19,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {6524#(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; {6525#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-07 11:55:19,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {6525#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-07 11:55:19,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {6513#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; {6513#false} is VALID [2022-04-07 11:55:19,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {6513#false} assume !(~y~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-07 11:55:19,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {6513#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; {6513#false} is VALID [2022-04-07 11:55:19,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {6513#false} assume !(~x~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-07 11:55:19,723 INFO L272 TraceCheckUtils]: 20: Hoare triple {6513#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6513#false} is VALID [2022-04-07 11:55:19,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {6513#false} ~cond := #in~cond; {6513#false} is VALID [2022-04-07 11:55:19,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {6513#false} assume 0 == ~cond; {6513#false} is VALID [2022-04-07 11:55:19,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-04-07 11:55:19,724 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-07 11:55:19,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:55:19,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138018319] [2022-04-07 11:55:19,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138018319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:55:19,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559749137] [2022-04-07 11:55:19,724 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 11:55:19,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:55:19,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:55:19,725 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-07 11:55:19,726 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-07 11:55:19,763 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-07 11:55:19,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:55:19,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 11:55:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:19,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:55:19,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} call ULTIMATE.init(); {6512#true} is VALID [2022-04-07 11:55:19,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6512#true} is VALID [2022-04-07 11:55:19,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-07 11:55:19,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-07 11:55:19,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} call #t~ret13 := main(); {6512#true} is VALID [2022-04-07 11:55:19,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6517#(= main_~y~0 0)} is VALID [2022-04-07 11:55:19,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {6517#(= 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; {6518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:19,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {6518#(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; {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:19,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {6519#(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; {6520#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:19,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {6520#(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; {6521#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:55:19,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {6521#(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; {6522#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:55:19,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {6522#(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; {6523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:55:19,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {6523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:55:19,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {6523#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6524#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:55:19,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {6524#(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; {6572#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:55:19,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {6572#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-07 11:55:19,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {6513#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; {6513#false} is VALID [2022-04-07 11:55:19,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {6513#false} assume !(~y~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-07 11:55:19,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {6513#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; {6513#false} is VALID [2022-04-07 11:55:19,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {6513#false} assume !(~x~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-07 11:55:19,969 INFO L272 TraceCheckUtils]: 20: Hoare triple {6513#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6513#false} is VALID [2022-04-07 11:55:19,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {6513#false} ~cond := #in~cond; {6513#false} is VALID [2022-04-07 11:55:19,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {6513#false} assume 0 == ~cond; {6513#false} is VALID [2022-04-07 11:55:19,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-04-07 11:55:19,969 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-07 11:55:19,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:55:20,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-04-07 11:55:20,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {6513#false} assume 0 == ~cond; {6513#false} is VALID [2022-04-07 11:55:20,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {6513#false} ~cond := #in~cond; {6513#false} is VALID [2022-04-07 11:55:20,140 INFO L272 TraceCheckUtils]: 20: Hoare triple {6513#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6513#false} is VALID [2022-04-07 11:55:20,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {6513#false} assume !(~x~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-07 11:55:20,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {6513#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; {6513#false} is VALID [2022-04-07 11:55:20,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {6513#false} assume !(~y~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-07 11:55:20,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {6513#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; {6513#false} is VALID [2022-04-07 11:55:20,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {6624#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-07 11:55:20,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {6628#(< 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; {6624#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:55:20,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {6632#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {6628#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:55:20,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {6632#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6632#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:55:20,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {6639#(< 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; {6632#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:55:20,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {6643#(< 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; {6639#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:55:20,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {6647#(< 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; {6643#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:55:20,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {6651#(< 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; {6647#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 11:55:20,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {6655#(< 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; {6651#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-07 11:55:20,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {6659#(< 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; {6655#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-07 11:55:20,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6659#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-07 11:55:20,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} call #t~ret13 := main(); {6512#true} is VALID [2022-04-07 11:55:20,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-07 11:55:20,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-07 11:55:20,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6512#true} is VALID [2022-04-07 11:55:20,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} call ULTIMATE.init(); {6512#true} is VALID [2022-04-07 11:55:20,146 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-07 11:55:20,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559749137] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:55:20,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:55:20,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-07 11:55:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007268015] [2022-04-07 11:55:20,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:55:20,147 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-07 11:55:20,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:55:20,148 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-07 11:55:20,180 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-07 11:55:20,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 11:55:20,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:55:20,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 11:55:20,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-07 11:55:20,188 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-07 11:55:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:27,774 INFO L93 Difference]: Finished difference Result 296 states and 424 transitions. [2022-04-07 11:55:27,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-07 11:55:27,774 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-07 11:55:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:55:27,774 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-07 11:55:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 237 transitions. [2022-04-07 11:55:27,777 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-07 11:55:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 237 transitions. [2022-04-07 11:55:27,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 237 transitions. [2022-04-07 11:55:28,376 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-07 11:55:28,379 INFO L225 Difference]: With dead ends: 296 [2022-04-07 11:55:28,380 INFO L226 Difference]: Without dead ends: 270 [2022-04-07 11:55:28,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2412 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1734, Invalid=5406, Unknown=0, NotChecked=0, Total=7140 [2022-04-07 11:55:28,382 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 354 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-07 11:55:28,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 89 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-07 11:55:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-07 11:55:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 109. [2022-04-07 11:55:28,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:55:28,637 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-07 11:55:28,637 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-07 11:55:28,637 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-07 11:55:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:28,641 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2022-04-07 11:55:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 363 transitions. [2022-04-07 11:55:28,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:28,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:28,642 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-07 11:55:28,643 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-07 11:55:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:28,647 INFO L93 Difference]: Finished difference Result 270 states and 363 transitions. [2022-04-07 11:55:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 363 transitions. [2022-04-07 11:55:28,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:28,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:28,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:55:28,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:55:28,648 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-07 11:55:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2022-04-07 11:55:28,649 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 24 [2022-04-07 11:55:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:55:28,649 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2022-04-07 11:55:28,649 INFO L479 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-07 11:55:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2022-04-07 11:55:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 11:55:28,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:55:28,650 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:55:28,665 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-07 11:55:28,863 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-07 11:55:28,863 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:55:28,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:55:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash 467119846, now seen corresponding path program 6 times [2022-04-07 11:55:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:55:28,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248718657] [2022-04-07 11:55:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:55:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:55:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:28,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:55:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:28,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {7923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7911#true} is VALID [2022-04-07 11:55:28,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {7911#true} assume true; {7911#true} is VALID [2022-04-07 11:55:28,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7911#true} {7911#true} #72#return; {7911#true} is VALID [2022-04-07 11:55:28,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {7911#true} call ULTIMATE.init(); {7923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:55:28,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {7923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7911#true} is VALID [2022-04-07 11:55:28,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {7911#true} assume true; {7911#true} is VALID [2022-04-07 11:55:28,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7911#true} {7911#true} #72#return; {7911#true} is VALID [2022-04-07 11:55:28,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {7911#true} call #t~ret13 := main(); {7911#true} is VALID [2022-04-07 11:55:28,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {7911#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7916#(= main_~y~0 0)} is VALID [2022-04-07 11:55:28,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {7916#(= 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; {7917#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:28,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {7917#(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; {7918#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:28,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {7918#(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; {7919#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:28,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {7919#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7919#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:28,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {7919#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {7920#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:55:28,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {7920#(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; {7921#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:55:28,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {7921#(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; {7922#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-07 11:55:28,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {7922#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7912#false} is VALID [2022-04-07 11:55:28,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:28,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:28,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:28,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {7912#false} assume !(~y~0 % 4294967296 > 0); {7912#false} is VALID [2022-04-07 11:55:28,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:28,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:28,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {7912#false} assume !(~x~0 % 4294967296 > 0); {7912#false} is VALID [2022-04-07 11:55:28,963 INFO L272 TraceCheckUtils]: 21: Hoare triple {7912#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7912#false} is VALID [2022-04-07 11:55:28,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {7912#false} ~cond := #in~cond; {7912#false} is VALID [2022-04-07 11:55:28,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {7912#false} assume 0 == ~cond; {7912#false} is VALID [2022-04-07 11:55:28,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {7912#false} assume !false; {7912#false} is VALID [2022-04-07 11:55:28,963 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-07 11:55:28,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:55:28,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248718657] [2022-04-07 11:55:28,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248718657] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:55:28,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631290349] [2022-04-07 11:55:28,963 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 11:55:28,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:55:28,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:55:28,964 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-07 11:55:28,965 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-07 11:55:28,996 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-07 11:55:28,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:55:28,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 11:55:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:29,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:55:29,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {7911#true} call ULTIMATE.init(); {7911#true} is VALID [2022-04-07 11:55:29,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {7911#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7911#true} is VALID [2022-04-07 11:55:29,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {7911#true} assume true; {7911#true} is VALID [2022-04-07 11:55:29,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7911#true} {7911#true} #72#return; {7911#true} is VALID [2022-04-07 11:55:29,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {7911#true} call #t~ret13 := main(); {7911#true} is VALID [2022-04-07 11:55:29,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {7911#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7916#(= main_~y~0 0)} is VALID [2022-04-07 11:55:29,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {7916#(= 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; {7917#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:29,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {7917#(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; {7918#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:29,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {7918#(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; {7919#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:29,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {7919#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7919#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:29,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {7919#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {7957#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:29,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {7957#(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; {7961#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-07 11:55:29,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {7961#(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; {7965#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-07 11:55:29,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {7965#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !(~z~0 % 4294967296 > 0); {7912#false} is VALID [2022-04-07 11:55:29,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:29,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:29,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:29,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {7912#false} assume !(~y~0 % 4294967296 > 0); {7912#false} is VALID [2022-04-07 11:55:29,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:29,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:29,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {7912#false} assume !(~x~0 % 4294967296 > 0); {7912#false} is VALID [2022-04-07 11:55:29,128 INFO L272 TraceCheckUtils]: 21: Hoare triple {7912#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7912#false} is VALID [2022-04-07 11:55:29,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {7912#false} ~cond := #in~cond; {7912#false} is VALID [2022-04-07 11:55:29,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {7912#false} assume 0 == ~cond; {7912#false} is VALID [2022-04-07 11:55:29,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {7912#false} assume !false; {7912#false} is VALID [2022-04-07 11:55:29,128 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-07 11:55:29,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:55:29,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {7912#false} assume !false; {7912#false} is VALID [2022-04-07 11:55:29,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {7912#false} assume 0 == ~cond; {7912#false} is VALID [2022-04-07 11:55:29,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {7912#false} ~cond := #in~cond; {7912#false} is VALID [2022-04-07 11:55:29,288 INFO L272 TraceCheckUtils]: 21: Hoare triple {7912#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7912#false} is VALID [2022-04-07 11:55:29,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {7912#false} assume !(~x~0 % 4294967296 > 0); {7912#false} is VALID [2022-04-07 11:55:29,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:29,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {7912#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; {7912#false} is VALID [2022-04-07 11:55:29,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {7912#false} assume !(~y~0 % 4294967296 > 0); {7912#false} is VALID [2022-04-07 11:55:29,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {8026#(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; {7912#false} is VALID [2022-04-07 11:55:29,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {8030#(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; {8026#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:55:29,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {8034#(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; {8030#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-07 11:55:29,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {8038#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8034#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-07 11:55:29,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {8042#(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; {8038#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-07 11:55:29,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {8046#(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; {8042#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-07 11:55:29,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {7911#true} ~z~0 := ~y~0; {8046#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-07 11:55:29,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {7911#true} assume !(~x~0 % 4294967296 > 0); {7911#true} is VALID [2022-04-07 11:55:29,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {7911#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7911#true} is VALID [2022-04-07 11:55:29,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {7911#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7911#true} is VALID [2022-04-07 11:55:29,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {7911#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7911#true} is VALID [2022-04-07 11:55:29,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {7911#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7911#true} is VALID [2022-04-07 11:55:29,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {7911#true} call #t~ret13 := main(); {7911#true} is VALID [2022-04-07 11:55:29,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7911#true} {7911#true} #72#return; {7911#true} is VALID [2022-04-07 11:55:29,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {7911#true} assume true; {7911#true} is VALID [2022-04-07 11:55:29,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {7911#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7911#true} is VALID [2022-04-07 11:55:29,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {7911#true} call ULTIMATE.init(); {7911#true} is VALID [2022-04-07 11:55:29,293 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-07 11:55:29,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631290349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:55:29,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:55:29,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-07 11:55:29,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719257535] [2022-04-07 11:55:29,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:55:29,293 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-07 11:55:29,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:55:29,294 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-07 11:55:29,317 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-07 11:55:29,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 11:55:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:55:29,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 11:55:29,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-07 11:55:29,318 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-07 11:55:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:30,714 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2022-04-07 11:55:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 11:55:30,715 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-07 11:55:30,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:55:30,715 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-07 11:55:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 89 transitions. [2022-04-07 11:55:30,716 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-07 11:55:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 89 transitions. [2022-04-07 11:55:30,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 89 transitions. [2022-04-07 11:55:30,795 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-07 11:55:30,796 INFO L225 Difference]: With dead ends: 164 [2022-04-07 11:55:30,797 INFO L226 Difference]: Without dead ends: 144 [2022-04-07 11:55:30,797 INFO L912 BasicCegarLoop]: 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-07 11:55:30,798 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 11:55:30,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 61 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 11:55:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-07 11:55:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 105. [2022-04-07 11:55:31,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:55:31,075 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-07 11:55:31,075 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-07 11:55:31,083 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-07 11:55:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:31,085 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2022-04-07 11:55:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2022-04-07 11:55:31,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:31,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:31,086 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-07 11:55:31,086 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-07 11:55:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:31,087 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2022-04-07 11:55:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2022-04-07 11:55:31,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:31,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:31,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:55:31,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:55:31,088 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-07 11:55:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2022-04-07 11:55:31,089 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 25 [2022-04-07 11:55:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:55:31,089 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2022-04-07 11:55:31,089 INFO L479 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-07 11:55:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2022-04-07 11:55:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 11:55:31,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:55:31,090 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:55:31,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-07 11:55:31,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-07 11:55:31,303 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:55:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:55:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash -828351928, now seen corresponding path program 7 times [2022-04-07 11:55:31,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:55:31,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737517351] [2022-04-07 11:55:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:55:31,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:55:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:31,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:55:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:31,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {8819#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8802#true} is VALID [2022-04-07 11:55:31,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {8802#true} assume true; {8802#true} is VALID [2022-04-07 11:55:31,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8802#true} {8802#true} #72#return; {8802#true} is VALID [2022-04-07 11:55:31,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {8802#true} call ULTIMATE.init(); {8819#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:55:31,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {8819#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8802#true} is VALID [2022-04-07 11:55:31,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {8802#true} assume true; {8802#true} is VALID [2022-04-07 11:55:31,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8802#true} {8802#true} #72#return; {8802#true} is VALID [2022-04-07 11:55:31,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {8802#true} call #t~ret13 := main(); {8802#true} is VALID [2022-04-07 11:55:31,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {8802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8807#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-07 11:55:31,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {8807#(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; {8808#(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-07 11:55:31,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {8808#(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; {8809#(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-07 11:55:31,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {8809#(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; {8810#(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-07 11:55:31,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {8810#(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); {8811#(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-07 11:55:31,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {8811#(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; {8811#(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-07 11:55:31,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {8811#(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; {8812#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-07 11:55:31,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {8812#(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; {8812#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-07 11:55:31,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {8812#(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; {8812#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-07 11:55:31,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {8812#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !(~z~0 % 4294967296 > 0); {8812#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-07 11:55:31,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {8812#(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; {8813#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:31,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {8813#(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; {8814#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:31,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {8814#(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; {8815#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-07 11:55:31,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {8815#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {8815#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-07 11:55:31,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {8815#(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; {8814#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:31,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {8814#(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; {8813#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:31,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {8813#(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; {8816#(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-07 11:55:31,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {8816#(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); {8816#(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-07 11:55:31,642 INFO L272 TraceCheckUtils]: 23: Hoare triple {8816#(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)); {8817#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:55:31,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {8817#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8818#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:55:31,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {8818#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8803#false} is VALID [2022-04-07 11:55:31,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {8803#false} assume !false; {8803#false} is VALID [2022-04-07 11:55:31,643 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-07 11:55:31,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:55:31,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737517351] [2022-04-07 11:55:31,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737517351] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:55:31,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522405214] [2022-04-07 11:55:31,643 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 11:55:31,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:55:31,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:55:31,644 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-07 11:55:31,645 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-07 11:55:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:31,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-07 11:55:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:31,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:55:37,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {8802#true} call ULTIMATE.init(); {8802#true} is VALID [2022-04-07 11:55:37,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {8802#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8802#true} is VALID [2022-04-07 11:55:37,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {8802#true} assume true; {8802#true} is VALID [2022-04-07 11:55:37,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8802#true} {8802#true} #72#return; {8802#true} is VALID [2022-04-07 11:55:37,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {8802#true} call #t~ret13 := main(); {8802#true} is VALID [2022-04-07 11:55:37,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {8802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8807#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-07 11:55:37,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {8807#(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; {8808#(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-07 11:55:37,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {8808#(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; {8844#(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-07 11:55:37,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {8844#(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; {8848#(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-07 11:55:37,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {8848#(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); {8852#(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-07 11:55:37,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {8852#(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; {8856#(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-07 11:55:37,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {8856#(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; {8860#(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-07 11:55:37,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {8860#(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; {8864#(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-07 11:55:37,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {8864#(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; {8868#(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-07 11:55:37,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {8868#(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); {8868#(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-07 11:55:37,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {8868#(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; {8875#(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-07 11:55:37,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {8875#(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; {8879#(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-07 11:55:37,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {8879#(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; {8883#(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-07 11:55:37,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {8883#(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); {8883#(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-07 11:55:37,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {8883#(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; {8890#(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-07 11:55:37,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {8890#(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; {8894#(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-07 11:55:37,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {8894#(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; {8852#(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-07 11:55:37,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {8852#(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); {8812#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-07 11:55:37,525 INFO L272 TraceCheckUtils]: 23: Hoare triple {8812#(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)); {8904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:55:37,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {8904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:55:37,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {8908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8803#false} is VALID [2022-04-07 11:55:37,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {8803#false} assume !false; {8803#false} is VALID [2022-04-07 11:55:37,526 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-07 11:55:37,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:55:38,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {8803#false} assume !false; {8803#false} is VALID [2022-04-07 11:55:38,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {8908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8803#false} is VALID [2022-04-07 11:55:38,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {8904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:55:38,954 INFO L272 TraceCheckUtils]: 23: Hoare triple {8924#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:55:38,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {8928#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8924#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:55:38,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {8932#(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; {8928#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:55:38,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {8936#(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; {8932#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-07 11:55:38,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {8940#(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; {8936#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-07 11:55:38,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {8940#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8940#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:55:38,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {8947#(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; {8940#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:55:38,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {8951#(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; {8947#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-07 11:55:38,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {8955#(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; {8951#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-07 11:55:38,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {8955#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8955#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:55:38,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {8962#(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; {8955#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:55:38,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {8966#(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; {8962#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:55:38,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {8970#(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; {8966#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:55:38,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {8974#(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; {8970#(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-07 11:55:38,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {8974#(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); {8974#(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-07 11:55:38,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {8981#(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; {8974#(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-07 11:55:38,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {8985#(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; {8981#(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-07 11:55:38,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {8989#(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; {8985#(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-07 11:55:38,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {8802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8989#(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-07 11:55:38,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {8802#true} call #t~ret13 := main(); {8802#true} is VALID [2022-04-07 11:55:38,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8802#true} {8802#true} #72#return; {8802#true} is VALID [2022-04-07 11:55:38,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {8802#true} assume true; {8802#true} is VALID [2022-04-07 11:55:38,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {8802#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8802#true} is VALID [2022-04-07 11:55:38,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {8802#true} call ULTIMATE.init(); {8802#true} is VALID [2022-04-07 11:55:38,971 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-07 11:55:38,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522405214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:55:38,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:55:38,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 44 [2022-04-07 11:55:38,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289647067] [2022-04-07 11:55:38,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:55:38,972 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-07 11:55:38,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:55:38,972 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-07 11:55:39,111 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-07 11:55:39,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-07 11:55:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:55:39,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-07 11:55:39,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1552, Unknown=0, NotChecked=0, Total=1892 [2022-04-07 11:55:39,112 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-07 11:55:43,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 11:55:50,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 11:55:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:54,961 INFO L93 Difference]: Finished difference Result 188 states and 243 transitions. [2022-04-07 11:55:54,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-07 11:55:54,962 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-07 11:55:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:55:54,962 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-07 11:55:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 142 transitions. [2022-04-07 11:55:54,963 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-07 11:55:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 142 transitions. [2022-04-07 11:55:54,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 142 transitions. [2022-04-07 11:55:55,397 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-07 11:55:55,398 INFO L225 Difference]: With dead ends: 188 [2022-04-07 11:55:55,398 INFO L226 Difference]: Without dead ends: 169 [2022-04-07 11:55:55,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3393 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1743, Invalid=9599, Unknown=0, NotChecked=0, Total=11342 [2022-04-07 11:55:55,401 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 170 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:55:55,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 103 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-07 11:55:55,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-07 11:55:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 129. [2022-04-07 11:55:55,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:55:55,729 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-07 11:55:55,729 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-07 11:55:55,729 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-07 11:55:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:55,731 INFO L93 Difference]: Finished difference Result 169 states and 220 transitions. [2022-04-07 11:55:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 220 transitions. [2022-04-07 11:55:55,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:55,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:55,731 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-07 11:55:55,731 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-07 11:55:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:55,733 INFO L93 Difference]: Finished difference Result 169 states and 220 transitions. [2022-04-07 11:55:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 220 transitions. [2022-04-07 11:55:55,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:55,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:55,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:55:55,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:55:55,734 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-07 11:55:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2022-04-07 11:55:55,735 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 27 [2022-04-07 11:55:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:55:55,735 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2022-04-07 11:55:55,736 INFO L479 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-07 11:55:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2022-04-07 11:55:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 11:55:55,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:55:55,736 INFO L499 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:55:55,759 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-07 11:55:55,952 WARN L460 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-07 11:55:55,952 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:55:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:55:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash -549567514, now seen corresponding path program 6 times [2022-04-07 11:55:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:55:55,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678675635] [2022-04-07 11:55:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:55:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:55:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:55:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:56,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {9936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9923#true} is VALID [2022-04-07 11:55:56,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {9923#true} assume true; {9923#true} is VALID [2022-04-07 11:55:56,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9923#true} {9923#true} #72#return; {9923#true} is VALID [2022-04-07 11:55:56,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {9923#true} call ULTIMATE.init(); {9936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:55:56,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {9936#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9923#true} is VALID [2022-04-07 11:55:56,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {9923#true} assume true; {9923#true} is VALID [2022-04-07 11:55:56,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9923#true} {9923#true} #72#return; {9923#true} is VALID [2022-04-07 11:55:56,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {9923#true} call #t~ret13 := main(); {9923#true} is VALID [2022-04-07 11:55:56,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {9923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9928#(= main_~y~0 0)} is VALID [2022-04-07 11:55:56,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {9928#(= 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; {9929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:56,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {9929#(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; {9930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:56,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {9930#(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; {9931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:56,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {9931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:56,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {9931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9932#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:55:56,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {9932#(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; {9933#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:55:56,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {9933#(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; {9934#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:55:56,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {9934#(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; {9935#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {9935#(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; {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {9924#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; {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {9924#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; {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {9924#false} assume !(~z~0 % 4294967296 > 0); {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {9924#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; {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {9924#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; {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {9924#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; {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {9924#false} assume !(~y~0 % 4294967296 > 0); {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {9924#false} assume !(~x~0 % 4294967296 > 0); {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L272 TraceCheckUtils]: 23: Hoare triple {9924#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {9924#false} ~cond := #in~cond; {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {9924#false} assume 0 == ~cond; {9924#false} is VALID [2022-04-07 11:55:56,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {9924#false} assume !false; {9924#false} is VALID [2022-04-07 11:55:56,092 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-07 11:55:56,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:55:56,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678675635] [2022-04-07 11:55:56,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678675635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:55:56,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229208377] [2022-04-07 11:55:56,092 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 11:55:56,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:55:56,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:55:56,096 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-07 11:55:56,099 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-07 11:55:56,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-07 11:55:56,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:55:56,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-07 11:55:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:56,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:55:56,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {9923#true} call ULTIMATE.init(); {9923#true} is VALID [2022-04-07 11:55:56,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {9923#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9923#true} is VALID [2022-04-07 11:55:56,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {9923#true} assume true; {9923#true} is VALID [2022-04-07 11:55:56,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9923#true} {9923#true} #72#return; {9923#true} is VALID [2022-04-07 11:55:56,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {9923#true} call #t~ret13 := main(); {9923#true} is VALID [2022-04-07 11:55:56,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {9923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9928#(= main_~y~0 0)} is VALID [2022-04-07 11:55:56,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {9928#(= 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; {9929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:56,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {9929#(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; {9930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:56,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {9930#(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; {9931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:56,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {9931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:56,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {9931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {9970#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:56,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {9970#(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; {9974#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-07 11:55:56,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {9974#(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; {9978#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:56,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {9978#(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; {9982#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:56,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {9982#(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; {9924#false} is VALID [2022-04-07 11:55:56,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {9924#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; {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {9924#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; {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {9924#false} assume !(~z~0 % 4294967296 > 0); {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {9924#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; {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {9924#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; {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {9924#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; {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {9924#false} assume !(~y~0 % 4294967296 > 0); {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {9924#false} assume !(~x~0 % 4294967296 > 0); {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L272 TraceCheckUtils]: 23: Hoare triple {9924#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {9924#false} ~cond := #in~cond; {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {9924#false} assume 0 == ~cond; {9924#false} is VALID [2022-04-07 11:55:56,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {9924#false} assume !false; {9924#false} is VALID [2022-04-07 11:55:56,302 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-07 11:55:56,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:55:56,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {9924#false} assume !false; {9924#false} is VALID [2022-04-07 11:55:56,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {9924#false} assume 0 == ~cond; {9924#false} is VALID [2022-04-07 11:55:56,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {9924#false} ~cond := #in~cond; {9924#false} is VALID [2022-04-07 11:55:56,496 INFO L272 TraceCheckUtils]: 23: Hoare triple {9924#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9924#false} is VALID [2022-04-07 11:55:56,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {9924#false} assume !(~x~0 % 4294967296 > 0); {9924#false} is VALID [2022-04-07 11:55:56,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {10037#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9924#false} is VALID [2022-04-07 11:55:56,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {10041#(< 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; {10037#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:55:56,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {10045#(< 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; {10041#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:55:56,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {10049#(< 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; {10045#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:55:56,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {10049#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {10049#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:55:56,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {10049#(< 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; {10049#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:55:56,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {10049#(< 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; {10049#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:55:56,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {10062#(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; {10049#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:55:56,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {10066#(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; {10062#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:55:56,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {10070#(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; {10066#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:55:56,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {10074#(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; {10070#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:55:56,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {9923#true} ~z~0 := ~y~0; {10074#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:55:56,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {9923#true} assume !(~x~0 % 4294967296 > 0); {9923#true} is VALID [2022-04-07 11:55:56,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {9923#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9923#true} is VALID [2022-04-07 11:55:56,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {9923#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9923#true} is VALID [2022-04-07 11:55:56,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {9923#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9923#true} is VALID [2022-04-07 11:55:56,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {9923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9923#true} is VALID [2022-04-07 11:55:56,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {9923#true} call #t~ret13 := main(); {9923#true} is VALID [2022-04-07 11:55:56,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9923#true} {9923#true} #72#return; {9923#true} is VALID [2022-04-07 11:55:56,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {9923#true} assume true; {9923#true} is VALID [2022-04-07 11:55:56,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {9923#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9923#true} is VALID [2022-04-07 11:55:56,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {9923#true} call ULTIMATE.init(); {9923#true} is VALID [2022-04-07 11:55:56,504 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-07 11:55:56,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229208377] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:55:56,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:55:56,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-07 11:55:56,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344241595] [2022-04-07 11:55:56,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:55:56,504 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-07 11:55:56,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:55:56,505 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-07 11:55:56,537 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-07 11:55:56,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-07 11:55:56,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:55:56,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-07 11:55:56,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-07 11:55:56,538 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-07 11:55:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:58,175 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2022-04-07 11:55:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-07 11:55:58,175 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-07 11:55:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:55:58,175 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-07 11:55:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 90 transitions. [2022-04-07 11:55:58,176 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-07 11:55:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 90 transitions. [2022-04-07 11:55:58,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 90 transitions. [2022-04-07 11:55:58,279 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-07 11:55:58,280 INFO L225 Difference]: With dead ends: 162 [2022-04-07 11:55:58,280 INFO L226 Difference]: Without dead ends: 136 [2022-04-07 11:55:58,281 INFO L912 BasicCegarLoop]: 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-07 11:55:58,281 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 126 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 11:55:58,281 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 93 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 11:55:58,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-07 11:55:58,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2022-04-07 11:55:58,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:55:58,606 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-07 11:55:58,606 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-07 11:55:58,606 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-07 11:55:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:58,607 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2022-04-07 11:55:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2022-04-07 11:55:58,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:58,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:58,608 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-07 11:55:58,608 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-07 11:55:58,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:58,609 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2022-04-07 11:55:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2022-04-07 11:55:58,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:58,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:58,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:55:58,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:55:58,610 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-07 11:55:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 142 transitions. [2022-04-07 11:55:58,611 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 142 transitions. Word has length 27 [2022-04-07 11:55:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:55:58,611 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 142 transitions. [2022-04-07 11:55:58,611 INFO L479 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-07 11:55:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 142 transitions. [2022-04-07 11:55:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 11:55:58,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:55:58,612 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:55:58,632 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-07 11:55:58,832 WARN L460 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-07 11:55:58,832 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:55:58,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:55:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash -734568360, now seen corresponding path program 7 times [2022-04-07 11:55:58,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:55:58,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980325963] [2022-04-07 11:55:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:55:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:55:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:55:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:58,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {10830#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10817#true} is VALID [2022-04-07 11:55:58,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {10817#true} assume true; {10817#true} is VALID [2022-04-07 11:55:58,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10817#true} {10817#true} #72#return; {10817#true} is VALID [2022-04-07 11:55:58,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {10817#true} call ULTIMATE.init(); {10830#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:55:58,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {10830#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10817#true} is VALID [2022-04-07 11:55:58,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {10817#true} assume true; {10817#true} is VALID [2022-04-07 11:55:58,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10817#true} {10817#true} #72#return; {10817#true} is VALID [2022-04-07 11:55:58,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {10817#true} call #t~ret13 := main(); {10817#true} is VALID [2022-04-07 11:55:58,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {10817#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10817#true} is VALID [2022-04-07 11:55:58,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {10817#true} assume !!(~x~0 % 4294967296 > 0);#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 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:58,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {10822#(<= 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; {10823#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-07 11:55:58,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {10823#(<= 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; {10824#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:58,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {10824#(<= 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; {10825#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-07 11:55:58,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {10825#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10825#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-07 11:55:58,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {10825#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {10825#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-07 11:55:58,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {10825#(<= (* (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; {10826#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-07 11:55:58,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {10826#(<= (+ (* 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; {10827#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-07 11:55:58,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {10827#(<= (+ 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; {10828#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-07 11:55:58,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {10828#(<= (+ 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; {10829#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:58,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {10829#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {10829#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:58,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {10829#(<= (+ 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; {10829#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:58,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {10829#(<= (+ 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; {10829#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:58,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {10829#(<= (+ 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; {10829#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:58,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {10829#(<= (+ 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; {10829#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:58,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {10829#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {10829#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:55:58,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {10829#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10818#false} is VALID [2022-04-07 11:55:58,967 INFO L272 TraceCheckUtils]: 23: Hoare triple {10818#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10818#false} is VALID [2022-04-07 11:55:58,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {10818#false} ~cond := #in~cond; {10818#false} is VALID [2022-04-07 11:55:58,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {10818#false} assume 0 == ~cond; {10818#false} is VALID [2022-04-07 11:55:58,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {10818#false} assume !false; {10818#false} is VALID [2022-04-07 11:55:58,968 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-07 11:55:58,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:55:58,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980325963] [2022-04-07 11:55:58,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980325963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:55:58,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076362685] [2022-04-07 11:55:58,968 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 11:55:58,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:55:58,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:55:58,969 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-07 11:55:58,969 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-07 11:55:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:59,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 11:55:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:59,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:55:59,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {10817#true} call ULTIMATE.init(); {10817#true} is VALID [2022-04-07 11:55:59,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {10817#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10817#true} is VALID [2022-04-07 11:55:59,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {10817#true} assume true; {10817#true} is VALID [2022-04-07 11:55:59,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10817#true} {10817#true} #72#return; {10817#true} is VALID [2022-04-07 11:55:59,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {10817#true} call #t~ret13 := main(); {10817#true} is VALID [2022-04-07 11:55:59,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {10817#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10817#true} is VALID [2022-04-07 11:55:59,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {10817#true} assume !!(~x~0 % 4294967296 > 0);#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 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:59,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {10822#(<= 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; {10855#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-07 11:55:59,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {10855#(<= 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; {10859#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {10859#(<= 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; {10863#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-07 11:55:59,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {10863#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {10863#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-07 11:55:59,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {10863#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {10863#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-07 11:55:59,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {10863#(<= 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; {10859#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {10859#(<= 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; {10855#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-07 11:55:59,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {10855#(<= 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; {10822#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:59,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {10822#(<= 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; {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {10882#(<= 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; {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {10882#(<= 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; {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {10882#(<= 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; {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {10882#(<= 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; {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10818#false} is VALID [2022-04-07 11:55:59,288 INFO L272 TraceCheckUtils]: 23: Hoare triple {10818#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10818#false} is VALID [2022-04-07 11:55:59,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {10818#false} ~cond := #in~cond; {10818#false} is VALID [2022-04-07 11:55:59,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {10818#false} assume 0 == ~cond; {10818#false} is VALID [2022-04-07 11:55:59,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {10818#false} assume !false; {10818#false} is VALID [2022-04-07 11:55:59,289 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-07 11:55:59,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:55:59,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {10818#false} assume !false; {10818#false} is VALID [2022-04-07 11:55:59,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {10818#false} assume 0 == ~cond; {10818#false} is VALID [2022-04-07 11:55:59,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {10818#false} ~cond := #in~cond; {10818#false} is VALID [2022-04-07 11:55:59,409 INFO L272 TraceCheckUtils]: 23: Hoare triple {10818#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10818#false} is VALID [2022-04-07 11:55:59,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10818#false} is VALID [2022-04-07 11:55:59,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {10882#(<= 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; {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {10882#(<= 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; {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {10882#(<= 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; {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {10882#(<= 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; {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {10822#(<= 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; {10882#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {10855#(<= 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; {10822#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:59,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {10859#(<= 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; {10855#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-07 11:55:59,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {10863#(<= 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; {10859#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {10863#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} ~z~0 := ~y~0; {10863#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-07 11:55:59,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {10863#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !(~x~0 % 4294967296 > 0); {10863#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-07 11:55:59,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {10859#(<= 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; {10863#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-07 11:55:59,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {10855#(<= 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; {10859#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 11:55:59,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {10822#(<= 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; {10855#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-07 11:55:59,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {10817#true} assume !!(~x~0 % 4294967296 > 0);#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 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:55:59,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {10817#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10817#true} is VALID [2022-04-07 11:55:59,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {10817#true} call #t~ret13 := main(); {10817#true} is VALID [2022-04-07 11:55:59,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10817#true} {10817#true} #72#return; {10817#true} is VALID [2022-04-07 11:55:59,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {10817#true} assume true; {10817#true} is VALID [2022-04-07 11:55:59,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {10817#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10817#true} is VALID [2022-04-07 11:55:59,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {10817#true} call ULTIMATE.init(); {10817#true} is VALID [2022-04-07 11:55:59,418 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-07 11:55:59,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076362685] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:55:59,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:55:59,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 15 [2022-04-07 11:55:59,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572142878] [2022-04-07 11:55:59,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:55:59,420 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-07 11:55:59,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:55:59,420 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-07 11:55:59,452 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-07 11:55:59,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 11:55:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:55:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 11:55:59,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-07 11:55:59,452 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-07 11:56:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:00,320 INFO L93 Difference]: Finished difference Result 140 states and 188 transitions. [2022-04-07 11:56:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 11:56:00,321 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-07 11:56:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:56:00,321 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-07 11:56:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-07 11:56:00,321 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-07 11:56:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-07 11:56:00,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2022-04-07 11:56:00,378 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-07 11:56:00,379 INFO L225 Difference]: With dead ends: 140 [2022-04-07 11:56:00,379 INFO L226 Difference]: Without dead ends: 135 [2022-04-07 11:56:00,380 INFO L912 BasicCegarLoop]: 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-07 11:56:00,380 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:56:00,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 70 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 11:56:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-07 11:56:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2022-04-07 11:56:00,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:56:00,710 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-07 11:56:00,711 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-07 11:56:00,711 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-07 11:56:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:00,712 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2022-04-07 11:56:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2022-04-07 11:56:00,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:56:00,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:56:00,713 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-07 11:56:00,713 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-07 11:56:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:00,717 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2022-04-07 11:56:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2022-04-07 11:56:00,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:56:00,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:56:00,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:56:00,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:56:00,718 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-07 11:56:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 168 transitions. [2022-04-07 11:56:00,719 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 168 transitions. Word has length 27 [2022-04-07 11:56:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:56:00,719 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 168 transitions. [2022-04-07 11:56:00,720 INFO L479 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-07 11:56:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2022-04-07 11:56:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 11:56:00,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:56:00,720 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:56:00,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-07 11:56:00,935 WARN L460 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-07 11:56:00,935 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:56:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:56:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2010729856, now seen corresponding path program 8 times [2022-04-07 11:56:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:56:00,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434674593] [2022-04-07 11:56:00,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:56:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:56:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:01,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:56:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:01,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {11680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11665#true} is VALID [2022-04-07 11:56:01,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {11665#true} assume true; {11665#true} is VALID [2022-04-07 11:56:01,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11665#true} {11665#true} #72#return; {11665#true} is VALID [2022-04-07 11:56:01,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {11665#true} call ULTIMATE.init(); {11680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:56:01,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {11680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11665#true} is VALID [2022-04-07 11:56:01,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {11665#true} assume true; {11665#true} is VALID [2022-04-07 11:56:01,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11665#true} {11665#true} #72#return; {11665#true} is VALID [2022-04-07 11:56:01,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {11665#true} call #t~ret13 := main(); {11665#true} is VALID [2022-04-07 11:56:01,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {11665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11670#(= main_~y~0 0)} is VALID [2022-04-07 11:56:01,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {11670#(= 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; {11671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:56:01,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {11671#(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; {11672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:56:01,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {11672#(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; {11673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:56:01,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {11673#(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; {11674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:01,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {11674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:01,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {11674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {11675#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:56:01,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {11675#(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; {11676#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:56:01,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {11676#(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; {11677#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:56:01,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {11677#(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; {11678#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:56:01,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {11678#(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; {11679#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:56:01,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {11679#(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; {11666#false} is VALID [2022-04-07 11:56:01,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {11666#false} assume !(~z~0 % 4294967296 > 0); {11666#false} is VALID [2022-04-07 11:56:01,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {11666#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; {11666#false} is VALID [2022-04-07 11:56:01,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {11666#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; {11666#false} is VALID [2022-04-07 11:56:01,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {11666#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; {11666#false} is VALID [2022-04-07 11:56:01,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {11666#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; {11666#false} is VALID [2022-04-07 11:56:01,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {11666#false} assume !(~y~0 % 4294967296 > 0); {11666#false} is VALID [2022-04-07 11:56:01,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {11666#false} assume !(~x~0 % 4294967296 > 0); {11666#false} is VALID [2022-04-07 11:56:01,091 INFO L272 TraceCheckUtils]: 24: Hoare triple {11666#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11666#false} is VALID [2022-04-07 11:56:01,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {11666#false} ~cond := #in~cond; {11666#false} is VALID [2022-04-07 11:56:01,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {11666#false} assume 0 == ~cond; {11666#false} is VALID [2022-04-07 11:56:01,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {11666#false} assume !false; {11666#false} is VALID [2022-04-07 11:56:01,091 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-07 11:56:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:56:01,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434674593] [2022-04-07 11:56:01,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434674593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:56:01,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146941481] [2022-04-07 11:56:01,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:56:01,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:56:01,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:56:01,092 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-07 11:56:01,093 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-07 11:56:01,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:56:01,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:56:01,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-07 11:56:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:01,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:56:01,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {11665#true} call ULTIMATE.init(); {11665#true} is VALID [2022-04-07 11:56:01,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {11665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11665#true} is VALID [2022-04-07 11:56:01,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {11665#true} assume true; {11665#true} is VALID [2022-04-07 11:56:01,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11665#true} {11665#true} #72#return; {11665#true} is VALID [2022-04-07 11:56:01,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {11665#true} call #t~ret13 := main(); {11665#true} is VALID [2022-04-07 11:56:01,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {11665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11670#(= main_~y~0 0)} is VALID [2022-04-07 11:56:01,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {11670#(= 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; {11671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:56:01,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {11671#(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; {11672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:56:01,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {11672#(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; {11673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:56:01,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {11673#(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; {11674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:01,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {11674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:01,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {11674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {11717#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:01,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {11717#(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; {11721#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-07 11:56:01,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {11721#(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; {11725#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:01,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {11725#(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; {11729#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-07 11:56:01,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {11729#(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; {11733#(and (<= main_~y~0 4) (= main_~y~0 (+ main_~z~0 4)) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {11733#(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; {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {11666#false} assume !(~z~0 % 4294967296 > 0); {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {11666#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; {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {11666#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; {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {11666#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; {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {11666#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; {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {11666#false} assume !(~y~0 % 4294967296 > 0); {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {11666#false} assume !(~x~0 % 4294967296 > 0); {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L272 TraceCheckUtils]: 24: Hoare triple {11666#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {11666#false} ~cond := #in~cond; {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {11666#false} assume 0 == ~cond; {11666#false} is VALID [2022-04-07 11:56:01,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {11666#false} assume !false; {11666#false} is VALID [2022-04-07 11:56:01,311 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-07 11:56:01,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:56:01,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {11666#false} assume !false; {11666#false} is VALID [2022-04-07 11:56:01,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {11666#false} assume 0 == ~cond; {11666#false} is VALID [2022-04-07 11:56:01,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {11666#false} ~cond := #in~cond; {11666#false} is VALID [2022-04-07 11:56:01,556 INFO L272 TraceCheckUtils]: 24: Hoare triple {11666#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11666#false} is VALID [2022-04-07 11:56:01,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {11666#false} assume !(~x~0 % 4294967296 > 0); {11666#false} is VALID [2022-04-07 11:56:01,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {11785#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {11666#false} is VALID [2022-04-07 11:56:01,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {11789#(< 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; {11785#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:56:01,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {11793#(< 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; {11789#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:56:01,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {11797#(< 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; {11793#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:56:01,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {11801#(< 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; {11797#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:56:01,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {11801#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11801#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-07 11:56:01,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {11808#(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; {11801#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-07 11:56:01,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {11812#(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; {11808#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-07 11:56:01,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {11816#(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; {11812#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-07 11:56:01,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {11820#(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; {11816#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-07 11:56:01,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {11824#(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; {11820#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-07 11:56:01,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {11665#true} ~z~0 := ~y~0; {11824#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-07 11:56:01,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {11665#true} assume !(~x~0 % 4294967296 > 0); {11665#true} is VALID [2022-04-07 11:56:01,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {11665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11665#true} is VALID [2022-04-07 11:56:01,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {11665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11665#true} is VALID [2022-04-07 11:56:01,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {11665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11665#true} is VALID [2022-04-07 11:56:01,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {11665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11665#true} is VALID [2022-04-07 11:56:01,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {11665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11665#true} is VALID [2022-04-07 11:56:01,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {11665#true} call #t~ret13 := main(); {11665#true} is VALID [2022-04-07 11:56:01,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11665#true} {11665#true} #72#return; {11665#true} is VALID [2022-04-07 11:56:01,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {11665#true} assume true; {11665#true} is VALID [2022-04-07 11:56:01,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {11665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11665#true} is VALID [2022-04-07 11:56:01,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {11665#true} call ULTIMATE.init(); {11665#true} is VALID [2022-04-07 11:56:01,565 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-07 11:56:01,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146941481] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:56:01,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:56:01,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-04-07 11:56:01,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266166205] [2022-04-07 11:56:01,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:56:01,566 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-07 11:56:01,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:56:01,566 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-07 11:56:01,613 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-07 11:56:01,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-07 11:56:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:56:01,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-07 11:56:01,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-04-07 11:56:01,614 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-07 11:56:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:05,358 INFO L93 Difference]: Finished difference Result 247 states and 315 transitions. [2022-04-07 11:56:05,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-07 11:56:05,359 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-07 11:56:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:56:05,359 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-07 11:56:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 143 transitions. [2022-04-07 11:56:05,360 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-07 11:56:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 143 transitions. [2022-04-07 11:56:05,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 143 transitions. [2022-04-07 11:56:05,550 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-07 11:56:05,553 INFO L225 Difference]: With dead ends: 247 [2022-04-07 11:56:05,553 INFO L226 Difference]: Without dead ends: 219 [2022-04-07 11:56:05,554 INFO L912 BasicCegarLoop]: 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-07 11:56:05,554 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 222 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:56:05,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 71 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-07 11:56:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-07 11:56:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 144. [2022-04-07 11:56:05,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:56:05,978 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-07 11:56:05,978 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-07 11:56:05,978 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-07 11:56:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:05,981 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2022-04-07 11:56:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2022-04-07 11:56:05,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:56:05,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:56:05,981 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-07 11:56:05,981 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-07 11:56:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:05,984 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2022-04-07 11:56:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2022-04-07 11:56:05,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:56:05,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:56:05,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:56:05,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:56:05,984 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-07 11:56:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2022-04-07 11:56:05,986 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 28 [2022-04-07 11:56:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:56:05,986 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2022-04-07 11:56:05,986 INFO L479 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-07 11:56:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2022-04-07 11:56:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 11:56:05,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:56:05,986 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:56:06,002 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-07 11:56:06,201 WARN L460 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-07 11:56:06,201 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:56:06,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:56:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1472968031, now seen corresponding path program 3 times [2022-04-07 11:56:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:56:06,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490590237] [2022-04-07 11:56:06,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:56:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:56:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:06,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:56:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:06,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {12950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12930#true} is VALID [2022-04-07 11:56:06,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {12930#true} assume true; {12930#true} is VALID [2022-04-07 11:56:06,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12930#true} {12930#true} #72#return; {12930#true} is VALID [2022-04-07 11:56:06,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {12930#true} call ULTIMATE.init(); {12950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:56:06,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {12950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12930#true} is VALID [2022-04-07 11:56:06,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {12930#true} assume true; {12930#true} is VALID [2022-04-07 11:56:06,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12930#true} {12930#true} #72#return; {12930#true} is VALID [2022-04-07 11:56:06,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {12930#true} call #t~ret13 := main(); {12930#true} is VALID [2022-04-07 11:56:06,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {12930#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12935#(= main_~y~0 0)} is VALID [2022-04-07 11:56:06,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {12935#(= 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; {12936#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:56:06,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {12936#(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; {12937#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:56:06,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {12937#(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; {12938#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:56:06,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {12938#(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; {12939#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:06,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {12939#(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; {12940#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:56:06,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {12940#(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; {12941#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:56:06,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {12941#(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; {12942#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:56:06,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {12942#(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; {12943#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 11:56:06,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {12943#(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; {12944#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:56:06,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {12944#(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; {12945#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-07 11:56:06,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {12945#(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; {12946#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-07 11:56:06,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {12946#(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; {12947#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 11:56:06,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {12947#(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; {12948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-07 11:56:06,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {12948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-07 11:56:06,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {12948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {12949#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-07 11:56:06,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {12949#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12931#false} is VALID [2022-04-07 11:56:06,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {12931#false} assume !(~y~0 % 4294967296 > 0); {12931#false} is VALID [2022-04-07 11:56:06,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {12931#false} assume !(~x~0 % 4294967296 > 0); {12931#false} is VALID [2022-04-07 11:56:06,437 INFO L272 TraceCheckUtils]: 24: Hoare triple {12931#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12931#false} is VALID [2022-04-07 11:56:06,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {12931#false} ~cond := #in~cond; {12931#false} is VALID [2022-04-07 11:56:06,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {12931#false} assume 0 == ~cond; {12931#false} is VALID [2022-04-07 11:56:06,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {12931#false} assume !false; {12931#false} is VALID [2022-04-07 11:56:06,437 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-07 11:56:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:56:06,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490590237] [2022-04-07 11:56:06,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490590237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:56:06,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477309682] [2022-04-07 11:56:06,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 11:56:06,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:56:06,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:56:06,439 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-07 11:56:06,467 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-07 11:56:06,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-07 11:56:06,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:56:06,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-07 11:56:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:06,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:56:06,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {12930#true} call ULTIMATE.init(); {12930#true} is VALID [2022-04-07 11:56:06,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {12930#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12930#true} is VALID [2022-04-07 11:56:06,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {12930#true} assume true; {12930#true} is VALID [2022-04-07 11:56:06,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12930#true} {12930#true} #72#return; {12930#true} is VALID [2022-04-07 11:56:06,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {12930#true} call #t~ret13 := main(); {12930#true} is VALID [2022-04-07 11:56:06,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {12930#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12935#(= main_~y~0 0)} is VALID [2022-04-07 11:56:06,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {12935#(= 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; {12936#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:56:06,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {12936#(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; {12937#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:56:06,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {12937#(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; {12938#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:56:06,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {12938#(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; {12939#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:06,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {12939#(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; {12940#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:56:06,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {12940#(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; {12941#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:56:06,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {12941#(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; {12942#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:56:06,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {12942#(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; {12943#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 11:56:06,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {12943#(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; {12944#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:56:06,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {12944#(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; {12945#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-07 11:56:06,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {12945#(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; {12946#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-07 11:56:06,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {12946#(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; {12947#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 11:56:06,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {12947#(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; {12948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-07 11:56:06,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {12948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-07 11:56:06,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {12948#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {13014#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-07 11:56:06,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {13014#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {12931#false} is VALID [2022-04-07 11:56:06,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {12931#false} assume !(~y~0 % 4294967296 > 0); {12931#false} is VALID [2022-04-07 11:56:06,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {12931#false} assume !(~x~0 % 4294967296 > 0); {12931#false} is VALID [2022-04-07 11:56:06,848 INFO L272 TraceCheckUtils]: 24: Hoare triple {12931#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12931#false} is VALID [2022-04-07 11:56:06,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {12931#false} ~cond := #in~cond; {12931#false} is VALID [2022-04-07 11:56:06,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {12931#false} assume 0 == ~cond; {12931#false} is VALID [2022-04-07 11:56:06,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {12931#false} assume !false; {12931#false} is VALID [2022-04-07 11:56:06,848 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-07 11:56:06,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:56:07,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {12931#false} assume !false; {12931#false} is VALID [2022-04-07 11:56:07,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {12931#false} assume 0 == ~cond; {12931#false} is VALID [2022-04-07 11:56:07,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {12931#false} ~cond := #in~cond; {12931#false} is VALID [2022-04-07 11:56:07,226 INFO L272 TraceCheckUtils]: 24: Hoare triple {12931#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12931#false} is VALID [2022-04-07 11:56:07,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {12931#false} assume !(~x~0 % 4294967296 > 0); {12931#false} is VALID [2022-04-07 11:56:07,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {12931#false} assume !(~y~0 % 4294967296 > 0); {12931#false} is VALID [2022-04-07 11:56:07,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {13054#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12931#false} is VALID [2022-04-07 11:56:07,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {13058#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {13054#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:56:07,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {13058#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {13058#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:56:07,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {13065#(< 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; {13058#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:56:07,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {13069#(< 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; {13065#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:56:07,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {13073#(< 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; {13069#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 11:56:07,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {13077#(< 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; {13073#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-07 11:56:07,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {13081#(< 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; {13077#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-07 11:56:07,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {13085#(< 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; {13081#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-07 11:56:07,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {13089#(< 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; {13085#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-07 11:56:07,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {13093#(< 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; {13089#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-07 11:56:07,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {13097#(< 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; {13093#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-07 11:56:07,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {13101#(< 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; {13097#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-07 11:56:07,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {13105#(< 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; {13101#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-07 11:56:07,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {13109#(< 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; {13105#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-07 11:56:07,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {13113#(< 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; {13109#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-07 11:56:07,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {12930#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13113#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-07 11:56:07,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {12930#true} call #t~ret13 := main(); {12930#true} is VALID [2022-04-07 11:56:07,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12930#true} {12930#true} #72#return; {12930#true} is VALID [2022-04-07 11:56:07,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {12930#true} assume true; {12930#true} is VALID [2022-04-07 11:56:07,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {12930#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12930#true} is VALID [2022-04-07 11:56:07,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {12930#true} call ULTIMATE.init(); {12930#true} is VALID [2022-04-07 11:56:07,237 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-07 11:56:07,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477309682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:56:07,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:56:07,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-07 11:56:07,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615624872] [2022-04-07 11:56:07,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:56:07,237 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-07 11:56:07,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:56:07,238 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-07 11:56:07,268 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-07 11:56:07,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-07 11:56:07,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:56:07,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-07 11:56:07,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-07 11:56:07,269 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-07 11:56:18,192 WARN L232 SmtUtils]: Spent 6.35s 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-07 11:56:35,340 WARN L232 SmtUtils]: Spent 7.93s 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-07 11:57:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:57:24,766 INFO L93 Difference]: Finished difference Result 766 states and 1080 transitions. [2022-04-07 11:57:24,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-07 11:57:24,766 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-07 11:57:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:57:24,767 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-07 11:57:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 359 transitions. [2022-04-07 11:57:24,769 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-07 11:57:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 359 transitions. [2022-04-07 11:57:24,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 359 transitions. [2022-04-07 11:57:25,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:57:25,809 INFO L225 Difference]: With dead ends: 766 [2022-04-07 11:57:25,809 INFO L226 Difference]: Without dead ends: 725 [2022-04-07 11:57:25,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2678 ImplicationChecksByTransitivity, 67.7s TimeCoverageRelationStatistics Valid=2537, Invalid=7363, Unknown=0, NotChecked=0, Total=9900 [2022-04-07 11:57:25,812 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 1114 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 927 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 2722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 927 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:57:25,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1114 Valid, 139 Invalid, 2722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [927 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-07 11:57:25,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-04-07 11:57:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 206. [2022-04-07 11:57:26,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:57:26,536 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-07 11:57:26,536 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-07 11:57:26,537 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-07 11:57:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:57:26,550 INFO L93 Difference]: Finished difference Result 725 states and 934 transitions. [2022-04-07 11:57:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 934 transitions. [2022-04-07 11:57:26,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:57:26,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:57:26,551 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-07 11:57:26,551 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-07 11:57:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:57:26,565 INFO L93 Difference]: Finished difference Result 725 states and 934 transitions. [2022-04-07 11:57:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 934 transitions. [2022-04-07 11:57:26,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:57:26,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:57:26,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:57:26,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:57:26,566 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-07 11:57:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 278 transitions. [2022-04-07 11:57:26,569 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 278 transitions. Word has length 28 [2022-04-07 11:57:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:57:26,569 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 278 transitions. [2022-04-07 11:57:26,569 INFO L479 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-07 11:57:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 278 transitions. [2022-04-07 11:57:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 11:57:26,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:57:26,569 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:57:26,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-07 11:57:26,773 WARN L460 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-07 11:57:26,773 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:57:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:57:26,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1541621168, now seen corresponding path program 9 times [2022-04-07 11:57:26,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:57:26,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644332535] [2022-04-07 11:57:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:57:26,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:57:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:57:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:57:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:57:26,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {16024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16009#true} is VALID [2022-04-07 11:57:26,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {16009#true} assume true; {16009#true} is VALID [2022-04-07 11:57:26,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16009#true} {16009#true} #72#return; {16009#true} is VALID [2022-04-07 11:57:26,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {16009#true} call ULTIMATE.init(); {16024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:57:26,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {16024#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16009#true} is VALID [2022-04-07 11:57:26,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {16009#true} assume true; {16009#true} is VALID [2022-04-07 11:57:26,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16009#true} {16009#true} #72#return; {16009#true} is VALID [2022-04-07 11:57:26,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {16009#true} call #t~ret13 := main(); {16009#true} is VALID [2022-04-07 11:57:26,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {16009#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16009#true} is VALID [2022-04-07 11:57:26,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {16009#true} assume !!(~x~0 % 4294967296 > 0);#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 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:57:26,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {16014#(<= 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; {16015#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-07 11:57:26,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {16015#(<= 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; {16016#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:57:26,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {16016#(<= 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; {16017#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 11:57:26,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {16017#(<= 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; {16018#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-07 11:57:26,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {16018#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {16018#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-07 11:57:26,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {16018#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {16018#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-07 11:57:26,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {16018#(<= (* (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; {16019#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-07 11:57:26,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {16019#(<= (+ (* (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; {16020#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-07 11:57:26,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {16020#(<= (+ (* 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; {16021#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-07 11:57:26,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {16021#(<= (+ 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; {16022#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-07 11:57:26,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {16022#(<= (+ (* (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; {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:57:26,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:57:26,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {16023#(<= (+ 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; {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:57:26,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {16023#(<= (+ 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; {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:57:26,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {16023#(<= (+ 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; {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:57:26,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {16023#(<= (+ 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; {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:57:26,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {16023#(<= (+ 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; {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:57:26,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 11:57:26,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {16023#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {16010#false} is VALID [2022-04-07 11:57:26,950 INFO L272 TraceCheckUtils]: 26: Hoare triple {16010#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16010#false} is VALID [2022-04-07 11:57:26,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {16010#false} ~cond := #in~cond; {16010#false} is VALID [2022-04-07 11:57:26,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {16010#false} assume 0 == ~cond; {16010#false} is VALID [2022-04-07 11:57:26,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {16010#false} assume !false; {16010#false} is VALID [2022-04-07 11:57:26,951 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-07 11:57:26,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:57:26,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644332535] [2022-04-07 11:57:26,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644332535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:57:26,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671407778] [2022-04-07 11:57:26,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 11:57:26,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:57:26,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:57:26,955 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-07 11:57:26,959 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-07 11:57:27,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 11:57:27,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:57:27,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-07 11:57:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:57:27,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:57:27,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {16009#true} call ULTIMATE.init(); {16009#true} is VALID [2022-04-07 11:57:27,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {16009#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16009#true} is VALID [2022-04-07 11:57:27,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {16009#true} assume true; {16009#true} is VALID [2022-04-07 11:57:27,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16009#true} {16009#true} #72#return; {16009#true} is VALID [2022-04-07 11:57:27,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {16009#true} call #t~ret13 := main(); {16009#true} is VALID [2022-04-07 11:57:27,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {16009#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16043#(= main_~n~0 main_~x~0)} is VALID [2022-04-07 11:57:27,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {16043#(= 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; {16047#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-07 11:57:27,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {16047#(= (+ 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; {16051#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-07 11:57:27,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {16051#(= (+ 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; {16055#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-07 11:57:27,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {16055#(= (+ (- 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; {16059#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-07 11:57:27,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {16059#(= (+ 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; {16063#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:57:27,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {16063#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} assume !(~x~0 % 4294967296 > 0); {16063#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:57:27,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {16063#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} ~z~0 := ~y~0; {16063#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:57:27,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {16063#(= (+ 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; {16059#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-07 11:57:27,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {16059#(= (+ 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; {16055#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-07 11:57:27,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {16055#(= (+ (- 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; {16051#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-07 11:57:27,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {16051#(= (+ 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; {16047#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-07 11:57:27,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {16047#(= (+ 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; {16043#(= main_~n~0 main_~x~0)} is VALID [2022-04-07 11:57:27,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {16043#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {16043#(= main_~n~0 main_~x~0)} is VALID [2022-04-07 11:57:27,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {16043#(= 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; {16043#(= main_~n~0 main_~x~0)} is VALID [2022-04-07 11:57:27,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {16043#(= 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; {16043#(= main_~n~0 main_~x~0)} is VALID [2022-04-07 11:57:27,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {16043#(= 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; {16043#(= main_~n~0 main_~x~0)} is VALID [2022-04-07 11:57:27,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {16043#(= 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; {16043#(= main_~n~0 main_~x~0)} is VALID [2022-04-07 11:57:27,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {16043#(= 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; {16043#(= main_~n~0 main_~x~0)} is VALID [2022-04-07 11:57:27,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {16043#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {16106#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-07 11:57:27,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {16106#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {16110#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-07 11:57:27,591 INFO L272 TraceCheckUtils]: 26: Hoare triple {16110#(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)); {16114#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:57:27,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {16114#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16118#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:57:27,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {16118#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16010#false} is VALID [2022-04-07 11:57:27,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {16010#false} assume !false; {16010#false} is VALID [2022-04-07 11:57:27,592 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-07 11:57:27,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:57:28,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {16010#false} assume !false; {16010#false} is VALID [2022-04-07 11:57:28,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {16118#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16010#false} is VALID [2022-04-07 11:57:28,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {16114#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16118#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:57:28,123 INFO L272 TraceCheckUtils]: 26: Hoare triple {16134#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16114#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:57:28,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {16138#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16134#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:57:28,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {16142#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16138#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:57:28,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {16142#(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; {16142#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 11:57:28,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {16142#(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; {16142#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 11:57:28,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {16142#(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; {16142#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 11:57:28,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {16142#(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; {16142#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 11:57:28,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {16142#(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; {16142#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 11:57:28,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {16142#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16142#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 11:57:28,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {16164#(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; {16142#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 11:57:28,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {16168#(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; {16164#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-07 11:57:28,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {16172#(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; {16168#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-07 11:57:28,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {16176#(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; {16172#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-07 11:57:28,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {16180#(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; {16176#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-07 11:57:28,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {16180#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} ~z~0 := ~y~0; {16180#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-07 11:57:28,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {16180#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {16180#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-07 11:57:28,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {16176#(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; {16180#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-07 11:57:28,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {16172#(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; {16176#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-07 11:57:28,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {16168#(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; {16172#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-07 11:57:28,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {16164#(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; {16168#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-07 11:57:28,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {16142#(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; {16164#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-07 11:57:28,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {16009#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16142#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 11:57:28,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {16009#true} call #t~ret13 := main(); {16009#true} is VALID [2022-04-07 11:57:28,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16009#true} {16009#true} #72#return; {16009#true} is VALID [2022-04-07 11:57:28,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {16009#true} assume true; {16009#true} is VALID [2022-04-07 11:57:28,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {16009#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16009#true} is VALID [2022-04-07 11:57:28,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {16009#true} call ULTIMATE.init(); {16009#true} is VALID [2022-04-07 11:57:28,143 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-07 11:57:28,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671407778] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:57:28,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:57:28,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2022-04-07 11:57:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844846941] [2022-04-07 11:57:28,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:57:28,144 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-07 11:57:28,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:57:28,145 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-07 11:57:28,193 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-07 11:57:28,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-07 11:57:28,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:57:28,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-07 11:57:28,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2022-04-07 11:57:28,194 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-07 11:57:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:57:31,341 INFO L93 Difference]: Finished difference Result 294 states and 395 transitions. [2022-04-07 11:57:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 11:57:31,341 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-07 11:57:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:57:31,341 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-07 11:57:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 119 transitions. [2022-04-07 11:57:31,342 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-07 11:57:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 119 transitions. [2022-04-07 11:57:31,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 119 transitions. [2022-04-07 11:57:31,472 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-07 11:57:31,475 INFO L225 Difference]: With dead ends: 294 [2022-04-07 11:57:31,475 INFO L226 Difference]: Without dead ends: 289 [2022-04-07 11:57:31,476 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=504, Invalid=2918, Unknown=0, NotChecked=0, Total=3422 [2022-04-07 11:57:31,477 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 192 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-07 11:57:31,477 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 96 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-07 11:57:31,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-07 11:57:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 239. [2022-04-07 11:57:32,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:57:32,303 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-07 11:57:32,303 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-07 11:57:32,303 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-07 11:57:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:57:32,306 INFO L93 Difference]: Finished difference Result 289 states and 381 transitions. [2022-04-07 11:57:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 381 transitions. [2022-04-07 11:57:32,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:57:32,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:57:32,307 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-07 11:57:32,307 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-07 11:57:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:57:32,310 INFO L93 Difference]: Finished difference Result 289 states and 381 transitions. [2022-04-07 11:57:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 381 transitions. [2022-04-07 11:57:32,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:57:32,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:57:32,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:57:32,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:57:32,311 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-07 11:57:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 324 transitions. [2022-04-07 11:57:32,314 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 324 transitions. Word has length 30 [2022-04-07 11:57:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:57:32,314 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 324 transitions. [2022-04-07 11:57:32,315 INFO L479 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-07 11:57:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 324 transitions. [2022-04-07 11:57:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 11:57:32,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:57:32,315 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:57:32,334 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-07 11:57:32,527 WARN L460 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-07 11:57:32,528 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:57:32,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:57:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1818120792, now seen corresponding path program 8 times [2022-04-07 11:57:32,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:57:32,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19129781] [2022-04-07 11:57:32,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:57:32,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:57:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:57:32,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:57:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:57:32,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {17646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17627#true} is VALID [2022-04-07 11:57:32,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {17627#true} assume true; {17627#true} is VALID [2022-04-07 11:57:32,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17627#true} {17627#true} #72#return; {17627#true} is VALID [2022-04-07 11:57:32,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {17627#true} call ULTIMATE.init(); {17646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:57:32,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {17646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17627#true} is VALID [2022-04-07 11:57:32,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {17627#true} assume true; {17627#true} is VALID [2022-04-07 11:57:32,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17627#true} {17627#true} #72#return; {17627#true} is VALID [2022-04-07 11:57:32,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {17627#true} call #t~ret13 := main(); {17627#true} is VALID [2022-04-07 11:57:32,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {17627#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17632#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-07 11:57:32,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {17632#(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; {17633#(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-07 11:57:32,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {17633#(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; {17634#(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-07 11:57:32,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {17634#(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; {17635#(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-07 11:57:32,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {17635#(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; {17636#(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-07 11:57:32,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {17636#(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); {17637#(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-07 11:57:32,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {17637#(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; {17637#(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-07 11:57:32,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {17637#(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; {17638#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-07 11:57:32,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {17638#(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; {17638#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-07 11:57:32,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {17638#(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; {17638#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-07 11:57:32,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {17638#(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; {17638#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-07 11:57:32,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {17638#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} assume !(~z~0 % 4294967296 > 0); {17638#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-07 11:57:32,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {17638#(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; {17639#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-07 11:57:32,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {17639#(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; {17640#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-07 11:57:32,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {17640#(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; {17641#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-07 11:57:32,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {17641#(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; {17642#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-07 11:57:32,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {17642#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {17642#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-07 11:57:32,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {17642#(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; {17641#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-07 11:57:32,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {17641#(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; {17640#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-07 11:57:32,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {17640#(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; {17639#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-07 11:57:32,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {17639#(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; {17643#(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-07 11:57:32,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {17643#(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); {17643#(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-07 11:57:32,999 INFO L272 TraceCheckUtils]: 27: Hoare triple {17643#(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)); {17644#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:57:32,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {17644#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17645#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:57:32,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {17645#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17628#false} is VALID [2022-04-07 11:57:33,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {17628#false} assume !false; {17628#false} is VALID [2022-04-07 11:57:33,000 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-07 11:57:33,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:57:33,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19129781] [2022-04-07 11:57:33,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19129781] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:57:33,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003750904] [2022-04-07 11:57:33,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:57:33,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:57:33,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:57:33,001 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-07 11:57:33,002 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-07 11:57:33,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:57:33,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:57:33,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-07 11:57:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:57:33,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:57:37,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {17627#true} call ULTIMATE.init(); {17627#true} is VALID [2022-04-07 11:57:37,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {17627#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17627#true} is VALID [2022-04-07 11:57:37,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {17627#true} assume true; {17627#true} is VALID [2022-04-07 11:57:37,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17627#true} {17627#true} #72#return; {17627#true} is VALID [2022-04-07 11:57:37,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {17627#true} call #t~ret13 := main(); {17627#true} is VALID [2022-04-07 11:57:37,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {17627#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17632#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-07 11:57:37,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {17632#(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; {17633#(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-07 11:57:37,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {17633#(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; {17671#(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-07 11:57:37,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {17671#(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; {17675#(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-07 11:57:37,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {17675#(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; {17679#(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-07 11:57:37,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {17679#(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); {17683#(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-07 11:57:37,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {17683#(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; {17683#(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-07 11:57:37,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {17683#(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; {17690#(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-07 11:57:37,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {17690#(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; {17694#(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-07 11:57:37,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {17694#(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; {17698#(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-07 11:57:37,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {17698#(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; {17702#(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-07 11:57:37,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {17702#(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); {17702#(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-07 11:57:37,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {17702#(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; {17709#(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-07 11:57:37,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {17709#(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; {17713#(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-07 11:57:37,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {17713#(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; {17717#(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-07 11:57:37,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {17717#(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; {17721#(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-07 11:57:37,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {17721#(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); {17721#(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-07 11:57:37,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {17721#(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; {17728#(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-07 11:57:37,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {17728#(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; {17732#(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-07 11:57:37,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {17732#(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; {17736#(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-07 11:57:37,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {17736#(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; {17683#(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-07 11:57:37,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {17683#(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); {17638#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-07 11:57:37,614 INFO L272 TraceCheckUtils]: 27: Hoare triple {17638#(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)); {17746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:57:37,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {17746#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:57:37,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {17750#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17628#false} is VALID [2022-04-07 11:57:37,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {17628#false} assume !false; {17628#false} is VALID [2022-04-07 11:57:37,615 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-07 11:57:37,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:57:41,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {17628#false} assume !false; {17628#false} is VALID [2022-04-07 11:57:41,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {17750#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17628#false} is VALID [2022-04-07 11:57:41,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {17746#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:57:41,307 INFO L272 TraceCheckUtils]: 27: Hoare triple {17766#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:57:41,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {17770#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {17766#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:57:41,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {17774#(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; {17770#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:57:41,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {17778#(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; {17774#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-07 11:57:41,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {17782#(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; {17778#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-07 11:57:41,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {17786#(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; {17782#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:57:41,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {17786#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17786#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 11:57:41,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {17793#(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; {17786#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 11:57:41,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {17797#(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; {17793#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 11:57:41,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {17801#(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; {17797#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 11:57:41,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {17805#(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; {17801#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 11:57:41,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {17805#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17805#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 11:57:41,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {17812#(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; {17805#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 11:57:41,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {17816#(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; {17812#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:57:41,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {17820#(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; {17816#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:57:41,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {17770#(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; {17820#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:57:41,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {17770#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {17770#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:57:41,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {17770#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {17770#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:57:41,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {17774#(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; {17770#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:57:41,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {17778#(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; {17774#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-07 11:57:41,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {17782#(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; {17778#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-07 11:57:41,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {17786#(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; {17782#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:57:41,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {17627#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17786#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 11:57:41,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {17627#true} call #t~ret13 := main(); {17627#true} is VALID [2022-04-07 11:57:41,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17627#true} {17627#true} #72#return; {17627#true} is VALID [2022-04-07 11:57:41,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {17627#true} assume true; {17627#true} is VALID [2022-04-07 11:57:41,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {17627#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17627#true} is VALID [2022-04-07 11:57:41,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {17627#true} call ULTIMATE.init(); {17627#true} is VALID [2022-04-07 11:57:41,330 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-07 11:57:41,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003750904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:57:41,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:57:41,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 17] total 47 [2022-04-07 11:57:41,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652649822] [2022-04-07 11:57:41,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:57:41,330 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-07 11:57:41,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:57:41,331 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-07 11:57:41,475 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-07 11:57:41,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-07 11:57:41,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:57:41,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-07 11:57:41,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1839, Unknown=1, NotChecked=0, Total=2162 [2022-04-07 11:57:41,477 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-07 11:58:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:58:02,365 INFO L93 Difference]: Finished difference Result 349 states and 437 transitions. [2022-04-07 11:58:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-07 11:58:02,365 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-07 11:58:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:58:02,365 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-07 11:58:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 108 transitions. [2022-04-07 11:58:02,366 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-07 11:58:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 108 transitions. [2022-04-07 11:58:02,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 108 transitions. [2022-04-07 11:58:03,725 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-07 11:58:03,729 INFO L225 Difference]: With dead ends: 349 [2022-04-07 11:58:03,729 INFO L226 Difference]: Without dead ends: 323 [2022-04-07 11:58:03,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2203 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1118, Invalid=7251, Unknown=3, NotChecked=0, Total=8372 [2022-04-07 11:58:03,730 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 137 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-07 11:58:03,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 125 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-07 11:58:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-07 11:58:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 237. [2022-04-07 11:58:04,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:58:04,566 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-07 11:58:04,567 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-07 11:58:04,567 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-07 11:58:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:58:04,570 INFO L93 Difference]: Finished difference Result 323 states and 408 transitions. [2022-04-07 11:58:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2022-04-07 11:58:04,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:58:04,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:58:04,571 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-07 11:58:04,571 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-07 11:58:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:58:04,575 INFO L93 Difference]: Finished difference Result 323 states and 408 transitions. [2022-04-07 11:58:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 408 transitions. [2022-04-07 11:58:04,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:58:04,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:58:04,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:58:04,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:58:04,575 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-07 11:58:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 322 transitions. [2022-04-07 11:58:04,578 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 322 transitions. Word has length 31 [2022-04-07 11:58:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:58:04,578 INFO L478 AbstractCegarLoop]: Abstraction has 237 states and 322 transitions. [2022-04-07 11:58:04,578 INFO L479 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-07 11:58:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 322 transitions. [2022-04-07 11:58:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 11:58:04,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:58:04,579 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:58:04,595 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-07 11:58:04,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-07 11:58:04,786 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:58:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:58:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1038157448, now seen corresponding path program 9 times [2022-04-07 11:58:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:58:04,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396948835] [2022-04-07 11:58:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:58:04,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:58:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:58:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:58:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:58:04,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {19433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19418#true} is VALID [2022-04-07 11:58:04,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {19418#true} assume true; {19418#true} is VALID [2022-04-07 11:58:04,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19418#true} {19418#true} #72#return; {19418#true} is VALID [2022-04-07 11:58:04,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {19418#true} call ULTIMATE.init(); {19433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:58:04,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {19433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19418#true} is VALID [2022-04-07 11:58:04,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {19418#true} assume true; {19418#true} is VALID [2022-04-07 11:58:04,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19418#true} {19418#true} #72#return; {19418#true} is VALID [2022-04-07 11:58:04,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {19418#true} call #t~ret13 := main(); {19418#true} is VALID [2022-04-07 11:58:04,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {19418#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19423#(= main_~y~0 0)} is VALID [2022-04-07 11:58:04,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {19423#(= 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; {19424#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:58:04,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {19424#(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; {19425#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:58:04,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {19425#(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; {19426#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:58:04,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {19426#(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; {19427#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:58:04,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {19427#(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; {19428#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:58:04,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {19428#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {19428#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:58:04,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {19428#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {19429#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:58:04,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {19429#(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; {19430#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:58:04,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {19430#(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; {19431#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:58:04,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {19431#(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; {19432#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-07 11:58:04,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {19432#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19419#false} is VALID [2022-04-07 11:58:04,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:04,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:04,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:04,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:04,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:04,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {19419#false} assume !(~y~0 % 4294967296 > 0); {19419#false} is VALID [2022-04-07 11:58:04,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:04,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:04,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:04,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {19419#false} assume !(~x~0 % 4294967296 > 0); {19419#false} is VALID [2022-04-07 11:58:04,945 INFO L272 TraceCheckUtils]: 27: Hoare triple {19419#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19419#false} is VALID [2022-04-07 11:58:04,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {19419#false} ~cond := #in~cond; {19419#false} is VALID [2022-04-07 11:58:04,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {19419#false} assume 0 == ~cond; {19419#false} is VALID [2022-04-07 11:58:04,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {19419#false} assume !false; {19419#false} is VALID [2022-04-07 11:58:04,945 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-07 11:58:04,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:58:04,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396948835] [2022-04-07 11:58:04,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396948835] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:58:04,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56336028] [2022-04-07 11:58:04,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 11:58:04,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:58:04,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:58:04,946 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-07 11:58:04,947 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-07 11:58:05,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 11:58:05,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:58:05,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 11:58:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:58:05,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:58:05,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {19418#true} call ULTIMATE.init(); {19418#true} is VALID [2022-04-07 11:58:05,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {19418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19418#true} is VALID [2022-04-07 11:58:05,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {19418#true} assume true; {19418#true} is VALID [2022-04-07 11:58:05,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19418#true} {19418#true} #72#return; {19418#true} is VALID [2022-04-07 11:58:05,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {19418#true} call #t~ret13 := main(); {19418#true} is VALID [2022-04-07 11:58:05,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {19418#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19423#(= main_~y~0 0)} is VALID [2022-04-07 11:58:05,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {19423#(= 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; {19424#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:58:05,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {19424#(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; {19425#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:58:05,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {19425#(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; {19426#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:58:05,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {19426#(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; {19427#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:58:05,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {19427#(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; {19428#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:58:05,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {19428#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {19428#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:58:05,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {19428#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {19473#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:58:05,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {19473#(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; {19477#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-07 11:58:05,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {19477#(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; {19481#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 11:58:05,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {19481#(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; {19485#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {19485#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {19419#false} assume !(~y~0 % 4294967296 > 0); {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {19419#false} assume !(~x~0 % 4294967296 > 0); {19419#false} is VALID [2022-04-07 11:58:05,214 INFO L272 TraceCheckUtils]: 27: Hoare triple {19419#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19419#false} is VALID [2022-04-07 11:58:05,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {19419#false} ~cond := #in~cond; {19419#false} is VALID [2022-04-07 11:58:05,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {19419#false} assume 0 == ~cond; {19419#false} is VALID [2022-04-07 11:58:05,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {19419#false} assume !false; {19419#false} is VALID [2022-04-07 11:58:05,215 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-07 11:58:05,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:58:05,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {19419#false} assume !false; {19419#false} is VALID [2022-04-07 11:58:05,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {19419#false} assume 0 == ~cond; {19419#false} is VALID [2022-04-07 11:58:05,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {19419#false} ~cond := #in~cond; {19419#false} is VALID [2022-04-07 11:58:05,421 INFO L272 TraceCheckUtils]: 27: Hoare triple {19419#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19419#false} is VALID [2022-04-07 11:58:05,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {19419#false} assume !(~x~0 % 4294967296 > 0); {19419#false} is VALID [2022-04-07 11:58:05,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {19419#false} assume !(~y~0 % 4294967296 > 0); {19419#false} is VALID [2022-04-07 11:58:05,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {19419#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; {19419#false} is VALID [2022-04-07 11:58:05,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {19561#(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; {19419#false} is VALID [2022-04-07 11:58:05,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {19565#(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; {19561#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:58:05,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {19569#(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; {19565#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-07 11:58:05,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {19573#(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; {19569#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-07 11:58:05,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {19577#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19573#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:58:05,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {19581#(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; {19577#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-07 11:58:05,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {19585#(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; {19581#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-07 11:58:05,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {19589#(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; {19585#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-07 11:58:05,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {19418#true} ~z~0 := ~y~0; {19589#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:58:05,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {19418#true} assume !(~x~0 % 4294967296 > 0); {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {19418#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {19418#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {19418#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {19418#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {19418#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {19418#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {19418#true} call #t~ret13 := main(); {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19418#true} {19418#true} #72#return; {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {19418#true} assume true; {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {19418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19418#true} is VALID [2022-04-07 11:58:05,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {19418#true} call ULTIMATE.init(); {19418#true} is VALID [2022-04-07 11:58:05,428 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-07 11:58:05,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56336028] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:58:05,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:58:05,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 25 [2022-04-07 11:58:05,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350360081] [2022-04-07 11:58:05,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:58:05,428 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-07 11:58:05,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:58:05,429 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-07 11:58:05,459 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-07 11:58:05,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-07 11:58:05,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:58:05,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-07 11:58:05,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-07 11:58:05,460 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-07 11:58:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:58:08,947 INFO L93 Difference]: Finished difference Result 365 states and 466 transitions. [2022-04-07 11:58:08,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 11:58:08,948 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-07 11:58:08,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:58:08,948 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-07 11:58:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 111 transitions. [2022-04-07 11:58:08,949 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-07 11:58:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 111 transitions. [2022-04-07 11:58:08,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 111 transitions. [2022-04-07 11:58:09,056 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-07 11:58:09,060 INFO L225 Difference]: With dead ends: 365 [2022-04-07 11:58:09,060 INFO L226 Difference]: Without dead ends: 299 [2022-04-07 11:58:09,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=363, Invalid=2393, Unknown=0, NotChecked=0, Total=2756 [2022-04-07 11:58:09,061 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 53 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-07 11:58:09,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 102 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-07 11:58:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-07 11:58:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 222. [2022-04-07 11:58:09,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:58:09,894 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-07 11:58:09,894 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-07 11:58:09,894 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-07 11:58:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:58:09,898 INFO L93 Difference]: Finished difference Result 299 states and 385 transitions. [2022-04-07 11:58:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 385 transitions. [2022-04-07 11:58:09,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:58:09,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:58:09,898 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-07 11:58:09,898 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-07 11:58:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:58:09,902 INFO L93 Difference]: Finished difference Result 299 states and 385 transitions. [2022-04-07 11:58:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 385 transitions. [2022-04-07 11:58:09,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:58:09,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:58:09,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:58:09,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:58:09,902 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-07 11:58:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 295 transitions. [2022-04-07 11:58:09,905 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 295 transitions. Word has length 31 [2022-04-07 11:58:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:58:09,905 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 295 transitions. [2022-04-07 11:58:09,905 INFO L479 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-07 11:58:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 295 transitions. [2022-04-07 11:58:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 11:58:09,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:58:09,906 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:58:09,922 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-07 11:58:10,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-07 11:58:10,117 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:58:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:58:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1055332463, now seen corresponding path program 10 times [2022-04-07 11:58:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:58:10,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382253466] [2022-04-07 11:58:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:58:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:58:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:58:10,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:58:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:58:10,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {21143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21121#true} is VALID [2022-04-07 11:58:10,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-07 11:58:10,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21121#true} {21121#true} #72#return; {21121#true} is VALID [2022-04-07 11:58:10,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:58:10,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {21143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21121#true} is VALID [2022-04-07 11:58:10,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-07 11:58:10,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #72#return; {21121#true} is VALID [2022-04-07 11:58:10,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret13 := main(); {21121#true} is VALID [2022-04-07 11:58:10,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21126#(= main_~y~0 0)} is VALID [2022-04-07 11:58:10,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {21126#(= 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; {21127#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:58:10,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {21127#(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; {21128#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:58:10,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {21128#(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; {21129#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:58:10,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {21129#(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; {21130#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:58:10,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {21130#(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; {21131#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:58:10,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {21131#(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; {21132#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:58:10,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {21132#(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; {21133#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:58:10,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {21133#(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; {21134#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 11:58:10,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {21134#(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; {21135#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:58:10,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {21135#(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; {21136#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-07 11:58:10,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {21136#(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; {21137#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-07 11:58:10,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {21137#(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; {21138#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 11:58:10,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {21138#(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; {21139#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-07 11:58:10,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {21139#(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; {21140#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-07 11:58:10,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {21140#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {21140#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-07 11:58:10,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {21140#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {21141#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-07 11:58:10,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {21141#(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; {21142#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-07 11:58:10,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {21142#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {21122#false} is VALID [2022-04-07 11:58:10,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {21122#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; {21122#false} is VALID [2022-04-07 11:58:10,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {21122#false} assume !(~y~0 % 4294967296 > 0); {21122#false} is VALID [2022-04-07 11:58:10,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {21122#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; {21122#false} is VALID [2022-04-07 11:58:10,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {21122#false} assume !(~x~0 % 4294967296 > 0); {21122#false} is VALID [2022-04-07 11:58:10,417 INFO L272 TraceCheckUtils]: 28: Hoare triple {21122#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21122#false} is VALID [2022-04-07 11:58:10,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {21122#false} ~cond := #in~cond; {21122#false} is VALID [2022-04-07 11:58:10,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {21122#false} assume 0 == ~cond; {21122#false} is VALID [2022-04-07 11:58:10,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-07 11:58:10,417 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-07 11:58:10,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:58:10,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382253466] [2022-04-07 11:58:10,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382253466] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:58:10,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556165887] [2022-04-07 11:58:10,418 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 11:58:10,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:58:10,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:58:10,419 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-07 11:58:10,420 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-07 11:58:10,454 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 11:58:10,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:58:10,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-07 11:58:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:58:10,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:58:10,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-07 11:58:10,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21121#true} is VALID [2022-04-07 11:58:10,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-07 11:58:10,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #72#return; {21121#true} is VALID [2022-04-07 11:58:10,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret13 := main(); {21121#true} is VALID [2022-04-07 11:58:10,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21126#(= main_~y~0 0)} is VALID [2022-04-07 11:58:10,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {21126#(= 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; {21127#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:58:10,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {21127#(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; {21128#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:58:10,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {21128#(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; {21129#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:58:10,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {21129#(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; {21130#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:58:10,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {21130#(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; {21131#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:58:10,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {21131#(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; {21132#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:58:10,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {21132#(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; {21133#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:58:10,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {21133#(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; {21134#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 11:58:10,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {21134#(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; {21135#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:58:10,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {21135#(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; {21136#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-07 11:58:10,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {21136#(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; {21137#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-07 11:58:10,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {21137#(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; {21138#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 11:58:10,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {21138#(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; {21139#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-07 11:58:10,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {21139#(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; {21140#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-07 11:58:10,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {21140#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {21140#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-07 11:58:10,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {21140#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {21141#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-07 11:58:10,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {21141#(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; {21213#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-07 11:58:10,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {21213#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {21122#false} is VALID [2022-04-07 11:58:10,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {21122#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; {21122#false} is VALID [2022-04-07 11:58:10,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {21122#false} assume !(~y~0 % 4294967296 > 0); {21122#false} is VALID [2022-04-07 11:58:10,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {21122#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; {21122#false} is VALID [2022-04-07 11:58:10,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {21122#false} assume !(~x~0 % 4294967296 > 0); {21122#false} is VALID [2022-04-07 11:58:10,721 INFO L272 TraceCheckUtils]: 28: Hoare triple {21122#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21122#false} is VALID [2022-04-07 11:58:10,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {21122#false} ~cond := #in~cond; {21122#false} is VALID [2022-04-07 11:58:10,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {21122#false} assume 0 == ~cond; {21122#false} is VALID [2022-04-07 11:58:10,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-07 11:58:10,722 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-07 11:58:10,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:58:11,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-07 11:58:11,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {21122#false} assume 0 == ~cond; {21122#false} is VALID [2022-04-07 11:58:11,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {21122#false} ~cond := #in~cond; {21122#false} is VALID [2022-04-07 11:58:11,186 INFO L272 TraceCheckUtils]: 28: Hoare triple {21122#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21122#false} is VALID [2022-04-07 11:58:11,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {21122#false} assume !(~x~0 % 4294967296 > 0); {21122#false} is VALID [2022-04-07 11:58:11,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {21122#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; {21122#false} is VALID [2022-04-07 11:58:11,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {21122#false} assume !(~y~0 % 4294967296 > 0); {21122#false} is VALID [2022-04-07 11:58:11,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {21122#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; {21122#false} is VALID [2022-04-07 11:58:11,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {21265#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21122#false} is VALID [2022-04-07 11:58:11,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {21269#(< 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; {21265#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:58:11,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {21273#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {21269#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:58:11,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {21273#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21273#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:58:11,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {21280#(< 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; {21273#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:58:11,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {21284#(< 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; {21280#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:58:11,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {21288#(< 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; {21284#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:58:11,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {21292#(< 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; {21288#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 11:58:11,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {21296#(< 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; {21292#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-07 11:58:11,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {21300#(< 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; {21296#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-07 11:58:11,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {21304#(< 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; {21300#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-07 11:58:11,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {21308#(< 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; {21304#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-07 11:58:11,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {21312#(< 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; {21308#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-07 11:58:11,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {21316#(< 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; {21312#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-07 11:58:11,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {21320#(< 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; {21316#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-07 11:58:11,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {21324#(< 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; {21320#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-07 11:58:11,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {21328#(< 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; {21324#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-07 11:58:11,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {21332#(< 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; {21328#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-07 11:58:11,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21332#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-07 11:58:11,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret13 := main(); {21121#true} is VALID [2022-04-07 11:58:11,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #72#return; {21121#true} is VALID [2022-04-07 11:58:11,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-07 11:58:11,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21121#true} is VALID [2022-04-07 11:58:11,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-07 11:58:11,197 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-07 11:58:11,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556165887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:58:11,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:58:11,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-07 11:58:11,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002209457] [2022-04-07 11:58:11,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:58:11,198 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-07 11:58:11,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:58:11,198 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-07 11:58:11,230 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-07 11:58:11,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-07 11:58:11,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:58:11,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-07 11:58:11,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-07 11:58:11,231 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-07 11:58:23,625 WARN L232 SmtUtils]: Spent 5.68s 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-07 11:58:31,258 WARN L232 SmtUtils]: Spent 5.49s 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-07 11:58:42,459 WARN L232 SmtUtils]: Spent 6.92s 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-07 11:59:04,649 WARN L232 SmtUtils]: Spent 7.22s 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-07 11:59:15,418 WARN L232 SmtUtils]: Spent 7.74s 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-07 11:59:29,941 WARN L232 SmtUtils]: Spent 6.39s 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-07 11:59:38,360 WARN L232 SmtUtils]: Spent 5.52s 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-07 11:59:56,099 WARN L232 SmtUtils]: Spent 7.37s 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-07 12:00:26,267 WARN L232 SmtUtils]: Spent 5.88s 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-07 12:01:06,263 WARN L232 SmtUtils]: Spent 5.62s 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-07 12:02:14,568 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:02:19,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:02:22,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:02:24,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:02:53,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:02:56,923 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-07 12:02:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:02:57,939 INFO L93 Difference]: Finished difference Result 855 states and 1148 transitions. [2022-04-07 12:02:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-04-07 12:02:57,955 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-07 12:02:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:02:57,955 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-07 12:02:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 465 transitions. [2022-04-07 12:02:57,961 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-07 12:02:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 465 transitions. [2022-04-07 12:02:57,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 465 transitions. [2022-04-07 12:03:09,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 463 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:03:09,115 INFO L225 Difference]: With dead ends: 855 [2022-04-07 12:03:09,115 INFO L226 Difference]: Without dead ends: 817 [2022-04-07 12:03:09,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11651 ImplicationChecksByTransitivity, 225.4s TimeCoverageRelationStatistics Valid=7358, Invalid=23092, Unknown=0, NotChecked=0, Total=30450 [2022-04-07 12:03:09,117 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 1228 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 1497 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1497 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:03:09,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1228 Valid, 159 Invalid, 3805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1497 Valid, 2307 Invalid, 1 Unknown, 0 Unchecked, 33.4s Time] [2022-04-07 12:03:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-04-07 12:03:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 238. [2022-04-07 12:03:10,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:03:10,098 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-07 12:03:10,099 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-07 12:03:10,099 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-07 12:03:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:03:10,118 INFO L93 Difference]: Finished difference Result 817 states and 1050 transitions. [2022-04-07 12:03:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1050 transitions. [2022-04-07 12:03:10,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:03:10,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:03:10,119 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-07 12:03:10,119 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-07 12:03:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:03:10,138 INFO L93 Difference]: Finished difference Result 817 states and 1050 transitions. [2022-04-07 12:03:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1050 transitions. [2022-04-07 12:03:10,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:03:10,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:03:10,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:03:10,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:03:10,139 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-07 12:03:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 316 transitions. [2022-04-07 12:03:10,142 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 316 transitions. Word has length 32 [2022-04-07 12:03:10,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:03:10,142 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 316 transitions. [2022-04-07 12:03:10,143 INFO L479 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-07 12:03:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 316 transitions. [2022-04-07 12:03:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 12:03:10,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:03:10,143 INFO L499 BasicCegarLoop]: trace histogram [8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:03:10,161 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-07 12:03:10,359 WARN L460 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-07 12:03:10,360 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:03:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:03:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1075287642, now seen corresponding path program 10 times [2022-04-07 12:03:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:03:10,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306128479] [2022-04-07 12:03:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:03:10,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:03:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:03:10,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:03:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:03:10,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {24767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24750#true} is VALID [2022-04-07 12:03:10,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {24750#true} assume true; {24750#true} is VALID [2022-04-07 12:03:10,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24750#true} {24750#true} #72#return; {24750#true} is VALID [2022-04-07 12:03:10,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {24750#true} call ULTIMATE.init(); {24767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:03:10,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {24767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24750#true} is VALID [2022-04-07 12:03:10,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {24750#true} assume true; {24750#true} is VALID [2022-04-07 12:03:10,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24750#true} {24750#true} #72#return; {24750#true} is VALID [2022-04-07 12:03:10,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {24750#true} call #t~ret13 := main(); {24750#true} is VALID [2022-04-07 12:03:10,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {24750#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24755#(= main_~y~0 0)} is VALID [2022-04-07 12:03:10,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {24755#(= 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; {24756#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 12:03:10,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {24756#(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; {24757#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 12:03:10,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {24757#(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; {24758#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 12:03:10,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {24758#(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; {24759#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 12:03:10,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {24759#(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; {24760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:10,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {24760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {24760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:10,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {24760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {24761#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 12:03:10,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {24761#(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; {24762#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 12:03:10,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {24762#(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; {24763#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 12:03:10,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {24763#(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; {24764#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 12:03:10,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {24764#(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; {24765#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 12:03:10,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {24765#(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; {24766#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 12:03:10,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {24766#(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; {24751#false} is VALID [2022-04-07 12:03:10,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {24751#false} assume !(~z~0 % 4294967296 > 0); {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {24751#false} assume !(~y~0 % 4294967296 > 0); {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {24751#false} assume !(~x~0 % 4294967296 > 0); {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L272 TraceCheckUtils]: 29: Hoare triple {24751#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {24751#false} ~cond := #in~cond; {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {24751#false} assume 0 == ~cond; {24751#false} is VALID [2022-04-07 12:03:10,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {24751#false} assume !false; {24751#false} is VALID [2022-04-07 12:03:10,540 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-07 12:03:10,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:03:10,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306128479] [2022-04-07 12:03:10,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306128479] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:03:10,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193631162] [2022-04-07 12:03:10,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:03:10,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:03:10,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:03:10,556 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-07 12:03:10,557 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-07 12:03:10,597 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:03:10,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:03:10,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-07 12:03:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:03:10,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:03:10,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {24750#true} call ULTIMATE.init(); {24750#true} is VALID [2022-04-07 12:03:10,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {24750#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24750#true} is VALID [2022-04-07 12:03:10,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {24750#true} assume true; {24750#true} is VALID [2022-04-07 12:03:10,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24750#true} {24750#true} #72#return; {24750#true} is VALID [2022-04-07 12:03:10,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {24750#true} call #t~ret13 := main(); {24750#true} is VALID [2022-04-07 12:03:10,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {24750#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24755#(= main_~y~0 0)} is VALID [2022-04-07 12:03:10,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {24755#(= 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; {24756#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 12:03:10,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {24756#(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; {24757#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 12:03:10,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {24757#(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; {24758#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 12:03:10,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {24758#(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; {24759#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 12:03:10,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {24759#(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; {24760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:10,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {24760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {24760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:10,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {24760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {24807#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:10,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {24807#(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; {24811#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-07 12:03:10,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {24811#(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; {24815#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:10,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {24815#(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; {24819#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:10,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {24819#(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; {24823#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:10,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {24823#(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; {24827#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {24827#(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; {24751#false} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {24751#false} assume !(~z~0 % 4294967296 > 0); {24751#false} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {24751#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; {24751#false} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {24751#false} assume !(~y~0 % 4294967296 > 0); {24751#false} is VALID [2022-04-07 12:03:10,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {24751#false} assume !(~x~0 % 4294967296 > 0); {24751#false} is VALID [2022-04-07 12:03:10,842 INFO L272 TraceCheckUtils]: 29: Hoare triple {24751#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24751#false} is VALID [2022-04-07 12:03:10,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {24751#false} ~cond := #in~cond; {24751#false} is VALID [2022-04-07 12:03:10,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {24751#false} assume 0 == ~cond; {24751#false} is VALID [2022-04-07 12:03:10,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {24751#false} assume !false; {24751#false} is VALID [2022-04-07 12:03:10,842 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-07 12:03:10,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:03:11,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {24751#false} assume !false; {24751#false} is VALID [2022-04-07 12:03:11,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {24751#false} assume 0 == ~cond; {24751#false} is VALID [2022-04-07 12:03:11,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {24751#false} ~cond := #in~cond; {24751#false} is VALID [2022-04-07 12:03:11,189 INFO L272 TraceCheckUtils]: 29: Hoare triple {24751#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24751#false} is VALID [2022-04-07 12:03:11,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {24751#false} assume !(~x~0 % 4294967296 > 0); {24751#false} is VALID [2022-04-07 12:03:11,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {24888#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {24751#false} is VALID [2022-04-07 12:03:11,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {24892#(< 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; {24888#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 12:03:11,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {24896#(< 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; {24892#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 12:03:11,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {24900#(< 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; {24896#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 12:03:11,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {24904#(< 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; {24900#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 12:03:11,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {24908#(< 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; {24904#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-07 12:03:11,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {24908#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {24908#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-07 12:03:11,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {24908#(< 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; {24908#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-07 12:03:11,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {24908#(< 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; {24908#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-07 12:03:11,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {24921#(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; {24908#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-07 12:03:11,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {24925#(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; {24921#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-07 12:03:11,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {24929#(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; {24925#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-07 12:03:11,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {24933#(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; {24929#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-07 12:03:11,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {24937#(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; {24933#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-07 12:03:11,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {24941#(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; {24937#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-07 12:03:11,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {24750#true} ~z~0 := ~y~0; {24941#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-07 12:03:11,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {24750#true} assume !(~x~0 % 4294967296 > 0); {24750#true} is VALID [2022-04-07 12:03:11,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {24750#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24750#true} is VALID [2022-04-07 12:03:11,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {24750#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24750#true} is VALID [2022-04-07 12:03:11,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {24750#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24750#true} is VALID [2022-04-07 12:03:11,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {24750#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24750#true} is VALID [2022-04-07 12:03:11,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {24750#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24750#true} is VALID [2022-04-07 12:03:11,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {24750#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24750#true} is VALID [2022-04-07 12:03:11,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {24750#true} call #t~ret13 := main(); {24750#true} is VALID [2022-04-07 12:03:11,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24750#true} {24750#true} #72#return; {24750#true} is VALID [2022-04-07 12:03:11,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {24750#true} assume true; {24750#true} is VALID [2022-04-07 12:03:11,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {24750#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24750#true} is VALID [2022-04-07 12:03:11,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {24750#true} call ULTIMATE.init(); {24750#true} is VALID [2022-04-07 12:03:11,201 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-07 12:03:11,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193631162] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:03:11,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:03:11,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2022-04-07 12:03:11,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535377037] [2022-04-07 12:03:11,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:03:11,202 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-07 12:03:11,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:03:11,202 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-07 12:03:11,238 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-07 12:03:11,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-07 12:03:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:03:11,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-07 12:03:11,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-04-07 12:03:11,239 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-07 12:03:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:03:17,737 INFO L93 Difference]: Finished difference Result 435 states and 530 transitions. [2022-04-07 12:03:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-07 12:03:17,737 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-07 12:03:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:03:17,737 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-07 12:03:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 163 transitions. [2022-04-07 12:03:17,738 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-07 12:03:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 163 transitions. [2022-04-07 12:03:17,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 163 transitions. [2022-04-07 12:03:18,019 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-07 12:03:18,025 INFO L225 Difference]: With dead ends: 435 [2022-04-07 12:03:18,025 INFO L226 Difference]: Without dead ends: 415 [2022-04-07 12:03:18,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2122 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1384, Invalid=6272, Unknown=0, NotChecked=0, Total=7656 [2022-04-07 12:03:18,026 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 223 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-07 12:03:18,027 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 101 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-07 12:03:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-04-07 12:03:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 239. [2022-04-07 12:03:19,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:03:19,011 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-07 12:03:19,011 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-07 12:03:19,012 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-07 12:03:19,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:03:19,017 INFO L93 Difference]: Finished difference Result 415 states and 505 transitions. [2022-04-07 12:03:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 505 transitions. [2022-04-07 12:03:19,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:03:19,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:03:19,018 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-07 12:03:19,018 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-07 12:03:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:03:19,024 INFO L93 Difference]: Finished difference Result 415 states and 505 transitions. [2022-04-07 12:03:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 505 transitions. [2022-04-07 12:03:19,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:03:19,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:03:19,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:03:19,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:03:19,024 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-07 12:03:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 316 transitions. [2022-04-07 12:03:19,027 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 316 transitions. Word has length 33 [2022-04-07 12:03:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:03:19,027 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 316 transitions. [2022-04-07 12:03:19,027 INFO L479 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-07 12:03:19,027 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 316 transitions. [2022-04-07 12:03:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 12:03:19,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:03:19,028 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:03:19,046 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-07 12:03:19,244 WARN L460 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-07 12:03:19,244 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:03:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:03:19,245 INFO L85 PathProgramCache]: Analyzing trace with hash -475206312, now seen corresponding path program 11 times [2022-04-07 12:03:19,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:03:19,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047732651] [2022-04-07 12:03:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:03:19,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:03:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:03:19,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:03:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:03:19,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {26882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26865#true} is VALID [2022-04-07 12:03:19,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {26865#true} assume true; {26865#true} is VALID [2022-04-07 12:03:19,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26865#true} {26865#true} #72#return; {26865#true} is VALID [2022-04-07 12:03:19,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {26865#true} call ULTIMATE.init(); {26882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:03:19,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {26882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26865#true} is VALID [2022-04-07 12:03:19,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {26865#true} assume true; {26865#true} is VALID [2022-04-07 12:03:19,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26865#true} {26865#true} #72#return; {26865#true} is VALID [2022-04-07 12:03:19,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {26865#true} call #t~ret13 := main(); {26865#true} is VALID [2022-04-07 12:03:19,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {26865#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26865#true} is VALID [2022-04-07 12:03:19,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#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 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 12:03:19,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {26870#(<= 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; {26871#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-07 12:03:19,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {26871#(<= 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; {26872#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 12:03:19,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {26872#(<= 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; {26873#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 12:03:19,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {26873#(<= 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; {26874#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 12:03:19,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {26874#(<= 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; {26875#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-07 12:03:19,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {26875#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {26875#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-07 12:03:19,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {26875#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {26875#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-07 12:03:19,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {26875#(<= (* 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; {26876#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-07 12:03:19,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {26876#(<= (+ (* (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; {26877#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-07 12:03:19,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {26877#(<= (+ (* (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; {26878#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-07 12:03:19,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {26878#(<= (+ (* 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; {26879#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-07 12:03:19,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {26879#(<= (+ (* (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; {26880#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-07 12:03:19,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {26880#(<= (+ 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; {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 12:03:19,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 12:03:19,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {26881#(<= (+ 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; {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 12:03:19,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {26881#(<= (+ 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; {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 12:03:19,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {26881#(<= (+ 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; {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 12:03:19,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {26881#(<= (+ 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; {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 12:03:19,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {26881#(<= (+ 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; {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 12:03:19,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {26881#(<= (+ 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; {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 12:03:19,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-07 12:03:19,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {26881#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {26866#false} is VALID [2022-04-07 12:03:19,427 INFO L272 TraceCheckUtils]: 29: Hoare triple {26866#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26866#false} is VALID [2022-04-07 12:03:19,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {26866#false} ~cond := #in~cond; {26866#false} is VALID [2022-04-07 12:03:19,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {26866#false} assume 0 == ~cond; {26866#false} is VALID [2022-04-07 12:03:19,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {26866#false} assume !false; {26866#false} is VALID [2022-04-07 12:03:19,427 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-07 12:03:19,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:03:19,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047732651] [2022-04-07 12:03:19,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047732651] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:03:19,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876478229] [2022-04-07 12:03:19,427 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 12:03:19,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:03:19,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:03:19,428 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-07 12:03:19,444 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-07 12:03:19,730 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-07 12:03:19,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:03:19,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 12:03:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:03:19,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:03:20,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {26865#true} call ULTIMATE.init(); {26865#true} is VALID [2022-04-07 12:03:20,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {26865#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26865#true} is VALID [2022-04-07 12:03:20,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {26865#true} assume true; {26865#true} is VALID [2022-04-07 12:03:20,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26865#true} {26865#true} #72#return; {26865#true} is VALID [2022-04-07 12:03:20,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {26865#true} call #t~ret13 := main(); {26865#true} is VALID [2022-04-07 12:03:20,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {26865#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26865#true} is VALID [2022-04-07 12:03:20,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {26865#true} assume !(~x~0 % 4294967296 > 0); {26922#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 12:03:20,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {26922#(not (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {26922#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-07 12:03:20,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {26922#(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; {26929#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-07 12:03:20,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {26929#(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; {26933#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-07 12:03:20,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {26933#(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; {26937#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-07 12:03:20,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {26937#(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; {26941#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {26941#(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; {26945#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {26945#(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; {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {26949#(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; {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {26949#(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; {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {26949#(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; {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {26949#(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; {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {26949#(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; {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {26949#(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; {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-07 12:03:20,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {26949#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {26866#false} is VALID [2022-04-07 12:03:20,085 INFO L272 TraceCheckUtils]: 29: Hoare triple {26866#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26866#false} is VALID [2022-04-07 12:03:20,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {26866#false} ~cond := #in~cond; {26866#false} is VALID [2022-04-07 12:03:20,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {26866#false} assume 0 == ~cond; {26866#false} is VALID [2022-04-07 12:03:20,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {26866#false} assume !false; {26866#false} is VALID [2022-04-07 12:03:20,085 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-07 12:03:20,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:03:20,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {26866#false} assume !false; {26866#false} is VALID [2022-04-07 12:03:20,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {26866#false} assume 0 == ~cond; {26866#false} is VALID [2022-04-07 12:03:20,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {26866#false} ~cond := #in~cond; {26866#false} is VALID [2022-04-07 12:03:20,236 INFO L272 TraceCheckUtils]: 29: Hoare triple {26866#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26866#false} is VALID [2022-04-07 12:03:20,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {27001#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {26866#false} is VALID [2022-04-07 12:03:20,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {27001#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {27001#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-07 12:03:20,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {27001#(< 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; {27001#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-07 12:03:20,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {27001#(< 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; {27001#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-07 12:03:20,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {27001#(< 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; {27001#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-07 12:03:20,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {27001#(< 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; {27001#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-07 12:03:20,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {27001#(< 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; {27001#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-07 12:03:20,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {27001#(< 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; {27001#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-07 12:03:20,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {27001#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27001#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-07 12:03:20,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {26870#(<= 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; {27001#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-07 12:03:20,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {27032#(<= 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; {26870#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-07 12:03:20,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {27036#(<= 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; {27032#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-07 12:03:20,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {27040#(<= 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; {27036#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-07 12:03:20,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {27044#(<= 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; {27040#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-07 12:03:20,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {27048#(<= 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; {27044#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-07 12:03:20,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {27048#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {27048#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-07 12:03:20,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {26865#true} assume !(~x~0 % 4294967296 > 0); {27048#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-07 12:03:20,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {26865#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {26865#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {26865#true} call #t~ret13 := main(); {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26865#true} {26865#true} #72#return; {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {26865#true} assume true; {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {26865#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26865#true} is VALID [2022-04-07 12:03:20,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {26865#true} call ULTIMATE.init(); {26865#true} is VALID [2022-04-07 12:03:20,245 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-07 12:03:20,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876478229] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:03:20,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:03:20,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 28 [2022-04-07 12:03:20,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282716166] [2022-04-07 12:03:20,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:03:20,245 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-07 12:03:20,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:03:20,246 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-07 12:03:20,286 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-07 12:03:20,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-07 12:03:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:03:20,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-07 12:03:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2022-04-07 12:03:20,287 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-07 12:03:39,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 12:03:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:03:44,611 INFO L93 Difference]: Finished difference Result 559 states and 780 transitions. [2022-04-07 12:03:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-07 12:03:44,611 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-07 12:03:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:03:44,611 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-07 12:03:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 168 transitions. [2022-04-07 12:03:44,612 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-07 12:03:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 168 transitions. [2022-04-07 12:03:44,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 168 transitions. [2022-04-07 12:03:45,332 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-07 12:03:45,343 INFO L225 Difference]: With dead ends: 559 [2022-04-07 12:03:45,343 INFO L226 Difference]: Without dead ends: 551 [2022-04-07 12:03:45,343 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1191, Invalid=3365, Unknown=0, NotChecked=0, Total=4556 [2022-04-07 12:03:45,344 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 281 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 294 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-07 12:03:45,344 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 75 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-04-07 12:03:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-04-07 12:03:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 372. [2022-04-07 12:03:47,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:03:47,009 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-07 12:03:47,009 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-07 12:03:47,009 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-07 12:03:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:03:47,018 INFO L93 Difference]: Finished difference Result 551 states and 736 transitions. [2022-04-07 12:03:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 736 transitions. [2022-04-07 12:03:47,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:03:47,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:03:47,019 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-07 12:03:47,019 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-07 12:03:47,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:03:47,028 INFO L93 Difference]: Finished difference Result 551 states and 736 transitions. [2022-04-07 12:03:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 736 transitions. [2022-04-07 12:03:47,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:03:47,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:03:47,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:03:47,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:03:47,029 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-07 12:03:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 539 transitions. [2022-04-07 12:03:47,035 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 539 transitions. Word has length 33 [2022-04-07 12:03:47,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:03:47,035 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 539 transitions. [2022-04-07 12:03:47,035 INFO L479 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-07 12:03:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 539 transitions. [2022-04-07 12:03:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 12:03:47,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:03:47,036 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:03:47,049 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-07 12:03:47,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-07 12:03:47,243 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:03:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:03:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash 144704712, now seen corresponding path program 11 times [2022-04-07 12:03:47,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:03:47,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563774729] [2022-04-07 12:03:47,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:03:47,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:03:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:03:47,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:03:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:03:47,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {29655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29634#true} is VALID [2022-04-07 12:03:47,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {29634#true} assume true; {29634#true} is VALID [2022-04-07 12:03:47,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29634#true} {29634#true} #72#return; {29634#true} is VALID [2022-04-07 12:03:47,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {29634#true} call ULTIMATE.init(); {29655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:03:47,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {29655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29634#true} is VALID [2022-04-07 12:03:47,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {29634#true} assume true; {29634#true} is VALID [2022-04-07 12:03:47,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29634#true} {29634#true} #72#return; {29634#true} is VALID [2022-04-07 12:03:47,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {29634#true} call #t~ret13 := main(); {29634#true} is VALID [2022-04-07 12:03:47,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {29634#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29639#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-07 12:03:47,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {29639#(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; {29640#(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-07 12:03:47,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {29640#(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; {29641#(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-07 12:03:47,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {29641#(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; {29642#(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-07 12:03:47,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {29642#(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; {29643#(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-07 12:03:47,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {29643#(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; {29644#(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-07 12:03:47,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {29644#(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 (<= (+ 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-07 12:03:47,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {29645#(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; {29645#(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-07 12:03:47,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {29645#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:47,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {29646#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:47,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {29646#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:47,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {29646#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:47,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {29646#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:47,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:47,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {29646#(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; {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-07 12:03:47,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {29647#(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; {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-07 12:03:47,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {29648#(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; {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-07 12:03:47,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {29649#(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; {29650#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-07 12:03:47,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {29650#(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; {29651#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-07 12:03:47,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {29651#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} assume !(~y~0 % 4294967296 > 0); {29651#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-07 12:03:47,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {29651#(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; {29650#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-07 12:03:47,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {29650#(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; {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-07 12:03:47,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {29649#(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; {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-07 12:03:47,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {29648#(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; {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-07 12:03:47,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {29647#(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; {29652#(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-07 12:03:47,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {29652#(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); {29652#(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-07 12:03:47,854 INFO L272 TraceCheckUtils]: 31: Hoare triple {29652#(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)); {29653#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:03:47,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {29653#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29654#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:03:47,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {29654#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29635#false} is VALID [2022-04-07 12:03:47,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {29635#false} assume !false; {29635#false} is VALID [2022-04-07 12:03:47,854 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-07 12:03:47,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:03:47,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563774729] [2022-04-07 12:03:47,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563774729] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:03:47,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555011030] [2022-04-07 12:03:47,855 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 12:03:47,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:03:47,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:03:47,856 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-07 12:03:47,856 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-07 12:03:48,082 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-07 12:03:48,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:03:48,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-07 12:03:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:03:48,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:03:48,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {29634#true} call ULTIMATE.init(); {29634#true} is VALID [2022-04-07 12:03:48,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {29634#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29634#true} is VALID [2022-04-07 12:03:48,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {29634#true} assume true; {29634#true} is VALID [2022-04-07 12:03:48,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29634#true} {29634#true} #72#return; {29634#true} is VALID [2022-04-07 12:03:48,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {29634#true} call #t~ret13 := main(); {29634#true} is VALID [2022-04-07 12:03:48,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {29634#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29639#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-07 12:03:48,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {29639#(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; {29677#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-07 12:03:48,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {29677#(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; {29681#(and (= (+ (- 2) main_~y~0) 0) (= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 12:03:48,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {29681#(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; {29685#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3))} is VALID [2022-04-07 12:03:48,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {29685#(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; {29689#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)))} is VALID [2022-04-07 12:03:48,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {29689#(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; {29644#(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-07 12:03:48,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {29644#(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); {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:48,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} ~z~0 := ~y~0; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:48,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {29646#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:48,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {29646#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:48,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {29646#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:48,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {29646#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:48,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {29646#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:48,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:48,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {29646#(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; {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-07 12:03:48,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {29647#(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; {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-07 12:03:48,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {29648#(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; {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-07 12:03:48,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {29649#(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; {29650#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-07 12:03:48,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {29650#(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; {29651#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-07 12:03:48,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {29651#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} assume !(~y~0 % 4294967296 > 0); {29651#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-07 12:03:48,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {29651#(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; {29650#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-07 12:03:48,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {29650#(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; {29649#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-07 12:03:48,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {29649#(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; {29648#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-07 12:03:48,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {29648#(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; {29647#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-07 12:03:48,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {29647#(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; {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:48,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {29646#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-07 12:03:48,849 INFO L272 TraceCheckUtils]: 31: Hoare triple {29646#(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)); {29756#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:03:48,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {29756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:03:48,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {29760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29635#false} is VALID [2022-04-07 12:03:48,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {29635#false} assume !false; {29635#false} is VALID [2022-04-07 12:03:48,850 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-07 12:03:48,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:03:50,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {29635#false} assume !false; {29635#false} is VALID [2022-04-07 12:03:50,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {29760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29635#false} is VALID [2022-04-07 12:03:50,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {29756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:03:50,519 INFO L272 TraceCheckUtils]: 31: Hoare triple {29652#(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)); {29756#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:03:50,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {29652#(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); {29652#(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-07 12:03:50,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {29782#(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; {29652#(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-07 12:03:50,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {29786#(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; {29782#(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-07 12:03:50,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {29790#(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; {29786#(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-07 12:03:50,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {29794#(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; {29790#(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-07 12:03:50,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {29798#(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; {29794#(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-07 12:03:50,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {29798#(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); {29798#(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-07 12:03:50,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {29794#(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; {29798#(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-07 12:03:50,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {29790#(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; {29794#(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-07 12:03:50,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {29786#(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; {29790#(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-07 12:03:50,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {29782#(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; {29786#(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-07 12:03:50,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {29652#(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; {29782#(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-07 12:03:50,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {29652#(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); {29652#(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-07 12:03:50,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {29652#(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; {29652#(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-07 12:03:50,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {29652#(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; {29652#(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-07 12:03:50,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {29652#(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; {29652#(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-07 12:03:50,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {29652#(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; {29652#(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-07 12:03:50,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {29652#(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; {29652#(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-07 12:03:50,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {29652#(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; {29652#(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-07 12:03:50,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {29841#(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); {29652#(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-07 12:03:50,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {29845#(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; {29841#(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-07 12:03:50,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {29849#(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; {29845#(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-07 12:03:50,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {29853#(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; {29849#(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-07 12:03:50,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {29857#(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; {29853#(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-07 12:03:50,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {29861#(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; {29857#(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-07 12:03:50,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {29634#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29861#(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-07 12:03:50,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {29634#true} call #t~ret13 := main(); {29634#true} is VALID [2022-04-07 12:03:50,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29634#true} {29634#true} #72#return; {29634#true} is VALID [2022-04-07 12:03:50,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {29634#true} assume true; {29634#true} is VALID [2022-04-07 12:03:50,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {29634#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {29634#true} is VALID [2022-04-07 12:03:50,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {29634#true} call ULTIMATE.init(); {29634#true} is VALID [2022-04-07 12:03:50,540 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-07 12:03:50,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555011030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:03:50,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:03:50,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 36 [2022-04-07 12:03:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013578828] [2022-04-07 12:03:50,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:03:50,541 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-07 12:03:50,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:03:50,541 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-07 12:03:50,617 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-07 12:03:50,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-07 12:03:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:03:50,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-07 12:03:50,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2022-04-07 12:03:50,618 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-07 12:04:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:04:13,710 INFO L93 Difference]: Finished difference Result 570 states and 736 transitions. [2022-04-07 12:04:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-07 12:04:13,710 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-07 12:04:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:04:13,710 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-07 12:04:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 86 transitions. [2022-04-07 12:04:13,711 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-07 12:04:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 86 transitions. [2022-04-07 12:04:13,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 86 transitions. [2022-04-07 12:04:16,017 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-07 12:04:16,028 INFO L225 Difference]: With dead ends: 570 [2022-04-07 12:04:16,028 INFO L226 Difference]: Without dead ends: 546 [2022-04-07 12:04:16,028 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=629, Invalid=5376, Unknown=1, NotChecked=0, Total=6006 [2022-04-07 12:04:16,029 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 86 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-07 12:04:16,029 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 85 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-07 12:04:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-04-07 12:04:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 365. [2022-04-07 12:04:17,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:04:17,693 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-07 12:04:17,693 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-07 12:04:17,693 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-07 12:04:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:04:17,702 INFO L93 Difference]: Finished difference Result 546 states and 712 transitions. [2022-04-07 12:04:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 712 transitions. [2022-04-07 12:04:17,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:04:17,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:04:17,703 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-07 12:04:17,703 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-07 12:04:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:04:17,712 INFO L93 Difference]: Finished difference Result 546 states and 712 transitions. [2022-04-07 12:04:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 712 transitions. [2022-04-07 12:04:17,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:04:17,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:04:17,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:04:17,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:04:17,713 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-07 12:04:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 531 transitions. [2022-04-07 12:04:17,719 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 531 transitions. Word has length 35 [2022-04-07 12:04:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:04:17,719 INFO L478 AbstractCegarLoop]: Abstraction has 365 states and 531 transitions. [2022-04-07 12:04:17,719 INFO L479 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-07 12:04:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 531 transitions. [2022-04-07 12:04:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 12:04:17,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:04:17,720 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:04:17,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-07 12:04:17,927 WARN L460 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-07 12:04:17,928 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:04:17,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:04:17,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1255449176, now seen corresponding path program 12 times [2022-04-07 12:04:17,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:04:17,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932381156] [2022-04-07 12:04:17,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:04:17,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:04:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:04:18,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:04:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:04:18,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {32426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32409#true} is VALID [2022-04-07 12:04:18,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {32409#true} assume true; {32409#true} is VALID [2022-04-07 12:04:18,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32409#true} {32409#true} #72#return; {32409#true} is VALID [2022-04-07 12:04:18,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {32409#true} call ULTIMATE.init(); {32426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:04:18,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {32426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32409#true} is VALID [2022-04-07 12:04:18,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {32409#true} assume true; {32409#true} is VALID [2022-04-07 12:04:18,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32409#true} {32409#true} #72#return; {32409#true} is VALID [2022-04-07 12:04:18,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {32409#true} call #t~ret13 := main(); {32409#true} is VALID [2022-04-07 12:04:18,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {32409#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32414#(= main_~y~0 0)} is VALID [2022-04-07 12:04:18,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {32414#(= 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; {32415#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 12:04:18,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {32415#(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; {32416#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 12:04:18,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {32416#(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; {32417#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 12:04:18,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {32417#(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; {32418#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 12:04:18,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {32418#(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; {32419#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:04:18,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {32419#(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; {32420#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 12:04:18,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {32420#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32420#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 12:04:18,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {32420#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32421#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 12:04:18,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {32421#(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; {32422#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 12:04:18,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {32422#(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; {32423#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 12:04:18,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {32423#(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; {32424#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 12:04:18,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {32424#(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; {32425#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {32425#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32410#false} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {32410#false} assume !(~y~0 % 4294967296 > 0); {32410#false} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {32410#false} assume !(~x~0 % 4294967296 > 0); {32410#false} is VALID [2022-04-07 12:04:18,093 INFO L272 TraceCheckUtils]: 31: Hoare triple {32410#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32410#false} is VALID [2022-04-07 12:04:18,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {32410#false} ~cond := #in~cond; {32410#false} is VALID [2022-04-07 12:04:18,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {32410#false} assume 0 == ~cond; {32410#false} is VALID [2022-04-07 12:04:18,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {32410#false} assume !false; {32410#false} is VALID [2022-04-07 12:04:18,093 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-07 12:04:18,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:04:18,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932381156] [2022-04-07 12:04:18,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932381156] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:04:18,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338850711] [2022-04-07 12:04:18,093 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 12:04:18,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:04:18,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:04:18,094 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-07 12:04:18,095 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-07 12:04:18,155 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-07 12:04:18,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:04:18,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-07 12:04:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:04:18,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:04:18,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {32409#true} call ULTIMATE.init(); {32409#true} is VALID [2022-04-07 12:04:18,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {32409#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32409#true} is VALID [2022-04-07 12:04:18,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {32409#true} assume true; {32409#true} is VALID [2022-04-07 12:04:18,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32409#true} {32409#true} #72#return; {32409#true} is VALID [2022-04-07 12:04:18,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {32409#true} call #t~ret13 := main(); {32409#true} is VALID [2022-04-07 12:04:18,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {32409#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32414#(= main_~y~0 0)} is VALID [2022-04-07 12:04:18,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {32414#(= 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; {32415#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 12:04:18,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {32415#(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; {32416#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 12:04:18,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {32416#(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; {32417#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 12:04:18,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {32417#(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; {32418#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 12:04:18,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {32418#(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; {32419#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:04:18,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {32419#(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; {32420#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 12:04:18,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {32420#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32420#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 12:04:18,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {32420#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32469#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-07 12:04:18,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {32469#(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; {32473#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-07 12:04:18,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {32473#(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; {32477#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-07 12:04:18,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {32477#(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; {32481#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 12:04:18,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {32481#(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; {32485#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-07 12:04:18,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {32485#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {32410#false} is VALID [2022-04-07 12:04:18,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {32410#false} assume !(~y~0 % 4294967296 > 0); {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {32410#false} assume !(~x~0 % 4294967296 > 0); {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L272 TraceCheckUtils]: 31: Hoare triple {32410#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {32410#false} ~cond := #in~cond; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {32410#false} assume 0 == ~cond; {32410#false} is VALID [2022-04-07 12:04:18,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {32410#false} assume !false; {32410#false} is VALID [2022-04-07 12:04:18,402 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-07 12:04:18,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:04:18,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {32410#false} assume !false; {32410#false} is VALID [2022-04-07 12:04:18,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {32410#false} assume 0 == ~cond; {32410#false} is VALID [2022-04-07 12:04:18,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {32410#false} ~cond := #in~cond; {32410#false} is VALID [2022-04-07 12:04:18,680 INFO L272 TraceCheckUtils]: 31: Hoare triple {32410#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32410#false} is VALID [2022-04-07 12:04:18,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {32410#false} assume !(~x~0 % 4294967296 > 0); {32410#false} is VALID [2022-04-07 12:04:18,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {32410#false} assume !(~y~0 % 4294967296 > 0); {32410#false} is VALID [2022-04-07 12:04:18,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {32410#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; {32410#false} is VALID [2022-04-07 12:04:18,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {32570#(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; {32410#false} is VALID [2022-04-07 12:04:18,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {32574#(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; {32570#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 12:04:18,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {32578#(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; {32574#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-07 12:04:18,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {32582#(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; {32578#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-07 12:04:18,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {32586#(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; {32582#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-07 12:04:18,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {32590#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {32586#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-07 12:04:18,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {32594#(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; {32590#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-07 12:04:18,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {32598#(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; {32594#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-07 12:04:18,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {32602#(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; {32598#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-07 12:04:18,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {32606#(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; {32602#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {32409#true} ~z~0 := ~y~0; {32606#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {32409#true} assume !(~x~0 % 4294967296 > 0); {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {32409#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {32409#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {32409#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {32409#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {32409#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {32409#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {32409#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {32409#true} call #t~ret13 := main(); {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32409#true} {32409#true} #72#return; {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {32409#true} assume true; {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {32409#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32409#true} is VALID [2022-04-07 12:04:18,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {32409#true} call ULTIMATE.init(); {32409#true} is VALID [2022-04-07 12:04:18,690 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-07 12:04:18,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338850711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:04:18,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:04:18,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 30 [2022-04-07 12:04:18,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220827271] [2022-04-07 12:04:18,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:04:18,690 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-07 12:04:18,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:04:18,691 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-07 12:04:18,757 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-07 12:04:18,758 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-07 12:04:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:04:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-07 12:04:18,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2022-04-07 12:04:18,758 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-07 12:04:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:04:24,688 INFO L93 Difference]: Finished difference Result 559 states and 741 transitions. [2022-04-07 12:04:24,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-07 12:04:24,688 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-07 12:04:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:04:24,689 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-07 12:04:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 128 transitions. [2022-04-07 12:04:24,690 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-07 12:04:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 128 transitions. [2022-04-07 12:04:24,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 128 transitions. [2022-04-07 12:04:24,817 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-07 12:04:24,826 INFO L225 Difference]: With dead ends: 559 [2022-04-07 12:04:24,826 INFO L226 Difference]: Without dead ends: 475 [2022-04-07 12:04:24,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=486, Invalid=3546, Unknown=0, NotChecked=0, Total=4032 [2022-04-07 12:04:24,826 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 68 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:04:24,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 110 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-07 12:04:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-07 12:04:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 347. [2022-04-07 12:04:26,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:04:26,540 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-07 12:04:26,540 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-07 12:04:26,540 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-07 12:04:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:04:26,547 INFO L93 Difference]: Finished difference Result 475 states and 641 transitions. [2022-04-07 12:04:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 641 transitions. [2022-04-07 12:04:26,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:04:26,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:04:26,548 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-07 12:04:26,551 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-07 12:04:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:04:26,558 INFO L93 Difference]: Finished difference Result 475 states and 641 transitions. [2022-04-07 12:04:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 641 transitions. [2022-04-07 12:04:26,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:04:26,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:04:26,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:04:26,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:04:26,560 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-07 12:04:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 497 transitions. [2022-04-07 12:04:26,564 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 497 transitions. Word has length 35 [2022-04-07 12:04:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:04:26,565 INFO L478 AbstractCegarLoop]: Abstraction has 347 states and 497 transitions. [2022-04-07 12:04:26,565 INFO L479 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-07 12:04:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 497 transitions. [2022-04-07 12:04:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 12:04:26,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:04:26,565 INFO L499 BasicCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:04:26,589 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-07 12:04:26,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-07 12:04:26,779 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:04:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:04:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash 662902689, now seen corresponding path program 13 times [2022-04-07 12:04:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:04:26,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011366169] [2022-04-07 12:04:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:04:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:04:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:04:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:04:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:04:27,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {35032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35008#true} is VALID [2022-04-07 12:04:27,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {35008#true} assume true; {35008#true} is VALID [2022-04-07 12:04:27,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35008#true} {35008#true} #72#return; {35008#true} is VALID [2022-04-07 12:04:27,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {35008#true} call ULTIMATE.init(); {35032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:04:27,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {35032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35008#true} is VALID [2022-04-07 12:04:27,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {35008#true} assume true; {35008#true} is VALID [2022-04-07 12:04:27,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35008#true} {35008#true} #72#return; {35008#true} is VALID [2022-04-07 12:04:27,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {35008#true} call #t~ret13 := main(); {35008#true} is VALID [2022-04-07 12:04:27,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {35008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35013#(= main_~y~0 0)} is VALID [2022-04-07 12:04:27,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {35013#(= 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; {35014#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 12:04:27,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {35014#(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; {35015#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 12:04:27,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {35015#(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; {35016#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 12:04:27,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {35016#(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; {35017#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 12:04:27,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {35017#(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; {35018#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:04:27,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {35018#(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; {35019#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 12:04:27,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {35019#(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; {35020#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 12:04:27,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {35020#(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; {35021#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 12:04:27,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {35021#(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; {35022#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 12:04:27,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {35022#(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; {35023#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-07 12:04:27,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {35023#(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; {35024#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-07 12:04:27,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {35024#(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; {35025#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 12:04:27,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {35025#(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; {35026#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-07 12:04:27,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {35026#(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; {35027#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-07 12:04:27,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {35027#(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; {35028#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-07 12:04:27,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {35028#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {35028#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-07 12:04:27,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {35028#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {35029#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-07 12:04:27,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {35029#(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; {35030#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-07 12:04:27,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {35030#(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; {35031#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-07 12:04:27,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {35031#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {35009#false} is VALID [2022-04-07 12:04:27,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {35009#false} assume !(~y~0 % 4294967296 > 0); {35009#false} is VALID [2022-04-07 12:04:27,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {35009#false} assume !(~x~0 % 4294967296 > 0); {35009#false} is VALID [2022-04-07 12:04:27,092 INFO L272 TraceCheckUtils]: 32: Hoare triple {35009#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35009#false} is VALID [2022-04-07 12:04:27,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {35009#false} ~cond := #in~cond; {35009#false} is VALID [2022-04-07 12:04:27,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {35009#false} assume 0 == ~cond; {35009#false} is VALID [2022-04-07 12:04:27,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {35009#false} assume !false; {35009#false} is VALID [2022-04-07 12:04:27,092 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-07 12:04:27,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:04:27,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011366169] [2022-04-07 12:04:27,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011366169] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:04:27,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634937374] [2022-04-07 12:04:27,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 12:04:27,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:04:27,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:04:27,093 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-07 12:04:27,094 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-07 12:04:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:04:27,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-07 12:04:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:04:27,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:04:27,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {35008#true} call ULTIMATE.init(); {35008#true} is VALID [2022-04-07 12:04:27,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {35008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35008#true} is VALID [2022-04-07 12:04:27,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {35008#true} assume true; {35008#true} is VALID [2022-04-07 12:04:27,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35008#true} {35008#true} #72#return; {35008#true} is VALID [2022-04-07 12:04:27,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {35008#true} call #t~ret13 := main(); {35008#true} is VALID [2022-04-07 12:04:27,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {35008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35013#(= main_~y~0 0)} is VALID [2022-04-07 12:04:27,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {35013#(= 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; {35014#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 12:04:27,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {35014#(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; {35015#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 12:04:27,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {35015#(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; {35016#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 12:04:27,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {35016#(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; {35017#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 12:04:27,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {35017#(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; {35018#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 12:04:27,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {35018#(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; {35019#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 12:04:27,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {35019#(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; {35020#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 12:04:27,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {35020#(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; {35021#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 12:04:27,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {35021#(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; {35022#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 12:04:27,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {35022#(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; {35023#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-07 12:04:27,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {35023#(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; {35024#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-07 12:04:27,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {35024#(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; {35025#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 12:04:27,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {35025#(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; {35026#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-07 12:04:27,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {35026#(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; {35027#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-07 12:04:27,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {35027#(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; {35028#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-07 12:04:27,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {35028#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {35028#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-07 12:04:27,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {35028#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {35029#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-07 12:04:27,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {35029#(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; {35030#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-07 12:04:27,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {35030#(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; {35108#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-07 12:04:27,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {35108#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {35009#false} is VALID [2022-04-07 12:04:27,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {35009#false} assume !(~y~0 % 4294967296 > 0); {35009#false} is VALID [2022-04-07 12:04:27,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {35009#false} assume !(~x~0 % 4294967296 > 0); {35009#false} is VALID [2022-04-07 12:04:27,416 INFO L272 TraceCheckUtils]: 32: Hoare triple {35009#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35009#false} is VALID [2022-04-07 12:04:27,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {35009#false} ~cond := #in~cond; {35009#false} is VALID [2022-04-07 12:04:27,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {35009#false} assume 0 == ~cond; {35009#false} is VALID [2022-04-07 12:04:27,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {35009#false} assume !false; {35009#false} is VALID [2022-04-07 12:04:27,417 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-07 12:04:27,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:04:27,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {35009#false} assume !false; {35009#false} is VALID [2022-04-07 12:04:27,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {35009#false} assume 0 == ~cond; {35009#false} is VALID [2022-04-07 12:04:27,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {35009#false} ~cond := #in~cond; {35009#false} is VALID [2022-04-07 12:04:27,992 INFO L272 TraceCheckUtils]: 32: Hoare triple {35009#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35009#false} is VALID [2022-04-07 12:04:27,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {35009#false} assume !(~x~0 % 4294967296 > 0); {35009#false} is VALID [2022-04-07 12:04:27,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {35009#false} assume !(~y~0 % 4294967296 > 0); {35009#false} is VALID [2022-04-07 12:04:27,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {35009#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; {35009#false} is VALID [2022-04-07 12:04:27,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {35172#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35009#false} is VALID [2022-04-07 12:04:27,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {35176#(< 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; {35172#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 12:04:27,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {35180#(< 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; {35176#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 12:04:27,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {35184#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {35180#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-07 12:04:27,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {35184#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35184#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 12:04:27,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {35191#(< 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; {35184#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 12:04:27,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {35195#(< 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; {35191#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 12:04:27,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {35199#(< 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; {35195#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 12:04:27,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {35203#(< 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; {35199#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 12:04:27,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {35207#(< 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; {35203#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 12:04:27,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {35211#(< 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; {35207#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-07 12:04:27,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {35215#(< 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; {35211#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-07 12:04:27,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {35219#(< 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; {35215#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-07 12:04:28,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {35223#(< 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; {35219#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-07 12:04:28,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {35227#(< 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; {35223#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-07 12:04:28,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {35231#(< 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; {35227#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-07 12:04:28,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {35235#(< 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; {35231#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-07 12:04:28,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {35239#(< 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; {35235#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-07 12:04:28,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {35243#(< 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; {35239#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-07 12:04:28,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {35247#(< 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; {35243#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-07 12:04:28,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {35008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35247#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-07 12:04:28,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {35008#true} call #t~ret13 := main(); {35008#true} is VALID [2022-04-07 12:04:28,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35008#true} {35008#true} #72#return; {35008#true} is VALID [2022-04-07 12:04:28,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {35008#true} assume true; {35008#true} is VALID [2022-04-07 12:04:28,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {35008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35008#true} is VALID [2022-04-07 12:04:28,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {35008#true} call ULTIMATE.init(); {35008#true} is VALID [2022-04-07 12:04:28,005 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-07 12:04:28,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634937374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:04:28,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:04:28,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-07 12:04:28,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347706035] [2022-04-07 12:04:28,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:04:28,006 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-07 12:04:28,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:04:28,006 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-07 12:04:28,052 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-07 12:04:28,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-07 12:04:28,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:04:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-07 12:04:28,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2022-04-07 12:04:28,054 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-07 12:04:54,042 WARN L232 SmtUtils]: Spent 8.57s 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-07 12:05:34,086 WARN L232 SmtUtils]: Spent 17.06s 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-07 12:06:00,578 WARN L232 SmtUtils]: Spent 10.37s 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-07 12:06:17,909 WARN L232 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:06:27,429 WARN L232 SmtUtils]: Spent 5.31s 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-07 12:06:52,400 WARN L232 SmtUtils]: Spent 13.97s 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-07 12:07:08,405 WARN L232 SmtUtils]: Spent 8.83s 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-07 12:07:21,146 WARN L232 SmtUtils]: Spent 7.99s 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-07 12:07:42,782 WARN L232 SmtUtils]: Spent 6.59s 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-07 12:07:55,841 WARN L232 SmtUtils]: Spent 7.40s 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-07 12:08:09,593 WARN L232 SmtUtils]: Spent 8.66s 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-07 12:08:31,589 WARN L232 SmtUtils]: Spent 10.79s 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-07 12:08:42,546 WARN L232 SmtUtils]: Spent 5.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-07 12:08:50,568 WARN L232 SmtUtils]: Spent 5.29s 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)