/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum03-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:05:56,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:05:56,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:05:56,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:05:56,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:05:56,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:05:56,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:05:56,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:05:56,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:05:56,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:05:56,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:05:56,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:05:56,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:05:56,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:05:56,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:05:56,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:05:56,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:05:56,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:05:56,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:05:56,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:05:56,796 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:05:56,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:05:56,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:05:56,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:05:56,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:05:56,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:05:56,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:05:56,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:05:56,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:05:56,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:05:56,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:05:56,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:05:56,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:05:56,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:05:56,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:05:56,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:05:56,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:05:56,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:05:56,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:05:56,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:05:56,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:05:56,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:05:56,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:05:56,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:05:56,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:05:56,835 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:05:56,835 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:05:56,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:05:56,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:05:56,836 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:05:56,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:05:56,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:05:56,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:05:56,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:05:56,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:05:56,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:05:56,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:05:56,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:05:56,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:05:56,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:05:56,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:05:56,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:05:56,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:05:56,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:05:56,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:05:56,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:05:56,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:05:56,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:05:56,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:05:56,839 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:05:56,839 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:05:56,839 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:05:56,839 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-15 00:05:56,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:05:57,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:05:57,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:05:57,015 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:05:57,017 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:05:57,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-2.i [2022-04-15 00:05:57,060 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f935ebf/d7bfd636bf5b47bea377911c3869c5f8/FLAG123dc945c [2022-04-15 00:05:57,350 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:05:57,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-2.i [2022-04-15 00:05:57,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f935ebf/d7bfd636bf5b47bea377911c3869c5f8/FLAG123dc945c [2022-04-15 00:05:57,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f935ebf/d7bfd636bf5b47bea377911c3869c5f8 [2022-04-15 00:05:57,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:05:57,787 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:05:57,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:05:57,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:05:57,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:05:57,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:05:57" (1/1) ... [2022-04-15 00:05:57,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329a16c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:57, skipping insertion in model container [2022-04-15 00:05:57,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:05:57" (1/1) ... [2022-04-15 00:05:57,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:05:57,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:05:57,976 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-2.i[807,820] [2022-04-15 00:05:57,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:05:58,001 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:05:58,010 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-2.i[807,820] [2022-04-15 00:05:58,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:05:58,024 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:05:58,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:58 WrapperNode [2022-04-15 00:05:58,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:05:58,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:05:58,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:05:58,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:05:58,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:58" (1/1) ... [2022-04-15 00:05:58,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:58" (1/1) ... [2022-04-15 00:05:58,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:58" (1/1) ... [2022-04-15 00:05:58,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:58" (1/1) ... [2022-04-15 00:05:58,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:58" (1/1) ... [2022-04-15 00:05:58,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:58" (1/1) ... [2022-04-15 00:05:58,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:58" (1/1) ... [2022-04-15 00:05:58,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:05:58,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:05:58,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:05:58,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:05:58,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:58" (1/1) ... [2022-04-15 00:05:58,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:05:58,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:58,081 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-15 00:05:58,083 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-15 00:05:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:05:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:05:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:05:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:05:58,105 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:05:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:05:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:05:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:05:58,105 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:05:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:05:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:05:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:05:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 00:05:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:05:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:05:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:05:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:05:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:05:58,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:05:58,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:05:58,148 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:05:58,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:05:58,238 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:05:58,242 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:05:58,242 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:05:58,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:58 BoogieIcfgContainer [2022-04-15 00:05:58,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:05:58,244 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:05:58,244 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:05:58,245 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:05:58,247 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:58" (1/1) ... [2022-04-15 00:05:58,248 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:05:58,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:05:58 BasicIcfg [2022-04-15 00:05:58,258 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:05:58,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:05:58,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:05:58,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:05:58,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:05:57" (1/4) ... [2022-04-15 00:05:58,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120d58cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:05:58, skipping insertion in model container [2022-04-15 00:05:58,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:05:58" (2/4) ... [2022-04-15 00:05:58,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120d58cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:05:58, skipping insertion in model container [2022-04-15 00:05:58,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:05:58" (3/4) ... [2022-04-15 00:05:58,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120d58cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:05:58, skipping insertion in model container [2022-04-15 00:05:58,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:05:58" (4/4) ... [2022-04-15 00:05:58,264 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-2.iqvasr [2022-04-15 00:05:58,267 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:05:58,267 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:05:58,303 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:05:58,308 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:05:58,309 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:05:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 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-15 00:05:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:05:58,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:58,328 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:58,328 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:58,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:58,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1196085861, now seen corresponding path program 1 times [2022-04-15 00:05:58,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:58,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998470106] [2022-04-15 00:05:58,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:58,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:58,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:58,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [46] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-15 00:05:58,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:05:58,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:05:58,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [44] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:58,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [46] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-15 00:05:58,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:05:58,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:05:58,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [45] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:05:58,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [48] mainENTRY-->L27-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_4 0) (= v_main_~sn~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_4, main_~sn~0=v_main_~sn~0_4, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {26#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-15 00:05:58,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(and (= main_~sn~0 0) (= main_~x~0 0))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {27#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} is VALID [2022-04-15 00:05:58,860 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {28#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:05:58,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#(not (= |__VERIFIER_assert_#in~cond| 0))} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:05:58,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= __VERIFIER_assert_~cond 0))} [56] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 00:05:58,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [58] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 00:05:58,866 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-15 00:05:58,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:58,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998470106] [2022-04-15 00:05:58,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998470106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:05:58,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:05:58,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:05:58,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284181416] [2022-04-15 00:05:58,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:05:58,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2022-04-15 00:05:58,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:05:58,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-15 00:05:58,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:58,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:05:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:05:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:05:58,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:05:58,917 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 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 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-15 00:05:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:59,193 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-15 00:05:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:05:59,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2022-04-15 00:05:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:05:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-15 00:05:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-15 00:05:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-15 00:05:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-15 00:05:59,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-15 00:05:59,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:05:59,251 INFO L225 Difference]: With dead ends: 33 [2022-04-15 00:05:59,251 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 00:05:59,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:05:59,270 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:05:59,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:05:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 00:05:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-15 00:05:59,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:05:59,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-15 00:05:59,306 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-15 00:05:59,307 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-15 00:05:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:59,309 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 00:05:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 00:05:59,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:59,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:59,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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 21 states. [2022-04-15 00:05:59,310 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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 21 states. [2022-04-15 00:05:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:05:59,312 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 00:05:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 00:05:59,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:05:59,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:05:59,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:05:59,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:05:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-15 00:05:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 00:05:59,316 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2022-04-15 00:05:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:05:59,316 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 00:05:59,316 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-15 00:05:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 00:05:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:05:59,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:05:59,317 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:05:59,317 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:05:59,317 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:05:59,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:05:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash 593480926, now seen corresponding path program 1 times [2022-04-15 00:05:59,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:05:59,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010599991] [2022-04-15 00:05:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:59,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:05:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:59,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:05:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:59,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [46] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {162#true} is VALID [2022-04-15 00:05:59,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162#true} {162#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 00:05:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:59,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#true} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {162#true} is VALID [2022-04-15 00:05:59,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} [57] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} [60] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [63] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:59,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} [44] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:05:59,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [46] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {162#true} is VALID [2022-04-15 00:05:59,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} [45] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} [48] mainENTRY-->L27-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_4 0) (= v_main_~sn~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_4, main_~sn~0=v_main_~sn~0_4, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {167#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-15 00:05:59,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {167#(and (= main_~sn~0 0) (= main_~x~0 0))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:59,476 INFO L272 TraceCheckUtils]: 7: Hoare triple {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {162#true} is VALID [2022-04-15 00:05:59,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#true} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {162#true} is VALID [2022-04-15 00:05:59,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {162#true} [57] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#true} [60] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,477 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {162#true} {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [63] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:59,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {173#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} is VALID [2022-04-15 00:05:59,481 INFO L272 TraceCheckUtils]: 13: Hoare triple {173#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:05:59,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {174#(not (= |__VERIFIER_assert_#in~cond| 0))} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {175#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:05:59,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {175#(not (= __VERIFIER_assert_~cond 0))} [56] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {163#false} is VALID [2022-04-15 00:05:59,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#false} [58] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#false} is VALID [2022-04-15 00:05:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:05:59,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010599991] [2022-04-15 00:05:59,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010599991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:05:59,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684067963] [2022-04-15 00:05:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:05:59,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:05:59,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:05:59,484 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-15 00:05:59,485 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-15 00:05:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:59,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 00:05:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:05:59,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:05:59,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} [44] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} [46] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {162#true} is VALID [2022-04-15 00:05:59,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} [45] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} [48] mainENTRY-->L27-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_4 0) (= v_main_~sn~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_4, main_~sn~0=v_main_~sn~0_4, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {167#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-15 00:05:59,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {167#(and (= main_~sn~0 0) (= main_~x~0 0))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:59,861 INFO L272 TraceCheckUtils]: 7: Hoare triple {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {162#true} is VALID [2022-04-15 00:05:59,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#true} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {162#true} is VALID [2022-04-15 00:05:59,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {162#true} [57] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#true} [60] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:05:59,862 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {162#true} {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [63] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-15 00:05:59,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {168#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {216#(and (<= 4 main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)) (<= main_~x~0 2))} is VALID [2022-04-15 00:05:59,864 INFO L272 TraceCheckUtils]: 13: Hoare triple {216#(and (<= 4 main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)) (<= main_~x~0 2))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:05:59,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {220#(<= 1 |__VERIFIER_assert_#in~cond|)} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:05:59,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#(<= 1 __VERIFIER_assert_~cond)} [56] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {163#false} is VALID [2022-04-15 00:05:59,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#false} [58] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#false} is VALID [2022-04-15 00:05:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:05:59,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:06:00,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {163#false} [58] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#false} is VALID [2022-04-15 00:06:00,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#(<= 1 __VERIFIER_assert_~cond)} [56] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {163#false} is VALID [2022-04-15 00:06:00,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {220#(<= 1 |__VERIFIER_assert_#in~cond|)} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:06:00,172 INFO L272 TraceCheckUtils]: 13: Hoare triple {240#(or (= (mod main_~sn~0 4294967296) 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:06:00,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {240#(or (= (mod main_~sn~0 4294967296) 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} is VALID [2022-04-15 00:06:00,175 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {162#true} {244#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} [63] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {244#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-15 00:06:00,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#true} [60] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:06:00,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {162#true} [57] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:06:00,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {162#true} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {162#true} is VALID [2022-04-15 00:06:00,175 INFO L272 TraceCheckUtils]: 7: Hoare triple {244#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {162#true} is VALID [2022-04-15 00:06:00,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {263#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {244#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-15 00:06:00,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} [48] mainENTRY-->L27-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_4 0) (= v_main_~sn~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_4, main_~sn~0=v_main_~sn~0_4, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {263#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} is VALID [2022-04-15 00:06:00,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} [45] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:06:00,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:06:00,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:06:00,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} [46] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {162#true} is VALID [2022-04-15 00:06:00,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} [44] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {162#true} is VALID [2022-04-15 00:06:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:06:00,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684067963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:06:00,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:06:00,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 00:06:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518569946] [2022-04-15 00:06:00,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:06:00,180 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 17 [2022-04-15 00:06:00,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:06:00,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:06:00,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:06:00,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 00:06:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:06:00,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 00:06:00,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:06:00,208 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:06:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:01,531 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 00:06:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 00:06:01,532 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 17 [2022-04-15 00:06:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:06:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:06:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 00:06:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:06:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 00:06:01,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-15 00:06:01,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:06:01,647 INFO L225 Difference]: With dead ends: 25 [2022-04-15 00:06:01,647 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:06:01,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-04-15 00:06:01,648 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 00:06:01,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 46 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 00:06:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:06:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:06:01,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:06:01,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:06:01,649 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:06:01,649 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:06:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:01,650 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:06:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:06:01,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:06:01,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:06:01,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:06:01,650 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:06:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:01,650 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:06:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:06:01,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:06:01,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:06:01,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:06:01,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:06:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:06:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:06:01,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-15 00:06:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:06:01,651 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:06:01,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:06:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:06:01,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:06:01,653 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:06:01,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:06:01,870 WARN L460 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-15 00:06:01,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:06:02,011 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:06:02,012 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:06:02,012 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:06:02,012 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:06:02,012 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:06:02,012 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:06:02,012 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:06:02,012 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 29) the Hoare annotation is: true [2022-04-15 00:06:02,012 INFO L878 garLoopResultBuilder]: At program point L27-1(lines 24 28) the Hoare annotation is: (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) [2022-04-15 00:06:02,012 INFO L882 garLoopResultBuilder]: For program point L24-2(lines 20 29) no Hoare annotation was computed. [2022-04-15 00:06:02,012 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)) [2022-04-15 00:06:02,012 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 20 29) no Hoare annotation was computed. [2022-04-15 00:06:02,012 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 13 18) the Hoare annotation is: true [2022-04-15 00:06:02,013 INFO L882 garLoopResultBuilder]: For program point L14(lines 14 16) no Hoare annotation was computed. [2022-04-15 00:06:02,013 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-15 00:06:02,013 INFO L882 garLoopResultBuilder]: For program point L14-2(lines 13 18) no Hoare annotation was computed. [2022-04-15 00:06:02,013 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-04-15 00:06:02,013 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 13 18) no Hoare annotation was computed. [2022-04-15 00:06:02,015 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-15 00:06:02,016 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:06:02,026 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:06:02,027 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 00:06:02,027 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:06:02,027 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-15 00:06:02,027 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-15 00:06:02,068 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 00:06:02,068 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-15 00:06:02,068 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:06:02,069 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-15 00:06:02,069 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:06:02,069 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:06:02,069 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-15 00:06:02,069 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:06:02,069 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:06:02,069 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:06:02,069 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:06:02,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:06:02 BasicIcfg [2022-04-15 00:06:02,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:06:02,077 INFO L158 Benchmark]: Toolchain (without parser) took 4290.11ms. Allocated memory was 166.7MB in the beginning and 200.3MB in the end (delta: 33.6MB). Free memory was 111.2MB in the beginning and 127.6MB in the end (delta: -16.5MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-04-15 00:06:02,081 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:06:02,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.00ms. Allocated memory was 166.7MB in the beginning and 200.3MB in the end (delta: 33.6MB). Free memory was 111.0MB in the beginning and 173.4MB in the end (delta: -62.4MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2022-04-15 00:06:02,082 INFO L158 Benchmark]: Boogie Preprocessor took 27.95ms. Allocated memory is still 200.3MB. Free memory was 173.4MB in the beginning and 171.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:06:02,082 INFO L158 Benchmark]: RCFGBuilder took 187.20ms. Allocated memory is still 200.3MB. Free memory was 171.9MB in the beginning and 161.8MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 00:06:02,082 INFO L158 Benchmark]: IcfgTransformer took 13.98ms. Allocated memory is still 200.3MB. Free memory was 161.8MB in the beginning and 160.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:06:02,083 INFO L158 Benchmark]: TraceAbstraction took 3817.17ms. Allocated memory is still 200.3MB. Free memory was 159.9MB in the beginning and 127.6MB in the end (delta: 32.3MB). Peak memory consumption was 32.0MB. Max. memory is 8.0GB. [2022-04-15 00:06:02,085 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.09ms. Allocated memory is still 166.7MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.00ms. Allocated memory was 166.7MB in the beginning and 200.3MB in the end (delta: 33.6MB). Free memory was 111.0MB in the beginning and 173.4MB in the end (delta: -62.4MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.95ms. Allocated memory is still 200.3MB. Free memory was 173.4MB in the beginning and 171.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 187.20ms. Allocated memory is still 200.3MB. Free memory was 171.9MB in the beginning and 161.8MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 13.98ms. Allocated memory is still 200.3MB. Free memory was 161.8MB in the beginning and 160.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3817.17ms. Allocated memory is still 200.3MB. Free memory was 159.9MB in the beginning and 127.6MB in the end (delta: 32.3MB). Peak memory consumption was 32.0MB. 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 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 19 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=1, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 20 NumberOfFragments, 37 HoareAnnotationTreeSize, 11 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 221 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 345 SizeOfPredicates, 1 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6/12 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (2 + sn) % 4294967296 == (x * 2 + 2) % 4294967296 RESULT: Ultimate proved your program to be correct! [2022-04-15 00:06:02,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...