/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/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:19:38,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:19:38,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:19:38,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:19:38,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:19:38,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:19:38,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:19:38,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:19:38,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:19:38,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:19:38,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:19:38,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:19:38,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:19:38,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:19:38,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:19:38,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:19:38,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:19:38,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:19:38,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:19:38,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:19:38,884 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:19:38,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:19:38,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:19:38,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:19:38,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:19:38,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:19:38,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:19:38,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:19:38,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:19:38,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:19:38,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:19:38,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:19:38,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:19:38,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:19:38,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:19:38,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:19:38,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:19:38,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:19:38,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:19:38,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:19:38,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:19:38,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:19:38,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:19:38,928 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:19:38,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:19:38,928 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:19:38,928 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:19:38,929 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:19:38,929 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:19:38,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:19:38,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:19:38,929 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:19:38,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:19:38,929 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:19:38,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:19:38,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:19:38,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:19:38,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:19:38,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:19:38,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:19:38,930 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:19:38,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:19:38,930 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:19:38,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:19:38,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:19:38,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:19:38,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:19:38,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:19:38,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:19:38,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:19:38,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:19:38,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:19:38,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:19:38,931 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:19:38,931 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:19:38,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:19:38,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:19:39,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:19:39,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:19:39,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:19:39,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:19:39,152 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:19:39,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2022-04-27 10:19:39,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b462fdcf6/99f95cfb16244805a6582c18f9acbe1c/FLAG4ddc35394 [2022-04-27 10:19:39,499 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:19:39,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2022-04-27 10:19:39,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b462fdcf6/99f95cfb16244805a6582c18f9acbe1c/FLAG4ddc35394 [2022-04-27 10:19:39,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b462fdcf6/99f95cfb16244805a6582c18f9acbe1c [2022-04-27 10:19:39,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:19:39,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:19:39,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:19:39,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:19:39,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:19:39,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d64753c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:39, skipping insertion in model container [2022-04-27 10:19:39,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:39" (1/1) ... [2022-04-27 10:19:39,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:19:39,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:19:40,071 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/sum03-1.i[807,820] [2022-04-27 10:19:40,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:19:40,100 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:19:40,108 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/sum03-1.i[807,820] [2022-04-27 10:19:40,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:19:40,129 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:19:40,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:40 WrapperNode [2022-04-27 10:19:40,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:19:40,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:19:40,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:19:40,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:19:40,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:40" (1/1) ... [2022-04-27 10:19:40,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:40" (1/1) ... [2022-04-27 10:19:40,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:40" (1/1) ... [2022-04-27 10:19:40,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:40" (1/1) ... [2022-04-27 10:19:40,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:40" (1/1) ... [2022-04-27 10:19:40,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:40" (1/1) ... [2022-04-27 10:19:40,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:40" (1/1) ... [2022-04-27 10:19:40,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:19:40,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:19:40,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:19:40,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:19:40,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:40" (1/1) ... [2022-04-27 10:19:40,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:19:40,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:40,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:19:40,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:19:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:19:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:19:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:19:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:19:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:19:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:19:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:19:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:19:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:19:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:19:40,232 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:19:40,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:19:40,383 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:19:40,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:19:40,388 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:19:40,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:40 BoogieIcfgContainer [2022-04-27 10:19:40,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:19:40,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:19:40,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:19:40,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:19:40,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:19:39" (1/3) ... [2022-04-27 10:19:40,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfe1d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:40, skipping insertion in model container [2022-04-27 10:19:40,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:40" (2/3) ... [2022-04-27 10:19:40,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfe1d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:40, skipping insertion in model container [2022-04-27 10:19:40,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:40" (3/3) ... [2022-04-27 10:19:40,394 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2022-04-27 10:19:40,403 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:19:40,403 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:19:40,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:19:40,461 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44af0ae, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76f0f1b [2022-04-27 10:19:40,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:19:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:19:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:19:40,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:40,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:40,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1946695220, now seen corresponding path program 1 times [2022-04-27 10:19:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:40,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610597177] [2022-04-27 10:19:40,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:40,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:40,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23#true} is VALID [2022-04-27 10:19:40,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:19:40,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2022-04-27 10:19:40,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:40,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {23#true} is VALID [2022-04-27 10:19:40,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 10:19:40,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2022-04-27 10:19:40,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret4 := main(); {23#true} is VALID [2022-04-27 10:19:40,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-27 10:19:40,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-27 10:19:40,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:40,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-27 10:19:40,909 INFO L272 TraceCheckUtils]: 9: Hoare triple {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:40,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:40,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-27 10:19:40,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 10:19:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:40,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610597177] [2022-04-27 10:19:40,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610597177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:19:40,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:19:40,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:19:40,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279374470] [2022-04-27 10:19:40,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:19:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 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 13 [2022-04-27 10:19:40,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:40,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:40,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:40,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:19:40,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:40,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:19:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:19:40,971 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:41,244 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2022-04-27 10:19:41,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:19:41,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 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 13 [2022-04-27 10:19:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-27 10:19:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-27 10:19:41,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-27 10:19:41,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:41,328 INFO L225 Difference]: With dead ends: 41 [2022-04-27 10:19:41,328 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 10:19:41,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:19:41,332 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:41,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:19:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 10:19:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-27 10:19:41,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:41,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:19:41,365 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:19:41,365 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:19:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:41,367 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 10:19:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 10:19:41,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:41,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:41,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 10:19:41,368 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 10:19:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:41,370 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 10:19:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 10:19:41,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:41,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:41,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:41,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:19:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-27 10:19:41,373 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2022-04-27 10:19:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:41,373 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-27 10:19:41,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-27 10:19:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:19:41,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:41,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:41,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:19:41,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:41,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:41,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1052577873, now seen corresponding path program 1 times [2022-04-27 10:19:41,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:41,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994651175] [2022-04-27 10:19:41,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:41,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:41,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {191#true} is VALID [2022-04-27 10:19:41,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-27 10:19:41,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191#true} {191#true} #48#return; {191#true} is VALID [2022-04-27 10:19:41,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-27 10:19:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:41,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-04-27 10:19:41,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-04-27 10:19:41,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-27 10:19:41,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} #46#return; {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-27 10:19:41,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:41,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {191#true} is VALID [2022-04-27 10:19:41,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-27 10:19:41,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #48#return; {191#true} is VALID [2022-04-27 10:19:41,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret4 := main(); {191#true} is VALID [2022-04-27 10:19:41,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-27 10:19:41,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-27 10:19:41,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {197#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:41,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {197#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-27 10:19:41,541 INFO L272 TraceCheckUtils]: 9: Hoare triple {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {191#true} is VALID [2022-04-27 10:19:41,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-04-27 10:19:41,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-04-27 10:19:41,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-27 10:19:41,542 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {191#true} {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} #46#return; {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-27 10:19:41,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} assume !false; {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-27 10:19:41,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {203#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} is VALID [2022-04-27 10:19:41,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {203#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {204#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-27 10:19:41,546 INFO L272 TraceCheckUtils]: 17: Hoare triple {204#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {205#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:19:41,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {205#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {206#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:19:41,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {206#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {192#false} is VALID [2022-04-27 10:19:41,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-27 10:19:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:41,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:41,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994651175] [2022-04-27 10:19:41,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994651175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:41,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230834407] [2022-04-27 10:19:41,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:41,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:41,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:41,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:19:41,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:19:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:41,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 10:19:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:41,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:42,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {191#true} is VALID [2022-04-27 10:19:42,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {191#true} is VALID [2022-04-27 10:19:42,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-27 10:19:42,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #48#return; {191#true} is VALID [2022-04-27 10:19:42,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret4 := main(); {191#true} is VALID [2022-04-27 10:19:42,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-27 10:19:42,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-27 10:19:42,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {197#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:42,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {197#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:42,017 INFO L272 TraceCheckUtils]: 9: Hoare triple {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {191#true} is VALID [2022-04-27 10:19:42,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-04-27 10:19:42,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-04-27 10:19:42,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-27 10:19:42,018 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {191#true} {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #46#return; {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:42,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !false; {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-27 10:19:42,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(and (= (+ (- 1) main_~x~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {257#(and (= (+ (- 1) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 10:19:42,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#(and (= (+ (- 1) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {261#(and (= (+ (- 2) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-27 10:19:42,021 INFO L272 TraceCheckUtils]: 17: Hoare triple {261#(and (= (+ (- 2) main_~x~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {265#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 10:19:42,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {265#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:42,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {192#false} is VALID [2022-04-27 10:19:42,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-27 10:19:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:42,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:42,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-27 10:19:42,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {192#false} is VALID [2022-04-27 10:19:42,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {282#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:42,655 INFO L272 TraceCheckUtils]: 17: Hoare triple {286#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {282#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:42,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {290#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {286#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} is VALID [2022-04-27 10:19:42,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {290#(or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-27 10:19:42,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} assume !false; {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:42,658 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {191#true} {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} #46#return; {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:42,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-27 10:19:42,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-04-27 10:19:42,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-04-27 10:19:42,659 INFO L272 TraceCheckUtils]: 9: Hoare triple {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {191#true} is VALID [2022-04-27 10:19:42,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {316#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 4) 4294967296)) (= (+ 2 main_~sn~0) 0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {294#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:42,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {320#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {316#(or (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 4) 4294967296)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-27 10:19:42,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {320#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} assume !false; {320#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:19:42,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {320#(or (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-27 10:19:42,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret4 := main(); {191#true} is VALID [2022-04-27 10:19:42,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #48#return; {191#true} is VALID [2022-04-27 10:19:42,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-27 10:19:42,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {191#true} is VALID [2022-04-27 10:19:42,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {191#true} is VALID [2022-04-27 10:19:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:42,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230834407] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:42,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:42,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-04-27 10:19:42,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766469017] [2022-04-27 10:19:42,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:42,665 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-04-27 10:19:42,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:42,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:42,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:42,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 10:19:42,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:42,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 10:19:42,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-04-27 10:19:42,718 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:43,344 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-27 10:19:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:19:43,344 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-04-27 10:19:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-27 10:19:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-27 10:19:43,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2022-04-27 10:19:43,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:43,391 INFO L225 Difference]: With dead ends: 49 [2022-04-27 10:19:43,391 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 10:19:43,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2022-04-27 10:19:43,393 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:43,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 61 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:19:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 10:19:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-27 10:19:43,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:43,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:19:43,411 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:19:43,412 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:19:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:43,414 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-27 10:19:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-27 10:19:43,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:43,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:43,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-27 10:19:43,415 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-27 10:19:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:43,416 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-27 10:19:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-27 10:19:43,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:43,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:43,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:43,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:19:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-27 10:19:43,419 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2022-04-27 10:19:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:43,419 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-27 10:19:43,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:19:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 10:19:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 10:19:43,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:43,420 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:43,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:43,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:43,631 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:43,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:43,631 INFO L85 PathProgramCache]: Analyzing trace with hash -668913975, now seen corresponding path program 1 times [2022-04-27 10:19:43,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:43,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694662531] [2022-04-27 10:19:43,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:43,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:43,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:43,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {564#true} is VALID [2022-04-27 10:19:43,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:43,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {564#true} {564#true} #48#return; {564#true} is VALID [2022-04-27 10:19:43,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-27 10:19:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:43,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:43,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:43,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:43,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:43,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 10:19:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:43,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:43,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:43,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:43,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:43,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 10:19:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:43,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:43,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:43,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:43,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} #46#return; {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 10:19:43,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {564#true} call ULTIMATE.init(); {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:43,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {564#true} is VALID [2022-04-27 10:19:43,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:43,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {564#true} #48#return; {564#true} is VALID [2022-04-27 10:19:43,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {564#true} call #t~ret4 := main(); {564#true} is VALID [2022-04-27 10:19:43,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {564#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {569#(= main_~x~0 0)} is VALID [2022-04-27 10:19:43,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#(= main_~x~0 0)} assume !false; {569#(= main_~x~0 0)} is VALID [2022-04-27 10:19:43,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {569#(= main_~x~0 0)} is VALID [2022-04-27 10:19:43,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:43,730 INFO L272 TraceCheckUtils]: 9: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {564#true} is VALID [2022-04-27 10:19:43,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:43,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:43,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:43,731 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {564#true} {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:43,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:43,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:43,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:43,732 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {564#true} is VALID [2022-04-27 10:19:43,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:43,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:43,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:43,733 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {564#true} {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:43,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:43,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:43,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 10:19:43,734 INFO L272 TraceCheckUtils]: 25: Hoare triple {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {564#true} is VALID [2022-04-27 10:19:43,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:43,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:43,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:43,735 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {564#true} {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} #46#return; {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 10:19:43,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !false; {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 10:19:43,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {580#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 10); {565#false} is VALID [2022-04-27 10:19:43,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {565#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {565#false} is VALID [2022-04-27 10:19:43,736 INFO L272 TraceCheckUtils]: 33: Hoare triple {565#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {565#false} is VALID [2022-04-27 10:19:43,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {565#false} ~cond := #in~cond; {565#false} is VALID [2022-04-27 10:19:43,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {565#false} assume 0 == ~cond; {565#false} is VALID [2022-04-27 10:19:43,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {565#false} assume !false; {565#false} is VALID [2022-04-27 10:19:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:19:43,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:43,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694662531] [2022-04-27 10:19:43,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694662531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:43,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883622984] [2022-04-27 10:19:43,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:43,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:43,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:43,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:19:43,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:19:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:43,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 10:19:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:43,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:44,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {564#true} call ULTIMATE.init(); {564#true} is VALID [2022-04-27 10:19:44,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {564#true} is VALID [2022-04-27 10:19:44,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:44,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {564#true} #48#return; {564#true} is VALID [2022-04-27 10:19:44,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {564#true} call #t~ret4 := main(); {564#true} is VALID [2022-04-27 10:19:44,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {564#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {569#(= main_~x~0 0)} is VALID [2022-04-27 10:19:44,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#(= main_~x~0 0)} assume !false; {569#(= main_~x~0 0)} is VALID [2022-04-27 10:19:44,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {569#(= main_~x~0 0)} is VALID [2022-04-27 10:19:44,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {569#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:44,047 INFO L272 TraceCheckUtils]: 9: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {564#true} is VALID [2022-04-27 10:19:44,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:44,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:44,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:44,051 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {564#true} {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:44,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:44,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:44,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {570#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:44,054 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {564#true} is VALID [2022-04-27 10:19:44,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:44,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:44,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:44,055 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {564#true} {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:44,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:44,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:44,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {575#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:44,056 INFO L272 TraceCheckUtils]: 25: Hoare triple {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {564#true} is VALID [2022-04-27 10:19:44,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:44,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:44,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:44,057 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {564#true} {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:44,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:44,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {661#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {565#false} is VALID [2022-04-27 10:19:44,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {565#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {565#false} is VALID [2022-04-27 10:19:44,058 INFO L272 TraceCheckUtils]: 33: Hoare triple {565#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {565#false} is VALID [2022-04-27 10:19:44,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {565#false} ~cond := #in~cond; {565#false} is VALID [2022-04-27 10:19:44,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {565#false} assume 0 == ~cond; {565#false} is VALID [2022-04-27 10:19:44,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {565#false} assume !false; {565#false} is VALID [2022-04-27 10:19:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:19:44,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:44,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {565#false} assume !false; {565#false} is VALID [2022-04-27 10:19:44,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {565#false} assume 0 == ~cond; {565#false} is VALID [2022-04-27 10:19:44,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {565#false} ~cond := #in~cond; {565#false} is VALID [2022-04-27 10:19:44,191 INFO L272 TraceCheckUtils]: 33: Hoare triple {565#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {565#false} is VALID [2022-04-27 10:19:44,191 INFO L290 TraceCheckUtils]: 32: Hoare triple {565#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {565#false} is VALID [2022-04-27 10:19:44,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {713#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {565#false} is VALID [2022-04-27 10:19:44,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {713#(< (mod main_~x~0 4294967296) 10)} assume !false; {713#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-27 10:19:44,195 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {564#true} {713#(< (mod main_~x~0 4294967296) 10)} #46#return; {713#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-27 10:19:44,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:44,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:44,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:44,195 INFO L272 TraceCheckUtils]: 25: Hoare triple {713#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {564#true} is VALID [2022-04-27 10:19:44,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {713#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-27 10:19:44,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-27 10:19:44,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-27 10:19:44,200 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {564#true} {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-27 10:19:44,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:44,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:44,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:44,200 INFO L272 TraceCheckUtils]: 17: Hoare triple {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {564#true} is VALID [2022-04-27 10:19:44,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {735#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-27 10:19:44,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-27 10:19:44,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-27 10:19:44,202 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {564#true} {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-27 10:19:44,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:44,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#true} assume !(0 == ~cond); {564#true} is VALID [2022-04-27 10:19:44,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {564#true} ~cond := #in~cond; {564#true} is VALID [2022-04-27 10:19:44,202 INFO L272 TraceCheckUtils]: 9: Hoare triple {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {564#true} is VALID [2022-04-27 10:19:44,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {760#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-27 10:19:44,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-27 10:19:44,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-27 10:19:44,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {564#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {785#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-27 10:19:44,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {564#true} call #t~ret4 := main(); {564#true} is VALID [2022-04-27 10:19:44,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564#true} {564#true} #48#return; {564#true} is VALID [2022-04-27 10:19:44,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#true} assume true; {564#true} is VALID [2022-04-27 10:19:44,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {564#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {564#true} is VALID [2022-04-27 10:19:44,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {564#true} call ULTIMATE.init(); {564#true} is VALID [2022-04-27 10:19:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 10:19:44,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883622984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:44,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:44,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-27 10:19:44,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488488377] [2022-04-27 10:19:44,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:44,209 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 37 [2022-04-27 10:19:44,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:44,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:19:44,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:44,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:19:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:44,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:19:44,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:19:44,243 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:19:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:44,857 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-27 10:19:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 10:19:44,857 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 37 [2022-04-27 10:19:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:19:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-04-27 10:19:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:19:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-04-27 10:19:44,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2022-04-27 10:19:44,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:44,937 INFO L225 Difference]: With dead ends: 69 [2022-04-27 10:19:44,937 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 10:19:44,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:19:44,939 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:44,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 46 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:19:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 10:19:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-27 10:19:44,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:44,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:19:44,992 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:19:44,993 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:19:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:44,995 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 10:19:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 10:19:44,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:44,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:44,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-27 10:19:44,996 INFO L87 Difference]: Start difference. First operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-27 10:19:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:44,998 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-27 10:19:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-27 10:19:44,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:44,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:44,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:44,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 10:19:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-27 10:19:45,001 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 37 [2022-04-27 10:19:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:45,001 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-27 10:19:45,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 9 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 10:19:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 10:19:45,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 10:19:45,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:45,003 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:45,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:45,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 10:19:45,220 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash -802632614, now seen corresponding path program 2 times [2022-04-27 10:19:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:45,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684029868] [2022-04-27 10:19:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:19:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {1174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1128#true} is VALID [2022-04-27 10:19:45,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1128#true} {1128#true} #48#return; {1128#true} is VALID [2022-04-27 10:19:45,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-27 10:19:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:45,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 10:19:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:45,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 10:19:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:45,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 10:19:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:19:45,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-27 10:19:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:19:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-27 10:19:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:19:45,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-27 10:19:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:19:45,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 10:19:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:19:45,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:19:45,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1128#true} is VALID [2022-04-27 10:19:45,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #48#return; {1128#true} is VALID [2022-04-27 10:19:45,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret4 := main(); {1128#true} is VALID [2022-04-27 10:19:45,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1133#(= main_~x~0 0)} is VALID [2022-04-27 10:19:45,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {1133#(= main_~x~0 0)} assume !false; {1133#(= main_~x~0 0)} is VALID [2022-04-27 10:19:45,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {1133#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1133#(= main_~x~0 0)} is VALID [2022-04-27 10:19:45,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:45,458 INFO L272 TraceCheckUtils]: 9: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:45,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,459 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1128#true} {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:45,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:45,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:45,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:45,460 INFO L272 TraceCheckUtils]: 17: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:45,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,461 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1128#true} {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:45,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:45,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:45,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:45,462 INFO L272 TraceCheckUtils]: 25: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:45,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,462 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1128#true} {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:45,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:45,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:45,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:19:45,464 INFO L272 TraceCheckUtils]: 33: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:45,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,464 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1128#true} {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:19:45,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:19:45,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:19:45,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:19:45,483 INFO L272 TraceCheckUtils]: 41: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:45,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,484 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1128#true} {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:19:45,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:19:45,485 INFO L290 TraceCheckUtils]: 47: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:19:45,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:19:45,486 INFO L272 TraceCheckUtils]: 49: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:45,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,486 INFO L290 TraceCheckUtils]: 51: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,487 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1128#true} {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:19:45,487 INFO L290 TraceCheckUtils]: 54: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:19:45,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:19:45,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:19:45,488 INFO L272 TraceCheckUtils]: 57: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:45,489 INFO L290 TraceCheckUtils]: 58: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,489 INFO L290 TraceCheckUtils]: 59: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,489 INFO L290 TraceCheckUtils]: 60: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,490 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {1128#true} {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:19:45,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:19:45,491 INFO L290 TraceCheckUtils]: 63: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:19:45,491 INFO L290 TraceCheckUtils]: 64: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:19:45,491 INFO L272 TraceCheckUtils]: 65: Hoare triple {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:45,491 INFO L290 TraceCheckUtils]: 66: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:45,492 INFO L290 TraceCheckUtils]: 67: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:45,492 INFO L290 TraceCheckUtils]: 68: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:45,492 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1128#true} {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} #46#return; {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:19:45,492 INFO L290 TraceCheckUtils]: 70: Hoare triple {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !false; {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:19:45,493 INFO L290 TraceCheckUtils]: 71: Hoare triple {1169#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10); {1129#false} is VALID [2022-04-27 10:19:45,493 INFO L290 TraceCheckUtils]: 72: Hoare triple {1129#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1129#false} is VALID [2022-04-27 10:19:45,493 INFO L272 TraceCheckUtils]: 73: Hoare triple {1129#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1129#false} is VALID [2022-04-27 10:19:45,493 INFO L290 TraceCheckUtils]: 74: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2022-04-27 10:19:45,493 INFO L290 TraceCheckUtils]: 75: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2022-04-27 10:19:45,493 INFO L290 TraceCheckUtils]: 76: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2022-04-27 10:19:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 10:19:45,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:19:45,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684029868] [2022-04-27 10:19:45,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684029868] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:19:45,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454536673] [2022-04-27 10:19:45,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:19:45,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:45,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:19:45,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:19:45,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:19:45,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:19:45,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:19:45,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 10:19:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:19:45,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:19:46,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2022-04-27 10:19:46,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1128#true} is VALID [2022-04-27 10:19:46,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #48#return; {1128#true} is VALID [2022-04-27 10:19:46,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret4 := main(); {1128#true} is VALID [2022-04-27 10:19:46,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1133#(= main_~x~0 0)} is VALID [2022-04-27 10:19:46,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {1133#(= main_~x~0 0)} assume !false; {1133#(= main_~x~0 0)} is VALID [2022-04-27 10:19:46,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {1133#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1133#(= main_~x~0 0)} is VALID [2022-04-27 10:19:46,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#(= main_~x~0 0)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:46,136 INFO L272 TraceCheckUtils]: 9: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,137 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1128#true} {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #46#return; {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:46,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !false; {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:46,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:19:46,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {1134#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:46,138 INFO L272 TraceCheckUtils]: 17: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,139 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1128#true} {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #46#return; {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:46,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:46,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:19:46,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {1139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:46,140 INFO L272 TraceCheckUtils]: 25: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,141 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1128#true} {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #46#return; {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:46,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:46,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:19:46,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:19:46,143 INFO L272 TraceCheckUtils]: 33: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,143 INFO L290 TraceCheckUtils]: 36: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,143 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1128#true} {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #46#return; {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:19:46,144 INFO L290 TraceCheckUtils]: 38: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !false; {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:19:46,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:19:46,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {1149#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:19:46,145 INFO L272 TraceCheckUtils]: 41: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,145 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1128#true} {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #46#return; {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:19:46,146 INFO L290 TraceCheckUtils]: 46: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:19:46,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:19:46,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {1154#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:19:46,146 INFO L272 TraceCheckUtils]: 49: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,150 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1128#true} {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #46#return; {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:19:46,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !false; {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:19:46,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 10:19:46,152 INFO L290 TraceCheckUtils]: 56: Hoare triple {1159#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:19:46,152 INFO L272 TraceCheckUtils]: 57: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,154 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {1128#true} {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #46#return; {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:19:46,154 INFO L290 TraceCheckUtils]: 62: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:19:46,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 10:19:46,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {1164#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:19:46,155 INFO L272 TraceCheckUtils]: 65: Hoare triple {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,155 INFO L290 TraceCheckUtils]: 66: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,155 INFO L290 TraceCheckUtils]: 67: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,155 INFO L290 TraceCheckUtils]: 68: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,156 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1128#true} {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #46#return; {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:19:46,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !false; {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 10:19:46,158 INFO L290 TraceCheckUtils]: 71: Hoare triple {1370#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {1129#false} is VALID [2022-04-27 10:19:46,158 INFO L290 TraceCheckUtils]: 72: Hoare triple {1129#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1129#false} is VALID [2022-04-27 10:19:46,158 INFO L272 TraceCheckUtils]: 73: Hoare triple {1129#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1129#false} is VALID [2022-04-27 10:19:46,158 INFO L290 TraceCheckUtils]: 74: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2022-04-27 10:19:46,158 INFO L290 TraceCheckUtils]: 75: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2022-04-27 10:19:46,158 INFO L290 TraceCheckUtils]: 76: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2022-04-27 10:19:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 10:19:46,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:46,497 INFO L290 TraceCheckUtils]: 76: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2022-04-27 10:19:46,498 INFO L290 TraceCheckUtils]: 75: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2022-04-27 10:19:46,498 INFO L290 TraceCheckUtils]: 74: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2022-04-27 10:19:46,498 INFO L272 TraceCheckUtils]: 73: Hoare triple {1129#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1129#false} is VALID [2022-04-27 10:19:46,498 INFO L290 TraceCheckUtils]: 72: Hoare triple {1129#false} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1129#false} is VALID [2022-04-27 10:19:46,498 INFO L290 TraceCheckUtils]: 71: Hoare triple {1422#(< (mod main_~x~0 4294967296) 10)} assume !(~x~0 % 4294967296 < 10); {1129#false} is VALID [2022-04-27 10:19:46,498 INFO L290 TraceCheckUtils]: 70: Hoare triple {1422#(< (mod main_~x~0 4294967296) 10)} assume !false; {1422#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-27 10:19:46,499 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1128#true} {1422#(< (mod main_~x~0 4294967296) 10)} #46#return; {1422#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-27 10:19:46,499 INFO L290 TraceCheckUtils]: 68: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,499 INFO L272 TraceCheckUtils]: 65: Hoare triple {1422#(< (mod main_~x~0 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1422#(< (mod main_~x~0 4294967296) 10)} is VALID [2022-04-27 10:19:46,500 INFO L290 TraceCheckUtils]: 63: Hoare triple {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-27 10:19:46,500 INFO L290 TraceCheckUtils]: 62: Hoare triple {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} assume !false; {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-27 10:19:46,501 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {1128#true} {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} #46#return; {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-27 10:19:46,501 INFO L290 TraceCheckUtils]: 60: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,501 INFO L290 TraceCheckUtils]: 59: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,501 INFO L290 TraceCheckUtils]: 58: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,501 INFO L272 TraceCheckUtils]: 57: Hoare triple {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1444#(< (mod (+ main_~x~0 1) 4294967296) 10)} is VALID [2022-04-27 10:19:46,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-27 10:19:46,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} assume !false; {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-27 10:19:46,503 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1128#true} {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} #46#return; {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-27 10:19:46,503 INFO L290 TraceCheckUtils]: 52: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,503 INFO L272 TraceCheckUtils]: 49: Hoare triple {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1469#(< (mod (+ main_~x~0 2) 4294967296) 10)} is VALID [2022-04-27 10:19:46,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-27 10:19:46,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} assume !false; {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-27 10:19:46,505 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1128#true} {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} #46#return; {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-27 10:19:46,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,505 INFO L272 TraceCheckUtils]: 41: Hoare triple {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1494#(< (mod (+ main_~x~0 3) 4294967296) 10)} is VALID [2022-04-27 10:19:46,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-27 10:19:46,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} assume !false; {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-27 10:19:46,507 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1128#true} {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} #46#return; {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-27 10:19:46,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,508 INFO L272 TraceCheckUtils]: 33: Hoare triple {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1519#(< (mod (+ main_~x~0 4) 4294967296) 10)} is VALID [2022-04-27 10:19:46,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-27 10:19:46,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} assume !false; {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-27 10:19:46,509 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1128#true} {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} #46#return; {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-27 10:19:46,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,510 INFO L272 TraceCheckUtils]: 25: Hoare triple {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1544#(< (mod (+ 5 main_~x~0) 4294967296) 10)} is VALID [2022-04-27 10:19:46,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-27 10:19:46,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} assume !false; {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-27 10:19:46,511 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1128#true} {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} #46#return; {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-27 10:19:46,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,512 INFO L272 TraceCheckUtils]: 17: Hoare triple {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1569#(< (mod (+ main_~x~0 6) 4294967296) 10)} is VALID [2022-04-27 10:19:46,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-27 10:19:46,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} assume !false; {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-27 10:19:46,513 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1128#true} {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} #46#return; {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-27 10:19:46,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {1128#true} assume !(0 == ~cond); {1128#true} is VALID [2022-04-27 10:19:46,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {1128#true} ~cond := #in~cond; {1128#true} is VALID [2022-04-27 10:19:46,513 INFO L272 TraceCheckUtils]: 9: Hoare triple {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {1128#true} is VALID [2022-04-27 10:19:46,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {1594#(< (mod (+ 7 main_~x~0) 4294967296) 10)} is VALID [2022-04-27 10:19:46,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-27 10:19:46,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} assume !false; {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-27 10:19:46,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {1619#(< (mod (+ main_~x~0 8) 4294967296) 10)} is VALID [2022-04-27 10:19:46,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {1128#true} call #t~ret4 := main(); {1128#true} is VALID [2022-04-27 10:19:46,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1128#true} {1128#true} #48#return; {1128#true} is VALID [2022-04-27 10:19:46,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#true} assume true; {1128#true} is VALID [2022-04-27 10:19:46,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {1128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1128#true} is VALID [2022-04-27 10:19:46,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2022-04-27 10:19:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 32 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 10:19:46,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454536673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:46,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:46,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-27 10:19:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845177493] [2022-04-27 10:19:46,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:46,517 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 77 [2022-04-27 10:19:46,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:46,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:19:46,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:46,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 10:19:46,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 10:19:46,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-04-27 10:19:46,585 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:19:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:47,948 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-27 10:19:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:19:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 77 [2022-04-27 10:19:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:19:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:19:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-27 10:19:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:19:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-27 10:19:47,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2022-04-27 10:19:48,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:48,012 INFO L225 Difference]: With dead ends: 77 [2022-04-27 10:19:48,012 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 10:19:48,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2022-04-27 10:19:48,013 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:19:48,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 91 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 10:19:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 10:19:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-27 10:19:48,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:19:48,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 10:19:48,085 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 10:19:48,085 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 10:19:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:48,087 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-04-27 10:19:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-04-27 10:19:48,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:48,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:48,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 67 states. [2022-04-27 10:19:48,088 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 67 states. [2022-04-27 10:19:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:19:48,090 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-04-27 10:19:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-04-27 10:19:48,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:19:48,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:19:48,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:19:48,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:19:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 10:19:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-04-27 10:19:48,093 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 77 [2022-04-27 10:19:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:19:48,093 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-04-27 10:19:48,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 19 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 10:19:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-27 10:19:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-27 10:19:48,095 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:19:48,095 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:19:48,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 10:19:48,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:48,311 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:19:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:19:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1149090924, now seen corresponding path program 3 times [2022-04-27 10:19:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:19:48,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710531608] [2022-04-27 10:19:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:19:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:19:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:19:48,384 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:19:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:19:48,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:19:48,455 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:19:48,456 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:19:48,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:19:48,459 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-27 10:19:48,461 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:19:48,483 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:19:48,483 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-27 10:19:48,484 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:19:48,485 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:19:48,485 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:19:48,485 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:19:48,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:19:48 BoogieIcfgContainer [2022-04-27 10:19:48,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:19:48,486 INFO L158 Benchmark]: Toolchain (without parser) took 8541.51ms. Allocated memory was 167.8MB in the beginning and 255.9MB in the end (delta: 88.1MB). Free memory was 112.1MB in the beginning and 92.3MB in the end (delta: 19.8MB). Peak memory consumption was 108.5MB. Max. memory is 8.0GB. [2022-04-27 10:19:48,486 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 167.8MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:19:48,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.69ms. Allocated memory was 167.8MB in the beginning and 212.9MB in the end (delta: 45.1MB). Free memory was 111.8MB in the beginning and 184.6MB in the end (delta: -72.8MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-04-27 10:19:48,486 INFO L158 Benchmark]: Boogie Preprocessor took 17.05ms. Allocated memory is still 212.9MB. Free memory was 184.6MB in the beginning and 183.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:19:48,486 INFO L158 Benchmark]: RCFGBuilder took 241.19ms. Allocated memory is still 212.9MB. Free memory was 183.0MB in the beginning and 172.0MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 10:19:48,487 INFO L158 Benchmark]: TraceAbstraction took 8095.04ms. Allocated memory was 212.9MB in the beginning and 255.9MB in the end (delta: 43.0MB). Free memory was 171.5MB in the beginning and 92.3MB in the end (delta: 79.2MB). Peak memory consumption was 124.3MB. Max. memory is 8.0GB. [2022-04-27 10:19:48,487 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 167.8MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.69ms. Allocated memory was 167.8MB in the beginning and 212.9MB in the end (delta: 45.1MB). Free memory was 111.8MB in the beginning and 184.6MB in the end (delta: -72.8MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.05ms. Allocated memory is still 212.9MB. Free memory was 184.6MB in the beginning and 183.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 241.19ms. Allocated memory is still 212.9MB. Free memory was 183.0MB in the beginning and 172.0MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8095.04ms. Allocated memory was 212.9MB in the beginning and 255.9MB in the end (delta: 43.0MB). Free memory was 171.5MB in the beginning and 92.3MB in the end (delta: 79.2MB). Peak memory consumption was 124.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int sn=0; [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L23] unsigned int x=0; VAL [loop1=50, n1=51, sn=0, x=0] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=0, x=0] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=2, x=0] [L28] x++ VAL [loop1=50, n1=51, sn=2, x=1] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=2, x=1] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=2, x=1] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=4, x=1] [L28] x++ VAL [loop1=50, n1=51, sn=4, x=2] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=4, x=2] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=4, x=2] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=6, x=2] [L28] x++ VAL [loop1=50, n1=51, sn=6, x=3] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=6, x=3] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=6, x=3] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=8, x=3] [L28] x++ VAL [loop1=50, n1=51, sn=8, x=4] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=8, x=4] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=8, x=4] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=10, x=4] [L28] x++ VAL [loop1=50, n1=51, sn=10, x=5] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=10, x=5] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=10, x=5] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=12, x=5] [L28] x++ VAL [loop1=50, n1=51, sn=12, x=6] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=12, x=6] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=12, x=6] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=14, x=6] [L28] x++ VAL [loop1=50, n1=51, sn=14, x=7] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=14, x=7] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=14, x=7] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=16, x=7] [L28] x++ VAL [loop1=50, n1=51, sn=16, x=8] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=16, x=8] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=16, x=8] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=18, x=8] [L28] x++ VAL [loop1=50, n1=51, sn=18, x=9] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=18, x=9] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=18, x=9] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [loop1=50, n1=51, sn=20, x=9] [L28] x++ VAL [loop1=50, n1=51, sn=20, x=10] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=50, n1=51, sn=20, x=10] [L24] COND TRUE 1 VAL [loop1=50, n1=51, sn=20, x=10] [L25] COND FALSE !(x<10) VAL [loop1=50, n1=51, sn=20, x=10] [L28] x++ VAL [loop1=50, n1=51, sn=20, x=11] [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L15] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 975 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 73 mSDtfsCounter, 975 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 274 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1670 SizeOfPredicates, 6 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 510/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 10:19:48,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...